java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-15 10:45:03,728 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-15 10:45:03,730 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-15 10:45:03,745 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-15 10:45:03,745 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-15 10:45:03,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-15 10:45:03,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-15 10:45:03,753 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-15 10:45:03,755 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-15 10:45:03,757 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-15 10:45:03,758 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-15 10:45:03,758 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-15 10:45:03,760 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-15 10:45:03,761 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-15 10:45:03,765 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-15 10:45:03,766 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-15 10:45:03,767 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-15 10:45:03,769 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-15 10:45:03,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-15 10:45:03,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-15 10:45:03,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-15 10:45:03,785 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-15 10:45:03,790 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-15 10:45:03,792 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-15 10:45:03,792 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-15 10:45:03,793 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-15 10:45:03,794 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-15 10:45:03,794 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-15 10:45:03,798 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-15 10:45:03,799 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-15 10:45:03,799 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-15 10:45:03,802 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-15 10:45:03,802 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-15 10:45:03,802 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-15 10:45:03,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-15 10:45:03,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-15 10:45:03,804 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-02-15 10:45:03,816 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-15 10:45:03,817 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-15 10:45:03,817 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-15 10:45:03,818 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-15 10:45:03,818 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-15 10:45:03,818 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-15 10:45:03,818 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-15 10:45:03,818 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-15 10:45:03,819 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-15 10:45:03,819 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-15 10:45:03,819 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-15 10:45:03,819 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-15 10:45:03,819 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-15 10:45:03,819 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-15 10:45:03,820 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-15 10:45:03,820 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-15 10:45:03,820 INFO L133 SettingsManager]: * Use SBE=true [2019-02-15 10:45:03,821 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-15 10:45:03,821 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-15 10:45:03,821 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-15 10:45:03,821 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-15 10:45:03,821 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-15 10:45:03,822 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-15 10:45:03,822 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-15 10:45:03,822 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-15 10:45:03,822 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-15 10:45:03,822 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-15 10:45:03,823 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-15 10:45:03,823 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-15 10:45:03,823 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-15 10:45:03,823 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-15 10:45:03,823 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-15 10:45:03,824 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-15 10:45:03,824 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-15 10:45:03,824 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-15 10:45:03,824 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-15 10:45:03,824 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-15 10:45:03,825 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-15 10:45:03,825 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-15 10:45:03,825 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-15 10:45:03,855 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-15 10:45:03,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-15 10:45:03,870 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-15 10:45:03,872 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-15 10:45:03,872 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-15 10:45:03,873 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2019-02-15 10:45:03,873 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2019-02-15 10:45:03,912 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-15 10:45:03,914 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-15 10:45:03,914 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-15 10:45:03,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-15 10:45:03,915 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-15 10:45:03,931 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:03,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:03,950 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-15 10:45:03,951 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-15 10:45:03,951 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-15 10:45:03,966 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-15 10:45:03,967 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-15 10:45:03,968 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-15 10:45:03,968 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-15 10:45:03,979 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:03,979 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:03,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:03,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:03,985 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:03,988 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:03,989 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/1) ... [2019-02-15 10:45:03,991 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-15 10:45:03,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-15 10:45:03,992 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-15 10:45:03,992 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-15 10:45:03,993 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (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-15 10:45:04,069 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-15 10:45:04,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-15 10:45:04,070 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-02-15 10:45:04,373 INFO L278 CfgBuilder]: Using library mode [2019-02-15 10:45:04,373 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-02-15 10:45:04,374 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:04 BoogieIcfgContainer [2019-02-15 10:45:04,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-15 10:45:04,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-15 10:45:04,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-15 10:45:04,379 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-15 10:45:04,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.02 10:45:03" (1/2) ... [2019-02-15 10:45:04,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5411c265 and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:45:04, skipping insertion in model container [2019-02-15 10:45:04,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:45:04" (2/2) ... [2019-02-15 10:45:04,384 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2019-02-15 10:45:04,394 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-15 10:45:04,402 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-15 10:45:04,420 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-15 10:45:04,460 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-15 10:45:04,460 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-15 10:45:04,460 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-15 10:45:04,460 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-15 10:45:04,461 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-15 10:45:04,461 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-15 10:45:04,461 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-15 10:45:04,461 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-15 10:45:04,476 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-15 10:45:04,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-15 10:45:04,482 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:04,483 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-15 10:45:04,485 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:04,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:04,492 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2019-02-15 10:45:04,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:04,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:04,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:04,707 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-15 10:45:04,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-15 10:45:04,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-02-15 10:45:04,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:45:04,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-15 10:45:04,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-15 10:45:04,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-15 10:45:04,755 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-02-15 10:45:04,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:04,897 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-02-15 10:45:04,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-15 10:45:04,899 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-15 10:45:04,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:04,910 INFO L225 Difference]: With dead ends: 15 [2019-02-15 10:45:04,910 INFO L226 Difference]: Without dead ends: 8 [2019-02-15 10:45:04,913 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-02-15 10:45:04,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-15 10:45:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-02-15 10:45:04,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-15 10:45:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-15 10:45:04,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2019-02-15 10:45:04,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:04,949 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-15 10:45:04,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-15 10:45:04,949 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-15 10:45:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-15 10:45:04,949 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:04,949 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-15 10:45:04,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:04,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:04,950 INFO L82 PathProgramCache]: Analyzing trace with hash 893294860, now seen corresponding path program 1 times [2019-02-15 10:45:04,950 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:04,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:04,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:04,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:05,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:05,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,030 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:05,031 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-15 10:45:05,033 INFO L207 CegarAbsIntRunner]: [0], [6], [7], [8], [12] [2019-02-15 10:45:05,072 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-15 10:45:05,073 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-15 10:45:05,195 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-15 10:45:05,197 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 4 different actions 12 times. Never widened. Performed 84 root evaluator evaluations with a maximum evaluation depth of 3. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-15 10:45:05,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:05,204 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-15 10:45:05,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,204 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:05,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:05,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:05,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:05,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:05,357 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:05,390 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:05,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:05,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:05,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:05,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:05,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2019-02-15 10:45:05,635 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:05,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-15 10:45:05,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-15 10:45:05,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:45:05,637 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-15 10:45:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:05,710 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-15 10:45:05,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-15 10:45:05,712 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-15 10:45:05,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:05,713 INFO L225 Difference]: With dead ends: 12 [2019-02-15 10:45:05,713 INFO L226 Difference]: Without dead ends: 11 [2019-02-15 10:45:05,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-02-15 10:45:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-15 10:45:05,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-15 10:45:05,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-15 10:45:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-15 10:45:05,720 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2019-02-15 10:45:05,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:05,720 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-15 10:45:05,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-15 10:45:05,721 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-15 10:45:05,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-15 10:45:05,721 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:05,721 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2019-02-15 10:45:05,722 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:05,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:05,722 INFO L82 PathProgramCache]: Analyzing trace with hash 529849760, now seen corresponding path program 2 times [2019-02-15 10:45:05,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:05,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:05,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:05,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:05,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:05,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:05,901 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:05,901 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:05,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:05,901 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-02-15 10:45:05,921 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:05,921 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:05,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-15 10:45:05,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:05,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:06,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:06,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:06,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:06,082 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:06,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:06,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:06,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:06,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-02-15 10:45:06,316 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:06,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-15 10:45:06,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-15 10:45:06,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:45:06,318 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-02-15 10:45:06,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:06,457 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-15 10:45:06,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-15 10:45:06,459 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-02-15 10:45:06,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:06,460 INFO L225 Difference]: With dead ends: 15 [2019-02-15 10:45:06,460 INFO L226 Difference]: Without dead ends: 14 [2019-02-15 10:45:06,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-02-15 10:45:06,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-15 10:45:06,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2019-02-15 10:45:06,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-15 10:45:06,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-15 10:45:06,465 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2019-02-15 10:45:06,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:06,466 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-15 10:45:06,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-15 10:45:06,466 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-15 10:45:06,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-15 10:45:06,467 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:06,467 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1] [2019-02-15 10:45:06,467 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:06,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:06,467 INFO L82 PathProgramCache]: Analyzing trace with hash 749428876, now seen corresponding path program 3 times [2019-02-15 10:45:06,467 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:06,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:06,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:06,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:06,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:06,549 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,550 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:06,550 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:06,550 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:06,550 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:06,551 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-02-15 10:45:06,561 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:06,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:06,589 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:06,589 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:06,591 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:06,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:06,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:06,628 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:06,628 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:06,741 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:06,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:06,860 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:06,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:06,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-02-15 10:45:06,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:06,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-15 10:45:06,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-15 10:45:06,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:45:06,882 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2019-02-15 10:45:07,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:07,204 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-15 10:45:07,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-15 10:45:07,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2019-02-15 10:45:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:07,205 INFO L225 Difference]: With dead ends: 18 [2019-02-15 10:45:07,206 INFO L226 Difference]: Without dead ends: 17 [2019-02-15 10:45:07,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2019-02-15 10:45:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-15 10:45:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-15 10:45:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-15 10:45:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-15 10:45:07,210 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2019-02-15 10:45:07,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:07,211 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-15 10:45:07,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-15 10:45:07,211 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-15 10:45:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-15 10:45:07,212 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:07,212 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2019-02-15 10:45:07,212 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:07,212 INFO L82 PathProgramCache]: Analyzing trace with hash 995681824, now seen corresponding path program 4 times [2019-02-15 10:45:07,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:07,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,214 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:07,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:07,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:07,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:07,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:07,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:07,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:07,390 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-02-15 10:45:07,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:07,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:07,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:07,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:07,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:07,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:07,465 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:07,543 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:07,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:07,626 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:07,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:07,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-02-15 10:45:07,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:07,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-15 10:45:07,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-15 10:45:07,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:45:07,648 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-02-15 10:45:07,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:07,708 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-15 10:45:07,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-15 10:45:07,710 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-02-15 10:45:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:07,711 INFO L225 Difference]: With dead ends: 21 [2019-02-15 10:45:07,712 INFO L226 Difference]: Without dead ends: 20 [2019-02-15 10:45:07,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2019-02-15 10:45:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-15 10:45:07,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-02-15 10:45:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-15 10:45:07,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-15 10:45:07,716 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2019-02-15 10:45:07,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:07,717 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-15 10:45:07,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-15 10:45:07,717 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-15 10:45:07,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-15 10:45:07,722 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:07,722 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1] [2019-02-15 10:45:07,722 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:07,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:07,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1313114124, now seen corresponding path program 5 times [2019-02-15 10:45:07,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:07,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:07,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:07,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:07,965 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:07,966 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:07,966 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:07,966 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:07,966 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:07,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:07,967 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-02-15 10:45:07,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:07,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:07,997 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-15 10:45:07,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:08,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:08,012 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:08,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:08,188 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:08,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:08,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:08,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-02-15 10:45:08,363 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:08,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-15 10:45:08,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-15 10:45:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:45:08,364 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 14 states. [2019-02-15 10:45:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:08,417 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-15 10:45:08,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-15 10:45:08,418 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-02-15 10:45:08,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:08,419 INFO L225 Difference]: With dead ends: 24 [2019-02-15 10:45:08,419 INFO L226 Difference]: Without dead ends: 23 [2019-02-15 10:45:08,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2019-02-15 10:45:08,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-15 10:45:08,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-02-15 10:45:08,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-15 10:45:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-15 10:45:08,425 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2019-02-15 10:45:08,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:08,425 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-15 10:45:08,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-15 10:45:08,425 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-15 10:45:08,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-15 10:45:08,426 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:08,426 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1] [2019-02-15 10:45:08,426 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:08,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:08,427 INFO L82 PathProgramCache]: Analyzing trace with hash 420777632, now seen corresponding path program 6 times [2019-02-15 10:45:08,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:08,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:08,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:08,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:08,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:08,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:08,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:08,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:08,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:08,546 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:08,557 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:08,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:08,568 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:08,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:08,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:08,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:08,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:08,588 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:08,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:08,806 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:08,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:08,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-02-15 10:45:08,825 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:08,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-15 10:45:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-15 10:45:08,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:45:08,827 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2019-02-15 10:45:08,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:08,896 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-15 10:45:08,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-15 10:45:08,897 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2019-02-15 10:45:08,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:08,898 INFO L225 Difference]: With dead ends: 27 [2019-02-15 10:45:08,899 INFO L226 Difference]: Without dead ends: 26 [2019-02-15 10:45:08,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2019-02-15 10:45:08,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-15 10:45:08,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-02-15 10:45:08,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-15 10:45:08,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-15 10:45:08,904 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2019-02-15 10:45:08,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:08,904 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-15 10:45:08,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-15 10:45:08,904 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-15 10:45:08,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-15 10:45:08,905 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:08,905 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1] [2019-02-15 10:45:08,905 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:08,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:08,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1623060596, now seen corresponding path program 7 times [2019-02-15 10:45:08,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:08,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:08,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:08,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:08,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:09,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:09,097 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:09,097 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:09,098 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:09,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:09,098 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:09,107 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:09,108 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:09,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:09,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:09,125 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:09,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:09,133 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:09,134 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:09,308 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:09,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:09,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:09,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-02-15 10:45:09,475 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:09,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-15 10:45:09,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-15 10:45:09,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-15 10:45:09,476 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2019-02-15 10:45:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:09,655 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-15 10:45:09,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-15 10:45:09,656 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-02-15 10:45:09,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:09,657 INFO L225 Difference]: With dead ends: 30 [2019-02-15 10:45:09,657 INFO L226 Difference]: Without dead ends: 29 [2019-02-15 10:45:09,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2019-02-15 10:45:09,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-15 10:45:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-02-15 10:45:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-15 10:45:09,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-15 10:45:09,663 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2019-02-15 10:45:09,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:09,667 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-15 10:45:09,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-15 10:45:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-15 10:45:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-15 10:45:09,668 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:09,668 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1] [2019-02-15 10:45:09,668 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:09,670 INFO L82 PathProgramCache]: Analyzing trace with hash 143644448, now seen corresponding path program 8 times [2019-02-15 10:45:09,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:09,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:09,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:09,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:09,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:09,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:09,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:09,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:09,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:09,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:09,869 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:09,885 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:09,885 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:09,907 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-15 10:45:09,907 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:09,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:09,923 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:09,924 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:09,932 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:09,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:10,069 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:10,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:10,260 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:10,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:10,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-02-15 10:45:10,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:10,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-15 10:45:10,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-15 10:45:10,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-15 10:45:10,283 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2019-02-15 10:45:10,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:10,443 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-15 10:45:10,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-15 10:45:10,444 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-02-15 10:45:10,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:10,445 INFO L225 Difference]: With dead ends: 33 [2019-02-15 10:45:10,445 INFO L226 Difference]: Without dead ends: 32 [2019-02-15 10:45:10,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2019-02-15 10:45:10,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-15 10:45:10,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-02-15 10:45:10,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-15 10:45:10,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-15 10:45:10,450 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2019-02-15 10:45:10,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:10,451 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-15 10:45:10,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-15 10:45:10,451 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-15 10:45:10,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-15 10:45:10,452 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:10,452 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1] [2019-02-15 10:45:10,452 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:10,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:10,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1524365068, now seen corresponding path program 9 times [2019-02-15 10:45:10,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:10,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:10,454 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:10,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:10,628 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:10,628 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:10,628 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:10,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:10,628 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:10,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:10,638 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:10,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:10,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:10,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:10,688 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:10,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:10,698 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:10,699 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:11,057 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:11,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:11,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:11,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-02-15 10:45:11,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:11,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-15 10:45:11,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-15 10:45:11,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-15 10:45:11,545 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 22 states. [2019-02-15 10:45:11,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:11,620 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-15 10:45:11,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-15 10:45:11,621 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-02-15 10:45:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:11,622 INFO L225 Difference]: With dead ends: 36 [2019-02-15 10:45:11,622 INFO L226 Difference]: Without dead ends: 35 [2019-02-15 10:45:11,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2019-02-15 10:45:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-15 10:45:11,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-15 10:45:11,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-15 10:45:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-15 10:45:11,628 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2019-02-15 10:45:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:11,629 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-15 10:45:11,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-15 10:45:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-15 10:45:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-15 10:45:11,630 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:11,630 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1] [2019-02-15 10:45:11,630 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:11,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:11,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1670561696, now seen corresponding path program 10 times [2019-02-15 10:45:11,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:11,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:11,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:11,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:11,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:11,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:11,913 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:11,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:11,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:11,914 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:11,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:11,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:11,914 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:11,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:11,924 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:11,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:11,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:11,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:12,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:12,078 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:12,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:12,558 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:12,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:12,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-02-15 10:45:12,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:12,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-15 10:45:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-15 10:45:12,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-15 10:45:12,577 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 24 states. [2019-02-15 10:45:12,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:12,667 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-15 10:45:12,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-15 10:45:12,671 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2019-02-15 10:45:12,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:12,671 INFO L225 Difference]: With dead ends: 39 [2019-02-15 10:45:12,672 INFO L226 Difference]: Without dead ends: 38 [2019-02-15 10:45:12,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2019-02-15 10:45:12,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-15 10:45:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-02-15 10:45:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-15 10:45:12,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-15 10:45:12,677 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2019-02-15 10:45:12,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:12,677 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-15 10:45:12,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-15 10:45:12,678 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-15 10:45:12,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-15 10:45:12,679 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:12,679 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1] [2019-02-15 10:45:12,679 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:12,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:12,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1917468300, now seen corresponding path program 11 times [2019-02-15 10:45:12,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:12,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:12,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:12,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:12,681 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:12,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:13,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:13,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:13,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:13,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:13,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:13,067 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:13,079 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:13,079 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:13,157 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-15 10:45:13,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:13,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:13,176 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:13,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:13,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:13,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:13,421 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:13,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:13,728 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:13,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:13,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-02-15 10:45:13,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:13,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-15 10:45:13,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-15 10:45:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 10:45:13,750 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 26 states. [2019-02-15 10:45:13,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:13,834 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-15 10:45:13,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-15 10:45:13,834 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-02-15 10:45:13,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:13,835 INFO L225 Difference]: With dead ends: 42 [2019-02-15 10:45:13,835 INFO L226 Difference]: Without dead ends: 41 [2019-02-15 10:45:13,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2019-02-15 10:45:13,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-15 10:45:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-02-15 10:45:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-15 10:45:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-15 10:45:13,841 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2019-02-15 10:45:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:13,841 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-15 10:45:13,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-15 10:45:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-15 10:45:13,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-15 10:45:13,842 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:13,843 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1] [2019-02-15 10:45:13,843 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:13,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:13,843 INFO L82 PathProgramCache]: Analyzing trace with hash 233130016, now seen corresponding path program 12 times [2019-02-15 10:45:13,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:13,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:13,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:13,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:14,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:14,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:14,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:14,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,049 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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:14,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:14,057 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:14,075 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:14,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:14,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:14,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:14,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,097 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:14,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:14,580 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:14,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:14,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-02-15 10:45:14,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:14,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-15 10:45:14,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-15 10:45:14,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-15 10:45:14,600 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 28 states. [2019-02-15 10:45:14,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:14,683 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-15 10:45:14,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-15 10:45:14,684 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-02-15 10:45:14,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:14,685 INFO L225 Difference]: With dead ends: 45 [2019-02-15 10:45:14,685 INFO L226 Difference]: Without dead ends: 44 [2019-02-15 10:45:14,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2019-02-15 10:45:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-15 10:45:14,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2019-02-15 10:45:14,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-15 10:45:14,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-15 10:45:14,692 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2019-02-15 10:45:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:14,692 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-15 10:45:14,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-15 10:45:14,692 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-15 10:45:14,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-15 10:45:14,693 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:14,693 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1] [2019-02-15 10:45:14,693 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:14,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:14,694 INFO L82 PathProgramCache]: Analyzing trace with hash 214230540, now seen corresponding path program 13 times [2019-02-15 10:45:14,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:14,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:14,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:14,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:14,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:14,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:14,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:14,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:14,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:14,933 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:14,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:14,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:14,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:14,966 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:14,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:14,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:15,223 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:15,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:16,138 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:16,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:16,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-02-15 10:45:16,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:16,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-15 10:45:16,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-15 10:45:16,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 10:45:16,159 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 30 states. [2019-02-15 10:45:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:16,269 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-15 10:45:16,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-15 10:45:16,270 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2019-02-15 10:45:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:16,271 INFO L225 Difference]: With dead ends: 48 [2019-02-15 10:45:16,271 INFO L226 Difference]: Without dead ends: 47 [2019-02-15 10:45:16,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2019-02-15 10:45:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-15 10:45:16,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-02-15 10:45:16,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-15 10:45:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-15 10:45:16,277 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2019-02-15 10:45:16,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:16,278 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-15 10:45:16,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-15 10:45:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-15 10:45:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-15 10:45:16,279 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:16,279 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1] [2019-02-15 10:45:16,279 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:16,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:16,279 INFO L82 PathProgramCache]: Analyzing trace with hash -179343200, now seen corresponding path program 14 times [2019-02-15 10:45:16,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:16,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:16,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:16,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:16,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:16,587 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:16,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:16,588 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:16,588 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:16,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:16,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:16,588 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 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:16,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:16,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:16,670 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-15 10:45:16,670 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:16,675 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:16,682 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:16,682 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:16,692 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:16,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:17,746 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:17,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:18,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:18,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-02-15 10:45:18,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:18,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-15 10:45:18,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-15 10:45:18,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-15 10:45:18,189 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 32 states. [2019-02-15 10:45:18,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:18,432 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-15 10:45:18,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-15 10:45:18,433 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2019-02-15 10:45:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:18,433 INFO L225 Difference]: With dead ends: 51 [2019-02-15 10:45:18,433 INFO L226 Difference]: Without dead ends: 50 [2019-02-15 10:45:18,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2019-02-15 10:45:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-15 10:45:18,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-02-15 10:45:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-15 10:45:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-15 10:45:18,444 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2019-02-15 10:45:18,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:18,444 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-15 10:45:18,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-15 10:45:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-15 10:45:18,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-15 10:45:18,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:18,446 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1] [2019-02-15 10:45:18,446 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:18,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:18,447 INFO L82 PathProgramCache]: Analyzing trace with hash 126086540, now seen corresponding path program 15 times [2019-02-15 10:45:18,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:18,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:18,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:18,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:18,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:18,733 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:18,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:18,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:18,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:18,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:18,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:18,734 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:18,743 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:18,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:18,760 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:18,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:18,763 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:18,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:18,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:18,776 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:18,776 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:19,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:19,354 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:19,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:19,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-02-15 10:45:19,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:19,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-15 10:45:19,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-15 10:45:19,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 10:45:19,374 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 34 states. [2019-02-15 10:45:19,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:19,483 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-15 10:45:19,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-15 10:45:19,483 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2019-02-15 10:45:19,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:19,484 INFO L225 Difference]: With dead ends: 54 [2019-02-15 10:45:19,484 INFO L226 Difference]: Without dead ends: 53 [2019-02-15 10:45:19,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2019-02-15 10:45:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-15 10:45:19,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-02-15 10:45:19,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-15 10:45:19,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-15 10:45:19,490 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2019-02-15 10:45:19,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:19,491 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-15 10:45:19,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-15 10:45:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-15 10:45:19,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-15 10:45:19,492 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:19,492 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1] [2019-02-15 10:45:19,492 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:19,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:19,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1852229344, now seen corresponding path program 16 times [2019-02-15 10:45:19,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:19,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:19,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:19,493 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:19,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:20,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:20,296 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:20,296 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:20,296 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:20,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:20,296 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 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:20,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:20,305 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:20,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:20,333 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:20,333 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:20,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:20,342 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:21,105 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:22,335 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:22,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:22,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-02-15 10:45:22,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:22,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-15 10:45:22,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-15 10:45:22,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-15 10:45:22,355 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 36 states. [2019-02-15 10:45:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:22,480 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-15 10:45:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-15 10:45:22,481 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2019-02-15 10:45:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:22,481 INFO L225 Difference]: With dead ends: 57 [2019-02-15 10:45:22,482 INFO L226 Difference]: Without dead ends: 56 [2019-02-15 10:45:22,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2019-02-15 10:45:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-15 10:45:22,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2019-02-15 10:45:22,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-15 10:45:22,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-15 10:45:22,489 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2019-02-15 10:45:22,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:22,491 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-15 10:45:22,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-15 10:45:22,491 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-15 10:45:22,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-15 10:45:22,492 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:22,492 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1] [2019-02-15 10:45:22,492 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:22,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:22,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1975473420, now seen corresponding path program 17 times [2019-02-15 10:45:22,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:22,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:22,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:22,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:22,494 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:22,829 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:22,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:22,829 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:22,829 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:22,830 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:22,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:22,830 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 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:22,839 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:22,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:22,879 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-15 10:45:22,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:22,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:22,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:22,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:22,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:22,897 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:23,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:23,603 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:23,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:23,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-02-15 10:45:23,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:23,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-15 10:45:23,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-15 10:45:23,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 10:45:23,624 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 38 states. [2019-02-15 10:45:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:23,738 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-15 10:45:23,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-15 10:45:23,745 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2019-02-15 10:45:23,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:23,746 INFO L225 Difference]: With dead ends: 60 [2019-02-15 10:45:23,746 INFO L226 Difference]: Without dead ends: 59 [2019-02-15 10:45:23,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2019-02-15 10:45:23,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-15 10:45:23,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-02-15 10:45:23,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-15 10:45:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-15 10:45:23,751 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2019-02-15 10:45:23,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:23,751 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-15 10:45:23,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-15 10:45:23,752 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-15 10:45:23,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-15 10:45:23,752 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:23,753 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1] [2019-02-15 10:45:23,753 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:23,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:23,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1686806944, now seen corresponding path program 18 times [2019-02-15 10:45:23,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:23,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:23,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:23,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:23,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:24,047 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:24,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:24,048 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:24,048 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:24,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:24,048 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 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:24,057 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:24,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:24,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:24,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:24,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:24,099 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:24,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:24,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:24,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:24,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:25,013 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:25,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:25,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-02-15 10:45:25,033 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:25,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-15 10:45:25,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-15 10:45:25,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-15 10:45:25,035 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 40 states. [2019-02-15 10:45:25,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:25,150 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-15 10:45:25,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-15 10:45:25,150 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2019-02-15 10:45:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:25,151 INFO L225 Difference]: With dead ends: 63 [2019-02-15 10:45:25,151 INFO L226 Difference]: Without dead ends: 62 [2019-02-15 10:45:25,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2019-02-15 10:45:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-15 10:45:25,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2019-02-15 10:45:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-15 10:45:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-15 10:45:25,158 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2019-02-15 10:45:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:25,158 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-15 10:45:25,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-15 10:45:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-15 10:45:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-15 10:45:25,159 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:25,159 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1] [2019-02-15 10:45:25,159 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash 548347020, now seen corresponding path program 19 times [2019-02-15 10:45:25,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:25,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:25,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:25,161 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:25,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:25,997 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:25,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:25,998 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:25,998 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:25,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:25,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:25,998 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:26,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:26,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:26,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:26,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:26,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:26,043 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:26,047 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:26,047 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:26,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:26,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:26,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-02-15 10:45:26,880 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:26,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-15 10:45:26,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-15 10:45:26,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 10:45:26,882 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 42 states. [2019-02-15 10:45:27,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:27,032 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-15 10:45:27,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-15 10:45:27,033 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2019-02-15 10:45:27,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:27,034 INFO L225 Difference]: With dead ends: 66 [2019-02-15 10:45:27,034 INFO L226 Difference]: Without dead ends: 65 [2019-02-15 10:45:27,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2019-02-15 10:45:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-15 10:45:27,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-02-15 10:45:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-15 10:45:27,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-15 10:45:27,040 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2019-02-15 10:45:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:27,041 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-15 10:45:27,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-15 10:45:27,041 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-15 10:45:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-15 10:45:27,041 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:27,042 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1] [2019-02-15 10:45:27,042 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:27,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:27,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2045487648, now seen corresponding path program 20 times [2019-02-15 10:45:27,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:27,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:27,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:27,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:27,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:27,574 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:27,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:27,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:27,575 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:27,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:27,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:27,575 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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:27,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:27,584 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:27,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-15 10:45:27,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:27,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:27,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:27,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:27,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:27,662 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:28,066 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:28,768 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:28,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:28,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-02-15 10:45:28,786 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:28,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-15 10:45:28,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-15 10:45:28,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-15 10:45:28,788 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 44 states. [2019-02-15 10:45:28,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:28,961 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-15 10:45:28,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-15 10:45:28,962 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2019-02-15 10:45:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:28,963 INFO L225 Difference]: With dead ends: 69 [2019-02-15 10:45:28,963 INFO L226 Difference]: Without dead ends: 68 [2019-02-15 10:45:28,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2019-02-15 10:45:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-15 10:45:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2019-02-15 10:45:28,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-15 10:45:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-15 10:45:28,969 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2019-02-15 10:45:28,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:28,969 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-15 10:45:28,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-15 10:45:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-15 10:45:28,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-15 10:45:28,970 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:28,970 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1] [2019-02-15 10:45:28,970 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:28,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:28,970 INFO L82 PathProgramCache]: Analyzing trace with hash 126567436, now seen corresponding path program 21 times [2019-02-15 10:45:28,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:28,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:28,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:28,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:28,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:28,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:29,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:29,625 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:29,625 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:29,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:29,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:29,626 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 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:29,635 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:29,635 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:29,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:29,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:29,658 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:29,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:29,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:29,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:29,666 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:30,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:30,706 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:30,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:30,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-02-15 10:45:30,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:30,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-15 10:45:30,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-15 10:45:30,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 10:45:30,727 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 46 states. [2019-02-15 10:45:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:30,868 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-15 10:45:30,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-15 10:45:30,871 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2019-02-15 10:45:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:30,872 INFO L225 Difference]: With dead ends: 72 [2019-02-15 10:45:30,872 INFO L226 Difference]: Without dead ends: 71 [2019-02-15 10:45:30,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2019-02-15 10:45:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-15 10:45:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-02-15 10:45:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-15 10:45:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-15 10:45:30,876 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2019-02-15 10:45:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:30,876 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-15 10:45:30,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-15 10:45:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-15 10:45:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-15 10:45:30,877 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:30,877 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1] [2019-02-15 10:45:30,877 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:30,878 INFO L82 PathProgramCache]: Analyzing trace with hash -410758496, now seen corresponding path program 22 times [2019-02-15 10:45:30,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:30,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:30,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:30,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:30,879 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:31,282 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:31,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:31,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:31,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:31,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:31,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:31,283 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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:31,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:31,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:31,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:31,331 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:31,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:31,338 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:31,338 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:31,702 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:31,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:32,701 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:32,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:32,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-02-15 10:45:32,720 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:32,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-15 10:45:32,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-15 10:45:32,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-15 10:45:32,722 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 48 states. [2019-02-15 10:45:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:32,904 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-15 10:45:32,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-15 10:45:32,904 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 69 [2019-02-15 10:45:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:32,905 INFO L225 Difference]: With dead ends: 75 [2019-02-15 10:45:32,905 INFO L226 Difference]: Without dead ends: 74 [2019-02-15 10:45:32,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2019-02-15 10:45:32,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-15 10:45:32,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2019-02-15 10:45:32,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-15 10:45:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-15 10:45:32,910 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2019-02-15 10:45:32,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:32,911 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-15 10:45:32,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-15 10:45:32,911 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-15 10:45:32,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-15 10:45:32,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:32,912 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1] [2019-02-15 10:45:32,912 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:32,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:32,912 INFO L82 PathProgramCache]: Analyzing trace with hash -544486516, now seen corresponding path program 23 times [2019-02-15 10:45:32,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:32,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:32,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:32,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:32,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:32,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:33,272 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:33,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:33,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:33,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:33,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:33,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:33,273 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 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:33,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:33,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:33,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-15 10:45:33,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:33,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:33,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:33,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:33,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:33,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:33,756 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:33,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:34,469 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:34,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:34,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-02-15 10:45:34,489 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:34,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-15 10:45:34,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-15 10:45:34,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 10:45:34,491 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 50 states. [2019-02-15 10:45:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:34,669 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-15 10:45:34,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-15 10:45:34,669 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2019-02-15 10:45:34,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:34,670 INFO L225 Difference]: With dead ends: 78 [2019-02-15 10:45:34,670 INFO L226 Difference]: Without dead ends: 77 [2019-02-15 10:45:34,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2019-02-15 10:45:34,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-15 10:45:34,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-02-15 10:45:34,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-15 10:45:34,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-15 10:45:34,674 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2019-02-15 10:45:34,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:34,674 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-15 10:45:34,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-15 10:45:34,674 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-15 10:45:34,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-15 10:45:34,675 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:34,675 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1] [2019-02-15 10:45:34,675 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:34,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:34,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1293720352, now seen corresponding path program 24 times [2019-02-15 10:45:34,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:34,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:34,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:34,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:34,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:34,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:35,052 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:35,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:35,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:35,053 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:35,053 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:35,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:35,053 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 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:35,062 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:35,062 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:35,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:35,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:35,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:35,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:35,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:35,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:35,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:35,539 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:36,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:36,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-02-15 10:45:36,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:36,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-15 10:45:36,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-15 10:45:36,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-15 10:45:36,364 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 52 states. [2019-02-15 10:45:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:36,556 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-15 10:45:36,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-15 10:45:36,556 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 75 [2019-02-15 10:45:36,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:36,557 INFO L225 Difference]: With dead ends: 81 [2019-02-15 10:45:36,557 INFO L226 Difference]: Without dead ends: 80 [2019-02-15 10:45:36,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2019-02-15 10:45:36,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-15 10:45:36,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2019-02-15 10:45:36,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-15 10:45:36,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-15 10:45:36,563 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2019-02-15 10:45:36,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:36,563 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-15 10:45:36,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-15 10:45:36,563 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-15 10:45:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-15 10:45:36,564 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:36,564 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1] [2019-02-15 10:45:36,564 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:36,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1813466356, now seen corresponding path program 25 times [2019-02-15 10:45:36,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:36,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:36,566 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:36,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:36,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:36,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:37,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:37,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:37,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:37,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:37,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:37,015 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 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:37,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:37,023 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:37,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:37,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:37,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:37,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:37,065 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:37,740 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:37,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:38,649 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:38,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:38,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-02-15 10:45:38,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:38,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-15 10:45:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-15 10:45:38,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 10:45:38,670 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 54 states. [2019-02-15 10:45:38,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:38,869 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-15 10:45:38,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-15 10:45:38,870 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2019-02-15 10:45:38,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:38,871 INFO L225 Difference]: With dead ends: 84 [2019-02-15 10:45:38,871 INFO L226 Difference]: Without dead ends: 83 [2019-02-15 10:45:38,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2019-02-15 10:45:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-15 10:45:38,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-02-15 10:45:38,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-15 10:45:38,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-15 10:45:38,875 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2019-02-15 10:45:38,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:38,876 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-15 10:45:38,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-15 10:45:38,876 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-15 10:45:38,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-15 10:45:38,876 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:38,877 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1] [2019-02-15 10:45:38,877 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:38,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:38,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1417446304, now seen corresponding path program 26 times [2019-02-15 10:45:38,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:38,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:38,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:38,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:38,878 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:38,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:39,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:39,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:39,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:39,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:39,390 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:39,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:39,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 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:39,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:39,399 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:39,454 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-15 10:45:39,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:39,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:39,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:39,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:39,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:39,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:40,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:40,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:41,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:41,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-02-15 10:45:41,157 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:41,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-15 10:45:41,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-15 10:45:41,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-15 10:45:41,158 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 56 states. [2019-02-15 10:45:41,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:41,321 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-15 10:45:41,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-15 10:45:41,321 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 81 [2019-02-15 10:45:41,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:41,322 INFO L225 Difference]: With dead ends: 87 [2019-02-15 10:45:41,322 INFO L226 Difference]: Without dead ends: 86 [2019-02-15 10:45:41,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2019-02-15 10:45:41,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-15 10:45:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2019-02-15 10:45:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-15 10:45:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-15 10:45:41,327 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2019-02-15 10:45:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:41,327 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-15 10:45:41,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-15 10:45:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-15 10:45:41,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-15 10:45:41,328 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:41,328 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1] [2019-02-15 10:45:41,328 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:41,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:41,328 INFO L82 PathProgramCache]: Analyzing trace with hash -975570292, now seen corresponding path program 27 times [2019-02-15 10:45:41,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:41,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:41,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:41,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:41,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:41,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:41,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:41,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:41,828 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:41,828 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:41,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:41,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:41,829 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 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:41,840 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:41,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:41,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:41,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:41,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:41,871 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:41,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:41,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:41,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:42,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:43,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:43,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:43,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-02-15 10:45:43,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:43,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-15 10:45:43,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-15 10:45:43,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 10:45:43,709 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 58 states. [2019-02-15 10:45:43,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:43,882 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-15 10:45:43,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-15 10:45:43,882 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 84 [2019-02-15 10:45:43,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:43,884 INFO L225 Difference]: With dead ends: 90 [2019-02-15 10:45:43,884 INFO L226 Difference]: Without dead ends: 89 [2019-02-15 10:45:43,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2019-02-15 10:45:43,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-15 10:45:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-02-15 10:45:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-15 10:45:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-15 10:45:43,889 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2019-02-15 10:45:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:43,889 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-15 10:45:43,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-15 10:45:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-15 10:45:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-15 10:45:43,890 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:43,890 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1] [2019-02-15 10:45:43,890 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:43,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:43,890 INFO L82 PathProgramCache]: Analyzing trace with hash 829164576, now seen corresponding path program 28 times [2019-02-15 10:45:43,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:43,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:43,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:43,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:43,892 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:44,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:44,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:44,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:44,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:44,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:44,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:44,797 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 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:44,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:44,807 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:44,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:44,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:44,849 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:44,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:44,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:44,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:45,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:46,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:46,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-02-15 10:45:46,744 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:46,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-15 10:45:46,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-15 10:45:46,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-15 10:45:46,745 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 60 states. [2019-02-15 10:45:46,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:46,944 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-15 10:45:46,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-15 10:45:46,944 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 87 [2019-02-15 10:45:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:46,946 INFO L225 Difference]: With dead ends: 93 [2019-02-15 10:45:46,946 INFO L226 Difference]: Without dead ends: 92 [2019-02-15 10:45:46,947 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2019-02-15 10:45:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-15 10:45:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2019-02-15 10:45:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-15 10:45:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-15 10:45:46,951 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2019-02-15 10:45:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:46,951 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-15 10:45:46,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-15 10:45:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-15 10:45:46,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-15 10:45:46,952 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:46,952 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1] [2019-02-15 10:45:46,952 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:46,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:46,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1285005836, now seen corresponding path program 29 times [2019-02-15 10:45:46,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:46,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:46,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:46,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:46,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:47,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:47,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:47,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:47,560 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:47,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:47,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:47,560 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 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:47,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:47,585 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:47,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-15 10:45:47,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:47,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:47,673 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:47,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:47,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:47,683 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:48,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:48,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:49,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:49,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-02-15 10:45:49,587 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:49,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-15 10:45:49,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-15 10:45:49,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 10:45:49,589 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 62 states. [2019-02-15 10:45:49,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:49,781 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-15 10:45:49,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-15 10:45:49,782 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 90 [2019-02-15 10:45:49,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:49,783 INFO L225 Difference]: With dead ends: 96 [2019-02-15 10:45:49,783 INFO L226 Difference]: Without dead ends: 95 [2019-02-15 10:45:49,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2019-02-15 10:45:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-15 10:45:49,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-02-15 10:45:49,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-15 10:45:49,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-15 10:45:49,788 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2019-02-15 10:45:49,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:49,788 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-15 10:45:49,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-15 10:45:49,788 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-15 10:45:49,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-15 10:45:49,789 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:49,789 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1] [2019-02-15 10:45:49,789 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:49,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:49,789 INFO L82 PathProgramCache]: Analyzing trace with hash 565392544, now seen corresponding path program 30 times [2019-02-15 10:45:49,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:49,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:49,790 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:49,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:49,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:50,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:50,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:50,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:50,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:50,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:50,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:50,528 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 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:50,537 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:45:50,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:45:50,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:45:50,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:50,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:50,572 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:50,572 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:50,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:50,585 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:51,210 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:51,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:52,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:52,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:52,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-02-15 10:45:52,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:52,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-15 10:45:52,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-15 10:45:52,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-15 10:45:52,426 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 64 states. [2019-02-15 10:45:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:52,614 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-15 10:45:52,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-15 10:45:52,614 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 93 [2019-02-15 10:45:52,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:52,615 INFO L225 Difference]: With dead ends: 99 [2019-02-15 10:45:52,615 INFO L226 Difference]: Without dead ends: 98 [2019-02-15 10:45:52,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2019-02-15 10:45:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-15 10:45:52,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2019-02-15 10:45:52,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-15 10:45:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-15 10:45:52,620 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2019-02-15 10:45:52,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:52,620 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-15 10:45:52,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-15 10:45:52,620 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-15 10:45:52,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-15 10:45:52,621 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:52,621 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1] [2019-02-15 10:45:52,621 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:52,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:52,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1252415092, now seen corresponding path program 31 times [2019-02-15 10:45:52,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:52,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:52,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:52,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:52,622 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:53,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:53,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:53,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:53,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:53,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:53,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:53,372 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 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:53,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:53,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:45:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:53,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:53,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:53,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:53,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:53,452 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:54,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:55,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:55,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:55,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-02-15 10:45:55,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:55,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-15 10:45:55,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-15 10:45:55,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 10:45:55,464 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 66 states. [2019-02-15 10:45:55,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:55,673 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-15 10:45:55,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-15 10:45:55,674 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 96 [2019-02-15 10:45:55,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:55,675 INFO L225 Difference]: With dead ends: 102 [2019-02-15 10:45:55,675 INFO L226 Difference]: Without dead ends: 101 [2019-02-15 10:45:55,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2019-02-15 10:45:55,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-15 10:45:55,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-02-15 10:45:55,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-15 10:45:55,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-15 10:45:55,681 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2019-02-15 10:45:55,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:55,681 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-15 10:45:55,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-15 10:45:55,681 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-15 10:45:55,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-15 10:45:55,682 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:55,682 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1] [2019-02-15 10:45:55,682 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:55,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:55,682 INFO L82 PathProgramCache]: Analyzing trace with hash -317063904, now seen corresponding path program 32 times [2019-02-15 10:45:55,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:55,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:55,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:45:55,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:55,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:45:56,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:56,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:56,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:45:56,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:45:56,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:45:56,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:45:56,407 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 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:45:56,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:45:56,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:45:56,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-15 10:45:56,498 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:45:56,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:45:56,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:45:56,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:45:56,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:45:56,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:45:57,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:57,475 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:45:59,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:45:59,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:45:59,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-02-15 10:45:59,160 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:45:59,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-15 10:45:59,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-15 10:45:59,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-15 10:45:59,162 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 68 states. [2019-02-15 10:45:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:45:59,404 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-15 10:45:59,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-15 10:45:59,404 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 99 [2019-02-15 10:45:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:45:59,405 INFO L225 Difference]: With dead ends: 105 [2019-02-15 10:45:59,406 INFO L226 Difference]: Without dead ends: 104 [2019-02-15 10:45:59,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2019-02-15 10:45:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-15 10:45:59,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2019-02-15 10:45:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-15 10:45:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-02-15 10:45:59,411 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2019-02-15 10:45:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:45:59,412 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-02-15 10:45:59,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-15 10:45:59,412 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-02-15 10:45:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-15 10:45:59,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:45:59,412 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1] [2019-02-15 10:45:59,413 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:45:59,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:45:59,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1017638644, now seen corresponding path program 33 times [2019-02-15 10:45:59,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:45:59,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:59,414 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:45:59,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:45:59,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:45:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:00,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:00,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:00,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:00,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:00,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:00,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:00,117 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 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:00,125 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:00,125 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:00,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:00,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:00,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:00,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:00,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:00,177 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:00,177 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:01,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:02,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:02,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:02,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-02-15 10:46:02,584 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:02,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-15 10:46:02,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-15 10:46:02,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 10:46:02,586 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 70 states. [2019-02-15 10:46:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:02,833 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-15 10:46:02,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-15 10:46:02,834 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 102 [2019-02-15 10:46:02,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:02,835 INFO L225 Difference]: With dead ends: 108 [2019-02-15 10:46:02,835 INFO L226 Difference]: Without dead ends: 107 [2019-02-15 10:46:02,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 10:46:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-15 10:46:02,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-02-15 10:46:02,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-15 10:46:02,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-15 10:46:02,842 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2019-02-15 10:46:02,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:02,842 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-15 10:46:02,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-15 10:46:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-15 10:46:02,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-15 10:46:02,843 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:02,843 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1] [2019-02-15 10:46:02,843 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:02,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1701340576, now seen corresponding path program 34 times [2019-02-15 10:46:02,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:02,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:02,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:02,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:02,844 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:03,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:03,800 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:03,800 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:03,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:03,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:03,800 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 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:03,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:03,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:03,844 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:03,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:03,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:03,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:03,867 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:04,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:04,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:06,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:06,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-02-15 10:46:06,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:06,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-15 10:46:06,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-15 10:46:06,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-15 10:46:06,187 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 72 states. [2019-02-15 10:46:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:06,387 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-15 10:46:06,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-15 10:46:06,387 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 105 [2019-02-15 10:46:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:06,389 INFO L225 Difference]: With dead ends: 111 [2019-02-15 10:46:06,389 INFO L226 Difference]: Without dead ends: 110 [2019-02-15 10:46:06,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2019-02-15 10:46:06,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-15 10:46:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2019-02-15 10:46:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-15 10:46:06,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-15 10:46:06,393 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2019-02-15 10:46:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:06,394 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-15 10:46:06,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-15 10:46:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-15 10:46:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-15 10:46:06,395 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:06,395 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1] [2019-02-15 10:46:06,395 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:06,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:06,395 INFO L82 PathProgramCache]: Analyzing trace with hash -271918964, now seen corresponding path program 35 times [2019-02-15 10:46:06,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:06,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:06,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:06,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:06,396 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:06,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:07,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:07,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:07,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:07,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:07,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:07,104 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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:07,113 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:07,202 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-15 10:46:07,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:07,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:07,208 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:07,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:07,216 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:07,216 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:08,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:08,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:09,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:10,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:10,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-02-15 10:46:10,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:10,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-15 10:46:10,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-15 10:46:10,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 10:46:10,001 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 74 states. [2019-02-15 10:46:10,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:10,406 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-15 10:46:10,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-15 10:46:10,406 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 108 [2019-02-15 10:46:10,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:10,407 INFO L225 Difference]: With dead ends: 114 [2019-02-15 10:46:10,407 INFO L226 Difference]: Without dead ends: 113 [2019-02-15 10:46:10,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2019-02-15 10:46:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-15 10:46:10,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-02-15 10:46:10,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-15 10:46:10,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-15 10:46:10,411 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2019-02-15 10:46:10,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:10,411 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-15 10:46:10,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-15 10:46:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-15 10:46:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-15 10:46:10,412 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:10,412 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1] [2019-02-15 10:46:10,412 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:10,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:10,412 INFO L82 PathProgramCache]: Analyzing trace with hash -429494752, now seen corresponding path program 36 times [2019-02-15 10:46:10,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:10,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:10,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:10,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:10,414 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:11,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:11,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:11,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:11,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:11,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:11,487 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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:11,495 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:11,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:11,527 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:11,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:11,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:11,535 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:11,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:11,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:11,549 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:12,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:12,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:14,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:14,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-02-15 10:46:14,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:14,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-15 10:46:14,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-15 10:46:14,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-15 10:46:14,441 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 76 states. [2019-02-15 10:46:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:14,661 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-02-15 10:46:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-15 10:46:14,662 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 111 [2019-02-15 10:46:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:14,663 INFO L225 Difference]: With dead ends: 117 [2019-02-15 10:46:14,663 INFO L226 Difference]: Without dead ends: 116 [2019-02-15 10:46:14,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2019-02-15 10:46:14,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-02-15 10:46:14,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2019-02-15 10:46:14,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-15 10:46:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-02-15 10:46:14,669 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2019-02-15 10:46:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:14,669 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-02-15 10:46:14,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-15 10:46:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-02-15 10:46:14,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-15 10:46:14,670 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:14,670 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1] [2019-02-15 10:46:14,670 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:14,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash -370540532, now seen corresponding path program 37 times [2019-02-15 10:46:14,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:14,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:14,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:14,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:15,552 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:15,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:15,552 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:15,552 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:15,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:15,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:15,552 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 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:15,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:15,561 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:15,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:15,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:15,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:15,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:15,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:16,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:16,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:18,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:18,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-02-15 10:46:18,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:18,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-15 10:46:18,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-15 10:46:18,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-15 10:46:18,526 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 78 states. [2019-02-15 10:46:18,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:18,896 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-15 10:46:18,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-15 10:46:18,897 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 114 [2019-02-15 10:46:18,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:18,898 INFO L225 Difference]: With dead ends: 120 [2019-02-15 10:46:18,898 INFO L226 Difference]: Without dead ends: 119 [2019-02-15 10:46:18,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2019-02-15 10:46:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-15 10:46:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-02-15 10:46:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-02-15 10:46:18,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-02-15 10:46:18,903 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2019-02-15 10:46:18,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:18,903 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-02-15 10:46:18,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-15 10:46:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-02-15 10:46:18,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-02-15 10:46:18,904 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:18,904 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1] [2019-02-15 10:46:18,904 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:18,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash -706996576, now seen corresponding path program 38 times [2019-02-15 10:46:18,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:18,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:18,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:18,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:20,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:20,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:20,348 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:20,348 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:20,348 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:20,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:20,348 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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:20,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:20,358 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:20,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-15 10:46:20,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:20,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:20,480 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:20,481 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:20,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:20,487 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:21,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:21,667 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:23,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:23,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:23,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-02-15 10:46:23,728 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:23,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-15 10:46:23,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-15 10:46:23,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-15 10:46:23,730 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 80 states. [2019-02-15 10:46:24,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:24,077 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2019-02-15 10:46:24,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-15 10:46:24,077 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 117 [2019-02-15 10:46:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:24,078 INFO L225 Difference]: With dead ends: 123 [2019-02-15 10:46:24,079 INFO L226 Difference]: Without dead ends: 122 [2019-02-15 10:46:24,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2019-02-15 10:46:24,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-02-15 10:46:24,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2019-02-15 10:46:24,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-02-15 10:46:24,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-02-15 10:46:24,084 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2019-02-15 10:46:24,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:24,084 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-02-15 10:46:24,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-15 10:46:24,084 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-02-15 10:46:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-02-15 10:46:24,085 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:24,085 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1] [2019-02-15 10:46:24,085 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:24,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:24,085 INFO L82 PathProgramCache]: Analyzing trace with hash 384665484, now seen corresponding path program 39 times [2019-02-15 10:46:24,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:24,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:24,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:24,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:24,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:25,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:25,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:25,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:25,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:25,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:25,027 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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:25,037 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:25,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:25,077 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:25,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:25,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:25,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:25,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:25,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:25,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:26,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:26,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:28,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:28,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-02-15 10:46:28,747 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:28,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-15 10:46:28,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-15 10:46:28,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 10:46:28,749 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 82 states. [2019-02-15 10:46:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:29,048 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-02-15 10:46:29,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-15 10:46:29,048 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 120 [2019-02-15 10:46:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:29,050 INFO L225 Difference]: With dead ends: 126 [2019-02-15 10:46:29,050 INFO L226 Difference]: Without dead ends: 125 [2019-02-15 10:46:29,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2019-02-15 10:46:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-15 10:46:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-02-15 10:46:29,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-02-15 10:46:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-02-15 10:46:29,054 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2019-02-15 10:46:29,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:29,054 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-02-15 10:46:29,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-15 10:46:29,055 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-02-15 10:46:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-02-15 10:46:29,055 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:29,055 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1] [2019-02-15 10:46:29,055 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:29,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:29,056 INFO L82 PathProgramCache]: Analyzing trace with hash 596729632, now seen corresponding path program 40 times [2019-02-15 10:46:29,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:29,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:29,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:29,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:29,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:29,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:29,976 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:29,976 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:29,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:29,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:29,977 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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:29,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:29,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:30,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:30,030 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:30,030 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:30,041 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:30,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:31,072 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:31,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:33,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:33,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:33,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-02-15 10:46:33,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:33,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-15 10:46:33,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-15 10:46:33,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-15 10:46:33,187 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 84 states. [2019-02-15 10:46:33,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:33,555 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2019-02-15 10:46:33,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-15 10:46:33,555 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 123 [2019-02-15 10:46:33,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:33,557 INFO L225 Difference]: With dead ends: 129 [2019-02-15 10:46:33,557 INFO L226 Difference]: Without dead ends: 128 [2019-02-15 10:46:33,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2019-02-15 10:46:33,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-02-15 10:46:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2019-02-15 10:46:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-02-15 10:46:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2019-02-15 10:46:33,563 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2019-02-15 10:46:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:33,563 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2019-02-15 10:46:33,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-15 10:46:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2019-02-15 10:46:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-02-15 10:46:33,564 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:33,564 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1] [2019-02-15 10:46:33,564 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:33,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:33,565 INFO L82 PathProgramCache]: Analyzing trace with hash 302870284, now seen corresponding path program 41 times [2019-02-15 10:46:33,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:33,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:33,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:33,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:33,566 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:33,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:34,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:34,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:34,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:34,601 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:34,601 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:34,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:34,601 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 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:34,610 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:34,610 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:34,749 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-15 10:46:34,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:34,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:34,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:34,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:34,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:34,767 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:35,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:35,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:37,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:37,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:37,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-02-15 10:46:37,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:37,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-15 10:46:37,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-15 10:46:37,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-15 10:46:37,987 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 86 states. [2019-02-15 10:46:38,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:38,363 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-02-15 10:46:38,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-15 10:46:38,363 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 126 [2019-02-15 10:46:38,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:38,364 INFO L225 Difference]: With dead ends: 132 [2019-02-15 10:46:38,365 INFO L226 Difference]: Without dead ends: 131 [2019-02-15 10:46:38,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2019-02-15 10:46:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-15 10:46:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-02-15 10:46:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-15 10:46:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-02-15 10:46:38,371 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2019-02-15 10:46:38,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:38,371 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-02-15 10:46:38,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-15 10:46:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-02-15 10:46:38,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-02-15 10:46:38,372 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:38,372 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1] [2019-02-15 10:46:38,372 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:38,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:38,372 INFO L82 PathProgramCache]: Analyzing trace with hash -917616736, now seen corresponding path program 42 times [2019-02-15 10:46:38,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:38,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:38,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:38,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:39,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:39,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:39,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:39,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:39,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:39,652 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 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:39,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:39,660 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:39,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:39,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:39,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:39,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:39,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:39,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:39,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:40,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:43,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:43,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:43,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-02-15 10:46:43,124 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:43,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-15 10:46:43,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-15 10:46:43,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-15 10:46:43,126 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 88 states. [2019-02-15 10:46:43,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:43,675 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-02-15 10:46:43,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-15 10:46:43,675 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 129 [2019-02-15 10:46:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:43,676 INFO L225 Difference]: With dead ends: 135 [2019-02-15 10:46:43,676 INFO L226 Difference]: Without dead ends: 134 [2019-02-15 10:46:43,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2019-02-15 10:46:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-02-15 10:46:43,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2019-02-15 10:46:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-02-15 10:46:43,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-02-15 10:46:43,682 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2019-02-15 10:46:43,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:43,682 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-02-15 10:46:43,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-15 10:46:43,682 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-02-15 10:46:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-02-15 10:46:43,683 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:43,683 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1] [2019-02-15 10:46:43,683 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:43,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:43,684 INFO L82 PathProgramCache]: Analyzing trace with hash 746698380, now seen corresponding path program 43 times [2019-02-15 10:46:43,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:43,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:43,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:43,685 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:45,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:45,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:45,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:45,495 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:45,495 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:45,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:45,495 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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:45,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:45,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:46:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:45,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:45,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:45,547 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:45,556 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:45,556 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:46,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:49,206 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:49,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:49,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-02-15 10:46:49,225 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:49,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-15 10:46:49,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-15 10:46:49,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 10:46:49,226 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 90 states. [2019-02-15 10:46:49,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:49,523 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-02-15 10:46:49,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-15 10:46:49,524 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 132 [2019-02-15 10:46:49,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:49,525 INFO L225 Difference]: With dead ends: 138 [2019-02-15 10:46:49,525 INFO L226 Difference]: Without dead ends: 137 [2019-02-15 10:46:49,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2019-02-15 10:46:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-15 10:46:49,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-02-15 10:46:49,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-15 10:46:49,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-15 10:46:49,530 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2019-02-15 10:46:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:49,531 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-15 10:46:49,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-15 10:46:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-15 10:46:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-15 10:46:49,531 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:49,531 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1] [2019-02-15 10:46:49,532 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:49,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:49,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1255854112, now seen corresponding path program 44 times [2019-02-15 10:46:49,532 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:49,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:49,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:46:49,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:49,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:51,257 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:51,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:51,257 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:51,257 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:51,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:51,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:51,257 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 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:51,265 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:46:51,265 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:46:51,389 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-15 10:46:51,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:51,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:51,397 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:51,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:51,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:51,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:52,646 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:46:55,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:55,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:46:55,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-02-15 10:46:55,404 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:46:55,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-15 10:46:55,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-15 10:46:55,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-15 10:46:55,406 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 92 states. [2019-02-15 10:46:55,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:46:55,682 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2019-02-15 10:46:55,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-15 10:46:55,685 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 135 [2019-02-15 10:46:55,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:46:55,686 INFO L225 Difference]: With dead ends: 141 [2019-02-15 10:46:55,686 INFO L226 Difference]: Without dead ends: 140 [2019-02-15 10:46:55,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2019-02-15 10:46:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-02-15 10:46:55,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2019-02-15 10:46:55,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-02-15 10:46:55,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2019-02-15 10:46:55,691 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2019-02-15 10:46:55,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:46:55,692 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2019-02-15 10:46:55,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-15 10:46:55,692 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2019-02-15 10:46:55,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-02-15 10:46:55,692 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:46:55,693 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1] [2019-02-15 10:46:55,693 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:46:55,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:46:55,693 INFO L82 PathProgramCache]: Analyzing trace with hash -310223348, now seen corresponding path program 45 times [2019-02-15 10:46:55,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:46:55,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:55,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:46:55,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:46:55,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:46:55,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:46:57,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:57,135 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:57,135 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:46:57,135 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:46:57,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:46:57,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:46:57,136 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 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:46:57,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:46:57,147 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:46:57,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:46:57,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:46:57,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:46:57,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:46:57,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:46:57,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:46:57,305 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:46:58,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:46:58,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:01,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:01,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-02-15 10:47:01,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:01,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-15 10:47:01,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-15 10:47:01,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 10:47:01,326 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 94 states. [2019-02-15 10:47:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:01,625 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2019-02-15 10:47:01,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-15 10:47:01,626 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 138 [2019-02-15 10:47:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:01,627 INFO L225 Difference]: With dead ends: 144 [2019-02-15 10:47:01,627 INFO L226 Difference]: Without dead ends: 143 [2019-02-15 10:47:01,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2019-02-15 10:47:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-02-15 10:47:01,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2019-02-15 10:47:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-02-15 10:47:01,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2019-02-15 10:47:01,633 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2019-02-15 10:47:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:01,633 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2019-02-15 10:47:01,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-15 10:47:01,633 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2019-02-15 10:47:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-02-15 10:47:01,634 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:01,634 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1] [2019-02-15 10:47:01,634 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:01,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:01,635 INFO L82 PathProgramCache]: Analyzing trace with hash 905902240, now seen corresponding path program 46 times [2019-02-15 10:47:01,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:01,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:01,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:01,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:01,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:03,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:03,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:03,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:03,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:03,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:03,678 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 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:03,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:03,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:03,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:03,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:03,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:03,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:03,742 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:03,742 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:05,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:05,251 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:08,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:08,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:08,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-02-15 10:47:08,248 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:08,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-15 10:47:08,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-15 10:47:08,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-15 10:47:08,250 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 96 states. [2019-02-15 10:47:08,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:08,595 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2019-02-15 10:47:08,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-15 10:47:08,596 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 141 [2019-02-15 10:47:08,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:08,597 INFO L225 Difference]: With dead ends: 147 [2019-02-15 10:47:08,597 INFO L226 Difference]: Without dead ends: 146 [2019-02-15 10:47:08,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2019-02-15 10:47:08,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-02-15 10:47:08,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-02-15 10:47:08,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-02-15 10:47:08,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2019-02-15 10:47:08,603 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2019-02-15 10:47:08,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:08,603 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2019-02-15 10:47:08,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-15 10:47:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2019-02-15 10:47:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-02-15 10:47:08,604 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:08,604 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1] [2019-02-15 10:47:08,604 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:08,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:08,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1840814708, now seen corresponding path program 47 times [2019-02-15 10:47:08,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:08,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:08,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:08,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:08,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:09,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:09,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:09,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:09,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:09,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:09,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:09,949 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 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:09,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:47:09,957 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:47:10,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-15 10:47:10,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:10,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:10,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:10,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:10,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:10,207 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:11,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:14,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:14,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-02-15 10:47:14,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:14,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-15 10:47:14,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-15 10:47:14,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-15 10:47:14,432 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 98 states. [2019-02-15 10:47:14,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:14,900 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-02-15 10:47:14,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-15 10:47:14,900 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 144 [2019-02-15 10:47:14,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:14,901 INFO L225 Difference]: With dead ends: 150 [2019-02-15 10:47:14,901 INFO L226 Difference]: Without dead ends: 149 [2019-02-15 10:47:14,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2019-02-15 10:47:14,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-02-15 10:47:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2019-02-15 10:47:14,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-02-15 10:47:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-02-15 10:47:14,906 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2019-02-15 10:47:14,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:14,907 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-02-15 10:47:14,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-15 10:47:14,907 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-02-15 10:47:14,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-02-15 10:47:14,907 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:14,907 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1] [2019-02-15 10:47:14,908 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:14,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:14,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1568489184, now seen corresponding path program 48 times [2019-02-15 10:47:14,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:14,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:14,909 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:14,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:14,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:14,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:16,071 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:16,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:16,071 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:16,071 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:16,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:16,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:16,072 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:16,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:16,080 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:16,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:16,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:16,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:16,136 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:16,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:16,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:16,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:17,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:20,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:20,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-02-15 10:47:20,805 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:20,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-15 10:47:20,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-15 10:47:20,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-15 10:47:20,807 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 100 states. [2019-02-15 10:47:21,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:21,175 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2019-02-15 10:47:21,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-15 10:47:21,176 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 147 [2019-02-15 10:47:21,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:21,177 INFO L225 Difference]: With dead ends: 153 [2019-02-15 10:47:21,177 INFO L226 Difference]: Without dead ends: 152 [2019-02-15 10:47:21,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2019-02-15 10:47:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-02-15 10:47:21,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-02-15 10:47:21,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-02-15 10:47:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-02-15 10:47:21,183 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2019-02-15 10:47:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:21,183 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-02-15 10:47:21,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-15 10:47:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-02-15 10:47:21,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-02-15 10:47:21,184 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:21,184 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1] [2019-02-15 10:47:21,185 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:21,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:21,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1912025844, now seen corresponding path program 49 times [2019-02-15 10:47:21,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:21,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:21,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:21,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:21,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:22,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:22,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:22,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:22,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:22,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:22,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:22,517 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 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:22,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:22,527 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:22,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:22,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:22,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:22,688 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:22,689 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:24,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:24,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:27,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:27,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-02-15 10:47:27,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:27,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-15 10:47:27,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-15 10:47:27,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-15 10:47:27,648 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 102 states. [2019-02-15 10:47:27,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:27,985 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2019-02-15 10:47:27,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-15 10:47:27,986 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 150 [2019-02-15 10:47:27,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:27,987 INFO L225 Difference]: With dead ends: 156 [2019-02-15 10:47:27,987 INFO L226 Difference]: Without dead ends: 155 [2019-02-15 10:47:27,988 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2019-02-15 10:47:27,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-02-15 10:47:27,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2019-02-15 10:47:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-02-15 10:47:27,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2019-02-15 10:47:27,993 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2019-02-15 10:47:27,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:27,994 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2019-02-15 10:47:27,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-15 10:47:27,994 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2019-02-15 10:47:27,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-02-15 10:47:27,995 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:27,995 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1] [2019-02-15 10:47:27,995 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:27,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:27,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1305597536, now seen corresponding path program 50 times [2019-02-15 10:47:27,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:27,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:27,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:27,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:27,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:29,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:29,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:29,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:29,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:29,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:29,472 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:29,480 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:47:29,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:47:29,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-15 10:47:29,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:29,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:29,655 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:29,656 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:29,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:29,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:31,331 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:31,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:34,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:34,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2019-02-15 10:47:34,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:34,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-15 10:47:34,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-15 10:47:34,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-15 10:47:34,437 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 104 states. [2019-02-15 10:47:34,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:34,774 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2019-02-15 10:47:34,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-15 10:47:34,774 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 153 [2019-02-15 10:47:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:34,776 INFO L225 Difference]: With dead ends: 159 [2019-02-15 10:47:34,776 INFO L226 Difference]: Without dead ends: 158 [2019-02-15 10:47:34,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2019-02-15 10:47:34,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-02-15 10:47:34,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2019-02-15 10:47:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-02-15 10:47:34,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2019-02-15 10:47:34,781 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2019-02-15 10:47:34,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:34,781 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2019-02-15 10:47:34,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-15 10:47:34,781 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2019-02-15 10:47:34,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-02-15 10:47:34,782 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:34,782 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1] [2019-02-15 10:47:34,782 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:34,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:34,783 INFO L82 PathProgramCache]: Analyzing trace with hash 167679116, now seen corresponding path program 51 times [2019-02-15 10:47:34,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:34,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:34,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:34,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:36,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:36,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:36,536 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:36,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:36,537 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:36,537 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:36,537 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 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:36,546 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:36,546 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:36,612 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:36,612 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:36,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:36,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:36,637 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:36,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:36,688 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:39,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:39,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:42,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:42,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:42,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2019-02-15 10:47:42,341 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:42,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-15 10:47:42,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-15 10:47:42,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 10:47:42,343 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 106 states. [2019-02-15 10:47:42,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:42,692 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2019-02-15 10:47:42,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-15 10:47:42,693 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 156 [2019-02-15 10:47:42,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:42,694 INFO L225 Difference]: With dead ends: 162 [2019-02-15 10:47:42,694 INFO L226 Difference]: Without dead ends: 161 [2019-02-15 10:47:42,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2019-02-15 10:47:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2019-02-15 10:47:42,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2019-02-15 10:47:42,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-02-15 10:47:42,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2019-02-15 10:47:42,700 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2019-02-15 10:47:42,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:42,701 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2019-02-15 10:47:42,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-15 10:47:42,701 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2019-02-15 10:47:42,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-02-15 10:47:42,702 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:42,702 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1] [2019-02-15 10:47:42,702 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:42,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:42,702 INFO L82 PathProgramCache]: Analyzing trace with hash 281621024, now seen corresponding path program 52 times [2019-02-15 10:47:42,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:42,703 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:42,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:42,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:44,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:44,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:44,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:44,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:44,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:44,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:44,340 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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:44,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:44,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:47:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:44,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:44,412 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:44,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:44,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:44,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:46,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:46,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:49,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:49,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:49,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2019-02-15 10:47:49,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:49,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-15 10:47:49,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-15 10:47:49,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-15 10:47:49,388 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 108 states. [2019-02-15 10:47:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:49,799 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-02-15 10:47:49,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-15 10:47:49,800 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 159 [2019-02-15 10:47:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:49,801 INFO L225 Difference]: With dead ends: 165 [2019-02-15 10:47:49,801 INFO L226 Difference]: Without dead ends: 164 [2019-02-15 10:47:49,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 210 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2019-02-15 10:47:49,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-02-15 10:47:49,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2019-02-15 10:47:49,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-02-15 10:47:49,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2019-02-15 10:47:49,805 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2019-02-15 10:47:49,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:49,806 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2019-02-15 10:47:49,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-15 10:47:49,806 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2019-02-15 10:47:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-02-15 10:47:49,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:49,806 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1] [2019-02-15 10:47:49,807 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:49,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:49,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1700838412, now seen corresponding path program 53 times [2019-02-15 10:47:49,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:49,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:49,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:47:49,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:49,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:49,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:51,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:51,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:51,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:51,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:51,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:51,461 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 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:51,470 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:47:51,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:47:51,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-15 10:47:51,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:51,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:51,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:51,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:51,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:51,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:47:54,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:54,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:47:57,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:57,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:47:57,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2019-02-15 10:47:57,423 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:47:57,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-15 10:47:57,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-15 10:47:57,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-15 10:47:57,425 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 110 states. [2019-02-15 10:47:57,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:47:57,854 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2019-02-15 10:47:57,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-15 10:47:57,854 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 162 [2019-02-15 10:47:57,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:47:57,856 INFO L225 Difference]: With dead ends: 168 [2019-02-15 10:47:57,856 INFO L226 Difference]: Without dead ends: 167 [2019-02-15 10:47:57,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2019-02-15 10:47:57,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-02-15 10:47:57,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2019-02-15 10:47:57,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-02-15 10:47:57,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-02-15 10:47:57,861 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2019-02-15 10:47:57,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:47:57,861 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-02-15 10:47:57,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-15 10:47:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-02-15 10:47:57,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-02-15 10:47:57,862 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:47:57,862 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1] [2019-02-15 10:47:57,862 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:47:57,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:47:57,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1947982496, now seen corresponding path program 54 times [2019-02-15 10:47:57,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:47:57,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:57,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:47:57,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:47:57,863 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:47:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:47:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:47:59,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:59,471 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:47:59,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:47:59,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:47:59,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:47:59,471 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 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:47:59,482 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:47:59,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:47:59,531 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:47:59,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:47:59,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:47:59,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:47:59,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:47:59,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:47:59,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:01,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:01,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:05,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:05,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:05,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2019-02-15 10:48:05,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:05,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-15 10:48:05,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-15 10:48:05,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-15 10:48:05,136 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 112 states. [2019-02-15 10:48:05,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:05,502 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2019-02-15 10:48:05,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-15 10:48:05,503 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 165 [2019-02-15 10:48:05,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:05,503 INFO L225 Difference]: With dead ends: 171 [2019-02-15 10:48:05,503 INFO L226 Difference]: Without dead ends: 170 [2019-02-15 10:48:05,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 218 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2019-02-15 10:48:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-02-15 10:48:05,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2019-02-15 10:48:05,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-02-15 10:48:05,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2019-02-15 10:48:05,507 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2019-02-15 10:48:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:05,508 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2019-02-15 10:48:05,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-15 10:48:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2019-02-15 10:48:05,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-02-15 10:48:05,508 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:05,508 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1] [2019-02-15 10:48:05,509 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:05,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:05,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1251523700, now seen corresponding path program 55 times [2019-02-15 10:48:05,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:05,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:05,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:05,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:05,510 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:07,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:07,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:07,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:07,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:07,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:07,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:07,340 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 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:07,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:07,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:48:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:07,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:07,403 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:07,403 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:07,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:07,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:09,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:09,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:12,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:12,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:12,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2019-02-15 10:48:12,727 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:12,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-02-15 10:48:12,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-02-15 10:48:12,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 10:48:12,729 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 114 states. [2019-02-15 10:48:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:13,093 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2019-02-15 10:48:13,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-15 10:48:13,094 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 168 [2019-02-15 10:48:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:13,094 INFO L225 Difference]: With dead ends: 174 [2019-02-15 10:48:13,095 INFO L226 Difference]: Without dead ends: 173 [2019-02-15 10:48:13,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 222 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2019-02-15 10:48:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-02-15 10:48:13,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2019-02-15 10:48:13,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-02-15 10:48:13,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2019-02-15 10:48:13,100 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2019-02-15 10:48:13,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:13,100 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2019-02-15 10:48:13,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-02-15 10:48:13,100 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2019-02-15 10:48:13,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-02-15 10:48:13,101 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:13,101 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1] [2019-02-15 10:48:13,101 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:13,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:13,101 INFO L82 PathProgramCache]: Analyzing trace with hash 468591392, now seen corresponding path program 56 times [2019-02-15 10:48:13,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:13,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:13,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:14,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:14,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:14,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:14,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:14,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:14,707 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 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:14,716 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:14,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:14,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-15 10:48:14,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:14,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:14,922 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:14,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:14,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:14,933 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:17,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:17,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:20,435 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:20,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:20,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2019-02-15 10:48:20,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:20,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-02-15 10:48:20,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-02-15 10:48:20,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-15 10:48:20,456 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 116 states. [2019-02-15 10:48:20,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:20,844 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2019-02-15 10:48:20,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-15 10:48:20,844 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 171 [2019-02-15 10:48:20,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:20,845 INFO L225 Difference]: With dead ends: 177 [2019-02-15 10:48:20,845 INFO L226 Difference]: Without dead ends: 176 [2019-02-15 10:48:20,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 226 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2019-02-15 10:48:20,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-02-15 10:48:20,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2019-02-15 10:48:20,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-02-15 10:48:20,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2019-02-15 10:48:20,850 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2019-02-15 10:48:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:20,850 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2019-02-15 10:48:20,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-02-15 10:48:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2019-02-15 10:48:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-02-15 10:48:20,851 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:20,851 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1] [2019-02-15 10:48:20,851 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:20,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1162488588, now seen corresponding path program 57 times [2019-02-15 10:48:20,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:20,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:20,852 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:20,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:20,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:22,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:22,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:22,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:22,630 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:22,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:22,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:22,631 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 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:22,638 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:48:22,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:48:22,695 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:48:22,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:22,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:22,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:22,705 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:22,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:22,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:24,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:28,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:28,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2019-02-15 10:48:28,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:28,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-02-15 10:48:28,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-02-15 10:48:28,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 10:48:28,456 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 118 states. [2019-02-15 10:48:28,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:28,876 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-02-15 10:48:28,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-15 10:48:28,877 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 174 [2019-02-15 10:48:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:28,878 INFO L225 Difference]: With dead ends: 180 [2019-02-15 10:48:28,878 INFO L226 Difference]: Without dead ends: 179 [2019-02-15 10:48:28,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 230 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2019-02-15 10:48:28,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-02-15 10:48:28,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2019-02-15 10:48:28,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-02-15 10:48:28,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2019-02-15 10:48:28,885 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2019-02-15 10:48:28,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:28,885 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2019-02-15 10:48:28,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-02-15 10:48:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2019-02-15 10:48:28,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-02-15 10:48:28,886 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:28,886 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1] [2019-02-15 10:48:28,886 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:28,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:28,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258976, now seen corresponding path program 58 times [2019-02-15 10:48:28,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:28,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:28,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:28,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:28,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:30,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:30,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:30,492 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:30,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:30,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:30,492 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 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:30,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:30,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:48:30,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:30,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:30,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:30,557 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:30,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:30,568 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:32,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:36,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:36,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:36,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2019-02-15 10:48:36,121 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:36,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-02-15 10:48:36,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-02-15 10:48:36,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-15 10:48:36,123 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 120 states. [2019-02-15 10:48:36,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:36,552 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2019-02-15 10:48:36,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-15 10:48:36,552 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 177 [2019-02-15 10:48:36,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:36,554 INFO L225 Difference]: With dead ends: 183 [2019-02-15 10:48:36,554 INFO L226 Difference]: Without dead ends: 182 [2019-02-15 10:48:36,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 234 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2019-02-15 10:48:36,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-02-15 10:48:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2019-02-15 10:48:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-02-15 10:48:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-02-15 10:48:36,560 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2019-02-15 10:48:36,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:36,560 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-02-15 10:48:36,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-02-15 10:48:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-02-15 10:48:36,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-02-15 10:48:36,561 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:36,562 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1] [2019-02-15 10:48:36,562 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:36,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:36,562 INFO L82 PathProgramCache]: Analyzing trace with hash 373387916, now seen corresponding path program 59 times [2019-02-15 10:48:36,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:36,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:36,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:36,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:36,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:38,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:38,441 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:38,441 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:38,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:38,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:38,441 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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:38,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:48:38,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:48:38,981 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-15 10:48:38,981 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:38,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:38,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:38,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:39,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:39,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:41,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:41,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:44,794 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:44,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:44,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2019-02-15 10:48:44,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:44,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-02-15 10:48:44,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-02-15 10:48:44,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-15 10:48:44,815 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 122 states. [2019-02-15 10:48:45,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:45,215 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2019-02-15 10:48:45,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-15 10:48:45,216 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 180 [2019-02-15 10:48:45,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:45,220 INFO L225 Difference]: With dead ends: 186 [2019-02-15 10:48:45,220 INFO L226 Difference]: Without dead ends: 185 [2019-02-15 10:48:45,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 238 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2019-02-15 10:48:45,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-02-15 10:48:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2019-02-15 10:48:45,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-02-15 10:48:45,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2019-02-15 10:48:45,226 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2019-02-15 10:48:45,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:45,226 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2019-02-15 10:48:45,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-02-15 10:48:45,226 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2019-02-15 10:48:45,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-02-15 10:48:45,227 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:45,227 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1] [2019-02-15 10:48:45,228 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:45,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:45,228 INFO L82 PathProgramCache]: Analyzing trace with hash -365849568, now seen corresponding path program 60 times [2019-02-15 10:48:45,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:45,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:45,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:45,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:47,273 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:47,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:47,273 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:47,273 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:47,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:47,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:47,274 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 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:47,282 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:48:47,282 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:48:47,339 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:48:47,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:48:47,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:47,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:47,367 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:47,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:47,420 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:49,579 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:49,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:48:53,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:53,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:48:53,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2019-02-15 10:48:53,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:48:53,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-02-15 10:48:53,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-02-15 10:48:53,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-15 10:48:53,437 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 124 states. [2019-02-15 10:48:53,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:48:53,888 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2019-02-15 10:48:53,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-15 10:48:53,888 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 183 [2019-02-15 10:48:53,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:48:53,889 INFO L225 Difference]: With dead ends: 189 [2019-02-15 10:48:53,889 INFO L226 Difference]: Without dead ends: 188 [2019-02-15 10:48:53,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 242 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2019-02-15 10:48:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-02-15 10:48:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2019-02-15 10:48:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-02-15 10:48:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2019-02-15 10:48:53,895 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2019-02-15 10:48:53,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:48:53,895 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2019-02-15 10:48:53,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-02-15 10:48:53,895 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2019-02-15 10:48:53,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-02-15 10:48:53,896 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:48:53,896 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1] [2019-02-15 10:48:53,896 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:48:53,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:48:53,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1602558476, now seen corresponding path program 61 times [2019-02-15 10:48:53,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:48:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:53,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:48:53,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:48:53,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:48:53,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:55,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:55,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:48:55,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:48:55,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:48:55,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:48:55,641 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 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:48:55,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:48:55,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:48:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:48:55,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:48:55,712 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:48:55,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:48:55,722 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:48:55,722 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:48:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:48:58,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:01,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:01,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2019-02-15 10:49:01,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:01,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-02-15 10:49:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-02-15 10:49:01,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 10:49:01,668 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 126 states. [2019-02-15 10:49:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:02,208 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2019-02-15 10:49:02,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-15 10:49:02,208 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 186 [2019-02-15 10:49:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:02,210 INFO L225 Difference]: With dead ends: 192 [2019-02-15 10:49:02,210 INFO L226 Difference]: Without dead ends: 191 [2019-02-15 10:49:02,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 246 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2019-02-15 10:49:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2019-02-15 10:49:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2019-02-15 10:49:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-02-15 10:49:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2019-02-15 10:49:02,215 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2019-02-15 10:49:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:02,215 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2019-02-15 10:49:02,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-02-15 10:49:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2019-02-15 10:49:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-02-15 10:49:02,216 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:02,216 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1] [2019-02-15 10:49:02,217 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:02,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:02,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1036862304, now seen corresponding path program 62 times [2019-02-15 10:49:02,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:02,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:02,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:02,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:04,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:04,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:04,151 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:04,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:04,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:04,151 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 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:04,161 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:49:04,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:49:04,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-15 10:49:04,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:04,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:04,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:04,409 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:04,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:04,419 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:06,641 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:06,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:10,340 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:10,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:10,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2019-02-15 10:49:10,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:10,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-02-15 10:49:10,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-02-15 10:49:10,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-15 10:49:10,361 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 128 states. [2019-02-15 10:49:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:10,835 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-02-15 10:49:10,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-15 10:49:10,835 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 189 [2019-02-15 10:49:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:10,837 INFO L225 Difference]: With dead ends: 195 [2019-02-15 10:49:10,837 INFO L226 Difference]: Without dead ends: 194 [2019-02-15 10:49:10,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 250 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2019-02-15 10:49:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-02-15 10:49:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2019-02-15 10:49:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-02-15 10:49:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2019-02-15 10:49:10,843 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2019-02-15 10:49:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:10,843 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2019-02-15 10:49:10,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-02-15 10:49:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2019-02-15 10:49:10,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-02-15 10:49:10,844 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:10,844 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1] [2019-02-15 10:49:10,844 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:10,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:10,844 INFO L82 PathProgramCache]: Analyzing trace with hash 239935884, now seen corresponding path program 63 times [2019-02-15 10:49:10,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:10,845 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:10,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:10,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:13,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:13,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:13,230 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:13,230 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:13,230 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:13,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:13,230 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 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:13,243 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:49:13,243 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:49:13,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:49:13,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:13,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:13,314 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:13,314 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:13,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:13,328 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:15,662 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:19,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:19,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2019-02-15 10:49:19,646 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:19,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-02-15 10:49:19,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-02-15 10:49:19,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 10:49:19,649 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 130 states. [2019-02-15 10:49:20,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:20,160 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2019-02-15 10:49:20,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-15 10:49:20,161 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 192 [2019-02-15 10:49:20,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:20,162 INFO L225 Difference]: With dead ends: 198 [2019-02-15 10:49:20,162 INFO L226 Difference]: Without dead ends: 197 [2019-02-15 10:49:20,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 254 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2019-02-15 10:49:20,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-02-15 10:49:20,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2019-02-15 10:49:20,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-02-15 10:49:20,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-02-15 10:49:20,168 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2019-02-15 10:49:20,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:20,169 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-02-15 10:49:20,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-02-15 10:49:20,169 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-02-15 10:49:20,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-02-15 10:49:20,170 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:20,170 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1] [2019-02-15 10:49:20,170 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:20,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:20,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1104381216, now seen corresponding path program 64 times [2019-02-15 10:49:20,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:20,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:20,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:20,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:20,172 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:20,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:22,116 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:22,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:22,116 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:22,116 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:22,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:22,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:22,116 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:22,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:22,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:22,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:22,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:22,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:22,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:22,200 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:24,743 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:24,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:28,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:28,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:28,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2019-02-15 10:49:28,619 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:28,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-02-15 10:49:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-02-15 10:49:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-15 10:49:28,621 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 132 states. [2019-02-15 10:49:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:29,080 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2019-02-15 10:49:29,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-15 10:49:29,081 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 195 [2019-02-15 10:49:29,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:29,082 INFO L225 Difference]: With dead ends: 201 [2019-02-15 10:49:29,082 INFO L226 Difference]: Without dead ends: 200 [2019-02-15 10:49:29,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 258 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2019-02-15 10:49:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-02-15 10:49:29,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2019-02-15 10:49:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-02-15 10:49:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2019-02-15 10:49:29,090 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2019-02-15 10:49:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:29,090 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2019-02-15 10:49:29,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-02-15 10:49:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2019-02-15 10:49:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-02-15 10:49:29,091 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:29,091 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1] [2019-02-15 10:49:29,091 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:29,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:29,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1171360012, now seen corresponding path program 65 times [2019-02-15 10:49:29,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:29,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:29,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:29,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:29,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:31,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:31,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:31,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:31,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:31,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:31,200 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:31,208 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:49:31,208 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:49:31,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-15 10:49:31,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:31,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:31,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:31,485 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:31,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:31,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:34,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:34,186 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:37,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:37,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:37,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2019-02-15 10:49:37,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:37,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-02-15 10:49:37,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-02-15 10:49:37,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-15 10:49:37,864 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 134 states. [2019-02-15 10:49:38,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:38,393 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2019-02-15 10:49:38,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-15 10:49:38,394 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 198 [2019-02-15 10:49:38,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:38,395 INFO L225 Difference]: With dead ends: 204 [2019-02-15 10:49:38,395 INFO L226 Difference]: Without dead ends: 203 [2019-02-15 10:49:38,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2019-02-15 10:49:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2019-02-15 10:49:38,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2019-02-15 10:49:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-02-15 10:49:38,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2019-02-15 10:49:38,402 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2019-02-15 10:49:38,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:38,402 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2019-02-15 10:49:38,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-02-15 10:49:38,402 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2019-02-15 10:49:38,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-02-15 10:49:38,403 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:38,403 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1] [2019-02-15 10:49:38,404 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:38,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:38,404 INFO L82 PathProgramCache]: Analyzing trace with hash -623120992, now seen corresponding path program 66 times [2019-02-15 10:49:38,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:38,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:38,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:38,405 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:40,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:40,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:40,493 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:40,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:40,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:40,494 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:40,503 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:49:40,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:49:40,564 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:49:40,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:40,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:40,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:40,575 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:40,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:43,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:47,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:47,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:47,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2019-02-15 10:49:47,062 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:47,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-02-15 10:49:47,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-02-15 10:49:47,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-15 10:49:47,064 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 136 states. [2019-02-15 10:49:47,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:47,568 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2019-02-15 10:49:47,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-15 10:49:47,569 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 201 [2019-02-15 10:49:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:47,570 INFO L225 Difference]: With dead ends: 207 [2019-02-15 10:49:47,570 INFO L226 Difference]: Without dead ends: 206 [2019-02-15 10:49:47,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 266 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2019-02-15 10:49:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2019-02-15 10:49:47,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2019-02-15 10:49:47,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-02-15 10:49:47,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2019-02-15 10:49:47,575 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2019-02-15 10:49:47,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:47,575 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2019-02-15 10:49:47,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-02-15 10:49:47,575 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2019-02-15 10:49:47,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-02-15 10:49:47,576 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:47,576 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1] [2019-02-15 10:49:47,576 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:47,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:47,576 INFO L82 PathProgramCache]: Analyzing trace with hash -548777844, now seen corresponding path program 67 times [2019-02-15 10:49:47,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:47,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:47,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:49:47,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:47,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:50,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:50,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:50,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:50,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:50,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:50,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:50,046 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:50,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:50,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:49:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:50,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:50,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:50,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:50,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:50,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:49:52,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:52,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:49:56,638 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:56,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:49:56,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2019-02-15 10:49:56,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:49:56,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-02-15 10:49:56,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-02-15 10:49:56,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-15 10:49:56,658 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 138 states. [2019-02-15 10:49:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:49:57,074 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-02-15 10:49:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-15 10:49:57,074 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 204 [2019-02-15 10:49:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:49:57,075 INFO L225 Difference]: With dead ends: 210 [2019-02-15 10:49:57,075 INFO L226 Difference]: Without dead ends: 209 [2019-02-15 10:49:57,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 270 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2019-02-15 10:49:57,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-02-15 10:49:57,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2019-02-15 10:49:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-02-15 10:49:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2019-02-15 10:49:57,080 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2019-02-15 10:49:57,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:49:57,080 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2019-02-15 10:49:57,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-02-15 10:49:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2019-02-15 10:49:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-02-15 10:49:57,081 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:49:57,081 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1] [2019-02-15 10:49:57,081 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:49:57,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:49:57,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1995180512, now seen corresponding path program 68 times [2019-02-15 10:49:57,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:49:57,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:57,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:49:57,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:49:57,082 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:49:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:49:59,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:49:59,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:59,516 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:49:59,516 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:49:59,516 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:49:59,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:49:59,516 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:49:59,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:49:59,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:49:59,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-02-15 10:49:59,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:49:59,821 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:49:59,823 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:49:59,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:49:59,836 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:02,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:02,546 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:06,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:06,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:06,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2019-02-15 10:50:06,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:06,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-02-15 10:50:06,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-02-15 10:50:06,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-15 10:50:06,525 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 140 states. [2019-02-15 10:50:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:07,069 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2019-02-15 10:50:07,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-15 10:50:07,070 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 207 [2019-02-15 10:50:07,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:07,071 INFO L225 Difference]: With dead ends: 213 [2019-02-15 10:50:07,071 INFO L226 Difference]: Without dead ends: 212 [2019-02-15 10:50:07,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 274 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2019-02-15 10:50:07,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-02-15 10:50:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2019-02-15 10:50:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-02-15 10:50:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-02-15 10:50:07,078 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2019-02-15 10:50:07,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:07,079 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-02-15 10:50:07,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-02-15 10:50:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-02-15 10:50:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-02-15 10:50:07,080 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:07,080 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1] [2019-02-15 10:50:07,080 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:07,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:07,080 INFO L82 PathProgramCache]: Analyzing trace with hash -370182132, now seen corresponding path program 69 times [2019-02-15 10:50:07,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:07,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:07,081 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:07,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:07,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:09,562 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:09,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:09,563 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:09,563 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:09,563 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:09,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:09,563 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:09,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:50:09,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:50:09,638 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:50:09,638 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:09,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:09,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:50:09,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:09,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:09,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:12,348 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:12,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:16,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:16,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:16,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2019-02-15 10:50:16,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:16,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-02-15 10:50:16,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-02-15 10:50:16,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 10:50:16,310 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 142 states. [2019-02-15 10:50:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:16,786 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2019-02-15 10:50:16,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-15 10:50:16,786 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 210 [2019-02-15 10:50:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:16,788 INFO L225 Difference]: With dead ends: 216 [2019-02-15 10:50:16,788 INFO L226 Difference]: Without dead ends: 215 [2019-02-15 10:50:16,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 278 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2019-02-15 10:50:16,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2019-02-15 10:50:16,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2019-02-15 10:50:16,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2019-02-15 10:50:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2019-02-15 10:50:16,794 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2019-02-15 10:50:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:16,795 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2019-02-15 10:50:16,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-02-15 10:50:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2019-02-15 10:50:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-02-15 10:50:16,796 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:16,796 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1] [2019-02-15 10:50:16,796 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:16,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:16,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1380163232, now seen corresponding path program 70 times [2019-02-15 10:50:16,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:16,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:16,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:16,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:16,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:19,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:19,278 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:19,278 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:19,278 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:19,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:19,278 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:19,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:19,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:19,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:19,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:50:19,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,370 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:19,370 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:22,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:26,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:26,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2019-02-15 10:50:26,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:26,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-02-15 10:50:26,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-02-15 10:50:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-15 10:50:26,307 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 144 states. [2019-02-15 10:50:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:26,788 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2019-02-15 10:50:26,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-15 10:50:26,789 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 213 [2019-02-15 10:50:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:26,790 INFO L225 Difference]: With dead ends: 219 [2019-02-15 10:50:26,791 INFO L226 Difference]: Without dead ends: 218 [2019-02-15 10:50:26,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 282 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2019-02-15 10:50:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-02-15 10:50:26,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2019-02-15 10:50:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-02-15 10:50:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2019-02-15 10:50:26,796 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2019-02-15 10:50:26,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:26,796 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2019-02-15 10:50:26,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-02-15 10:50:26,796 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2019-02-15 10:50:26,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-02-15 10:50:26,797 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:26,797 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1] [2019-02-15 10:50:26,797 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:26,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:26,797 INFO L82 PathProgramCache]: Analyzing trace with hash 720961420, now seen corresponding path program 71 times [2019-02-15 10:50:26,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:26,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:26,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:26,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:26,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:26,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:29,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:29,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:29,250 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:29,250 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:29,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:29,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:29,250 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:29,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:50:29,259 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:50:29,574 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-02-15 10:50:29,574 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:29,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:29,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:50:29,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:29,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:32,488 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:32,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:36,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:36,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:36,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2019-02-15 10:50:36,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:36,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-02-15 10:50:36,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-02-15 10:50:36,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 10:50:36,613 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 146 states. [2019-02-15 10:50:37,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:37,096 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2019-02-15 10:50:37,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-15 10:50:37,097 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 216 [2019-02-15 10:50:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:37,098 INFO L225 Difference]: With dead ends: 222 [2019-02-15 10:50:37,099 INFO L226 Difference]: Without dead ends: 221 [2019-02-15 10:50:37,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 286 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2019-02-15 10:50:37,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-02-15 10:50:37,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2019-02-15 10:50:37,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2019-02-15 10:50:37,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2019-02-15 10:50:37,104 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2019-02-15 10:50:37,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:37,104 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2019-02-15 10:50:37,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-02-15 10:50:37,105 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2019-02-15 10:50:37,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-02-15 10:50:37,105 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:37,106 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1] [2019-02-15 10:50:37,106 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:37,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:37,106 INFO L82 PathProgramCache]: Analyzing trace with hash -969742560, now seen corresponding path program 72 times [2019-02-15 10:50:37,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:37,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:37,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:37,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:37,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:39,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:39,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:39,449 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:39,449 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:39,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:39,450 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:39,468 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:50:39,468 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:50:39,543 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:50:39,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:50:39,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:39,552 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:50:39,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:39,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:39,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:42,676 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:42,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:46,723 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:46,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:46,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2019-02-15 10:50:46,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:46,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-02-15 10:50:46,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-02-15 10:50:46,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-15 10:50:46,745 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 148 states. [2019-02-15 10:50:47,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:47,222 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-02-15 10:50:47,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-15 10:50:47,222 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 219 [2019-02-15 10:50:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:47,224 INFO L225 Difference]: With dead ends: 225 [2019-02-15 10:50:47,224 INFO L226 Difference]: Without dead ends: 224 [2019-02-15 10:50:47,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 290 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2019-02-15 10:50:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-02-15 10:50:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2019-02-15 10:50:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-02-15 10:50:47,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2019-02-15 10:50:47,229 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2019-02-15 10:50:47,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:47,229 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2019-02-15 10:50:47,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-02-15 10:50:47,229 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2019-02-15 10:50:47,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-02-15 10:50:47,230 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:47,230 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1] [2019-02-15 10:50:47,230 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:47,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:47,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1650530548, now seen corresponding path program 73 times [2019-02-15 10:50:47,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:47,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:47,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:50:47,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:47,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:49,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:49,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:50:49,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:50:49,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:50:49,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:50:49,831 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:50:49,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:49,839 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:50:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:50:49,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:50:49,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:50:49,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:50:49,920 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:50:49,920 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:50:53,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:53,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:50:57,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:50:57,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:50:57,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2019-02-15 10:50:57,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:50:57,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-02-15 10:50:57,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-02-15 10:50:57,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-15 10:50:57,088 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 150 states. [2019-02-15 10:50:57,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:50:57,625 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2019-02-15 10:50:57,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-15 10:50:57,625 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 222 [2019-02-15 10:50:57,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:50:57,626 INFO L225 Difference]: With dead ends: 228 [2019-02-15 10:50:57,626 INFO L226 Difference]: Without dead ends: 227 [2019-02-15 10:50:57,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 294 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2019-02-15 10:50:57,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-02-15 10:50:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2019-02-15 10:50:57,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-02-15 10:50:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-02-15 10:50:57,632 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2019-02-15 10:50:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:50:57,633 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-02-15 10:50:57,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-02-15 10:50:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-02-15 10:50:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-02-15 10:50:57,634 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:50:57,634 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1] [2019-02-15 10:50:57,634 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:50:57,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:50:57,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2125057952, now seen corresponding path program 74 times [2019-02-15 10:50:57,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:50:57,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:57,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:50:57,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:50:57,636 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:50:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:00,433 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:00,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:00,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:00,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:00,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:00,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:00,434 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:00,442 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:00,442 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:00,747 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-02-15 10:51:00,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:00,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:00,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:00,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:00,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:00,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:51:03,810 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:03,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:07,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:07,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:07,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2019-02-15 10:51:07,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:07,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-02-15 10:51:07,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-02-15 10:51:07,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-15 10:51:07,967 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 152 states. [2019-02-15 10:51:08,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:08,567 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2019-02-15 10:51:08,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-15 10:51:08,567 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 225 [2019-02-15 10:51:08,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:08,568 INFO L225 Difference]: With dead ends: 231 [2019-02-15 10:51:08,568 INFO L226 Difference]: Without dead ends: 230 [2019-02-15 10:51:08,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 298 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2019-02-15 10:51:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-02-15 10:51:08,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2019-02-15 10:51:08,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2019-02-15 10:51:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2019-02-15 10:51:08,575 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2019-02-15 10:51:08,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:08,575 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2019-02-15 10:51:08,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-02-15 10:51:08,576 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2019-02-15 10:51:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-02-15 10:51:08,577 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:08,577 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1] [2019-02-15 10:51:08,577 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:08,577 INFO L82 PathProgramCache]: Analyzing trace with hash -216453492, now seen corresponding path program 75 times [2019-02-15 10:51:08,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:08,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:08,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:08,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:08,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:08,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:11,497 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:11,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:11,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:11,498 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:11,498 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:11,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:11,498 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:11,505 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:51:11,506 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:51:11,582 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:51:11,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:11,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:11,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:11,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:11,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:51:14,811 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:14,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:18,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:18,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2019-02-15 10:51:18,948 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:18,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-02-15 10:51:18,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-02-15 10:51:18,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 10:51:18,950 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 154 states. [2019-02-15 10:51:19,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:19,580 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2019-02-15 10:51:19,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-15 10:51:19,581 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 228 [2019-02-15 10:51:19,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:19,582 INFO L225 Difference]: With dead ends: 234 [2019-02-15 10:51:19,582 INFO L226 Difference]: Without dead ends: 233 [2019-02-15 10:51:19,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 302 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2019-02-15 10:51:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2019-02-15 10:51:19,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2019-02-15 10:51:19,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2019-02-15 10:51:19,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2019-02-15 10:51:19,588 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2019-02-15 10:51:19,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:19,588 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2019-02-15 10:51:19,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-02-15 10:51:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2019-02-15 10:51:19,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-02-15 10:51:19,590 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:19,590 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1] [2019-02-15 10:51:19,590 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:19,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:19,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1620027360, now seen corresponding path program 76 times [2019-02-15 10:51:19,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:19,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:19,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:19,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:19,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:22,563 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:22,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:22,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:22,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:22,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:22,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:22,564 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:22,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:22,572 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:22,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:22,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:22,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:22,654 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:22,654 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:51:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:26,119 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:30,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:30,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2019-02-15 10:51:30,101 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:30,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-02-15 10:51:30,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-02-15 10:51:30,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-15 10:51:30,104 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 156 states. [2019-02-15 10:51:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:30,693 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2019-02-15 10:51:30,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-15 10:51:30,693 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 231 [2019-02-15 10:51:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:30,695 INFO L225 Difference]: With dead ends: 237 [2019-02-15 10:51:30,695 INFO L226 Difference]: Without dead ends: 236 [2019-02-15 10:51:30,696 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 306 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2019-02-15 10:51:30,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2019-02-15 10:51:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2019-02-15 10:51:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2019-02-15 10:51:30,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2019-02-15 10:51:30,700 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2019-02-15 10:51:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:30,701 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2019-02-15 10:51:30,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-02-15 10:51:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2019-02-15 10:51:30,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-02-15 10:51:30,702 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:30,702 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1] [2019-02-15 10:51:30,702 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:30,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:30,702 INFO L82 PathProgramCache]: Analyzing trace with hash 312464908, now seen corresponding path program 77 times [2019-02-15 10:51:30,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:30,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:30,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:30,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:30,703 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:33,513 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:33,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:33,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:33,513 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:33,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:33,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:33,514 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:33,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:51:33,525 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:51:33,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-02-15 10:51:33,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:33,910 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:33,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:33,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,926 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:33,926 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:51:37,562 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:37,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:41,700 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:41,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:41,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2019-02-15 10:51:41,719 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:41,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-02-15 10:51:41,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-02-15 10:51:41,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-15 10:51:41,721 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 158 states. [2019-02-15 10:51:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:42,351 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-02-15 10:51:42,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-15 10:51:42,351 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 234 [2019-02-15 10:51:42,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:42,352 INFO L225 Difference]: With dead ends: 240 [2019-02-15 10:51:42,352 INFO L226 Difference]: Without dead ends: 239 [2019-02-15 10:51:42,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 310 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2019-02-15 10:51:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-02-15 10:51:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2019-02-15 10:51:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2019-02-15 10:51:42,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2019-02-15 10:51:42,357 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2019-02-15 10:51:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:42,358 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2019-02-15 10:51:42,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-02-15 10:51:42,358 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2019-02-15 10:51:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-02-15 10:51:42,359 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:42,359 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1] [2019-02-15 10:51:42,359 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:42,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:42,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1447985312, now seen corresponding path program 78 times [2019-02-15 10:51:42,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:42,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:42,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:42,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:42,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:45,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:45,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:45,067 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:45,067 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:45,067 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:45,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:45,067 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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:45,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:51:45,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:51:45,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:51:45,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:51:45,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:45,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:45,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:45,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:45,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:51:48,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:48,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:51:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:53,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:51:53,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2019-02-15 10:51:53,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:51:53,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-02-15 10:51:53,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-02-15 10:51:53,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-15 10:51:53,124 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 160 states. [2019-02-15 10:51:53,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:51:53,708 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2019-02-15 10:51:53,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-15 10:51:53,709 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 237 [2019-02-15 10:51:53,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:51:53,711 INFO L225 Difference]: With dead ends: 243 [2019-02-15 10:51:53,711 INFO L226 Difference]: Without dead ends: 242 [2019-02-15 10:51:53,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 314 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2019-02-15 10:51:53,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-02-15 10:51:53,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2019-02-15 10:51:53,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-02-15 10:51:53,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-02-15 10:51:53,717 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2019-02-15 10:51:53,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:51:53,718 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-02-15 10:51:53,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-02-15 10:51:53,718 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-02-15 10:51:53,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-02-15 10:51:53,719 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:51:53,719 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1] [2019-02-15 10:51:53,719 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:51:53,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:51:53,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1721049716, now seen corresponding path program 79 times [2019-02-15 10:51:53,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:51:53,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:53,720 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:51:53,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:51:53,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:51:53,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:51:56,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:56,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:51:56,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:51:56,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:51:56,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:51:56,887 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:51:56,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:51:56,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:51:56,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:51:56,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:51:56,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:51:56,969 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:51:56,977 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:51:56,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:52:00,444 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:00,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:04,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:04,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2019-02-15 10:52:04,790 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:04,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-02-15 10:52:04,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-02-15 10:52:04,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 10:52:04,793 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 162 states. [2019-02-15 10:52:05,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:05,382 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2019-02-15 10:52:05,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-15 10:52:05,382 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 240 [2019-02-15 10:52:05,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:05,384 INFO L225 Difference]: With dead ends: 246 [2019-02-15 10:52:05,384 INFO L226 Difference]: Without dead ends: 245 [2019-02-15 10:52:05,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 318 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2019-02-15 10:52:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-02-15 10:52:05,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2019-02-15 10:52:05,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-02-15 10:52:05,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2019-02-15 10:52:05,390 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2019-02-15 10:52:05,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:05,390 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2019-02-15 10:52:05,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-02-15 10:52:05,390 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2019-02-15 10:52:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-02-15 10:52:05,391 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:05,391 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1] [2019-02-15 10:52:05,391 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:05,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:05,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1527531808, now seen corresponding path program 80 times [2019-02-15 10:52:05,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:05,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:05,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:05,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:05,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:05,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:08,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:08,630 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:08,631 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:08,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:08,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:08,631 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:08,639 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:52:08,639 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:52:09,039 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-02-15 10:52:09,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:09,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:09,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:52:09,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:09,062 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:09,062 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:52:12,955 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:12,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:17,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:17,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:17,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2019-02-15 10:52:17,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:17,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-02-15 10:52:17,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-02-15 10:52:17,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-15 10:52:17,210 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 164 states. [2019-02-15 10:52:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:17,775 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2019-02-15 10:52:17,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-15 10:52:17,775 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 243 [2019-02-15 10:52:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:17,777 INFO L225 Difference]: With dead ends: 249 [2019-02-15 10:52:17,777 INFO L226 Difference]: Without dead ends: 248 [2019-02-15 10:52:17,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 322 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2019-02-15 10:52:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-02-15 10:52:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2019-02-15 10:52:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-02-15 10:52:17,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2019-02-15 10:52:17,782 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2019-02-15 10:52:17,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:17,782 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2019-02-15 10:52:17,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-02-15 10:52:17,782 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2019-02-15 10:52:17,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-02-15 10:52:17,783 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:17,783 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1] [2019-02-15 10:52:17,783 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:17,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:17,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1521632524, now seen corresponding path program 81 times [2019-02-15 10:52:17,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:17,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:17,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:17,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:17,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:20,740 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:20,741 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:20,741 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:20,741 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:20,741 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:20,741 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:20,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:52:20,750 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:52:20,829 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:52:20,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:20,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:20,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:52:20,840 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:20,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:20,852 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:52:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:24,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:28,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:28,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2019-02-15 10:52:28,954 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:28,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-02-15 10:52:28,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-02-15 10:52:28,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 10:52:28,956 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 166 states. [2019-02-15 10:52:29,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:29,541 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2019-02-15 10:52:29,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-15 10:52:29,541 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 246 [2019-02-15 10:52:29,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:29,543 INFO L225 Difference]: With dead ends: 252 [2019-02-15 10:52:29,543 INFO L226 Difference]: Without dead ends: 251 [2019-02-15 10:52:29,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 326 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2019-02-15 10:52:29,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-02-15 10:52:29,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2019-02-15 10:52:29,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-02-15 10:52:29,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2019-02-15 10:52:29,549 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2019-02-15 10:52:29,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:29,550 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2019-02-15 10:52:29,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-02-15 10:52:29,550 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2019-02-15 10:52:29,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-02-15 10:52:29,551 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:29,551 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1] [2019-02-15 10:52:29,551 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:29,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:29,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1869722016, now seen corresponding path program 82 times [2019-02-15 10:52:29,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:29,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:29,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:29,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:29,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:33,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:33,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:33,082 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:33,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:33,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:33,083 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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:33,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:33,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:52:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:33,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:33,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:52:33,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:33,184 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:33,184 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:52:36,989 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:36,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:41,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:41,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:41,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2019-02-15 10:52:41,255 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:41,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-02-15 10:52:41,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-02-15 10:52:41,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-15 10:52:41,257 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 168 states. [2019-02-15 10:52:41,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:41,840 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-02-15 10:52:41,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-15 10:52:41,840 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 249 [2019-02-15 10:52:41,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:41,842 INFO L225 Difference]: With dead ends: 255 [2019-02-15 10:52:41,842 INFO L226 Difference]: Without dead ends: 254 [2019-02-15 10:52:41,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 330 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2019-02-15 10:52:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-02-15 10:52:41,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2019-02-15 10:52:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-02-15 10:52:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2019-02-15 10:52:41,849 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2019-02-15 10:52:41,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:41,849 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2019-02-15 10:52:41,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-02-15 10:52:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2019-02-15 10:52:41,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-02-15 10:52:41,850 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:41,850 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1] [2019-02-15 10:52:41,851 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:41,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash -542241652, now seen corresponding path program 83 times [2019-02-15 10:52:41,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:41,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:41,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:52:41,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:41,852 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:41,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:45,240 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:45,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:45,240 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:45,240 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:45,240 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:45,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:45,240 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:45,249 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:52:45,250 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:52:45,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-02-15 10:52:45,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:45,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:45,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:52:45,695 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:45,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:45,703 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:52:49,766 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:49,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:52:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:54,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:52:54,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2019-02-15 10:52:54,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:52:54,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-02-15 10:52:54,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-02-15 10:52:54,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-15 10:52:54,057 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 170 states. [2019-02-15 10:52:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:52:54,646 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2019-02-15 10:52:54,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-15 10:52:54,646 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 252 [2019-02-15 10:52:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:52:54,648 INFO L225 Difference]: With dead ends: 258 [2019-02-15 10:52:54,648 INFO L226 Difference]: Without dead ends: 257 [2019-02-15 10:52:54,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 334 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2019-02-15 10:52:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-02-15 10:52:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2019-02-15 10:52:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-02-15 10:52:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-02-15 10:52:54,655 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2019-02-15 10:52:54,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:52:54,655 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-02-15 10:52:54,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-02-15 10:52:54,655 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-02-15 10:52:54,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-02-15 10:52:54,657 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:52:54,657 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1] [2019-02-15 10:52:54,657 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:52:54,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:52:54,657 INFO L82 PathProgramCache]: Analyzing trace with hash -549012960, now seen corresponding path program 84 times [2019-02-15 10:52:54,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:52:54,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:54,658 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:52:54,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:52:54,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:52:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:52:58,151 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:52:58,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:58,151 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:52:58,151 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:52:58,151 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:52:58,151 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:52:58,151 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:52:58,160 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:52:58,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:52:58,245 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:52:58,245 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:52:58,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:52:58,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:52:58,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:52:58,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:52:58,272 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:53:02,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:02,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:06,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:06,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2019-02-15 10:53:06,531 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:06,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-02-15 10:53:06,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-02-15 10:53:06,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-15 10:53:06,534 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 172 states. [2019-02-15 10:53:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:07,201 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2019-02-15 10:53:07,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-15 10:53:07,202 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 255 [2019-02-15 10:53:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:07,203 INFO L225 Difference]: With dead ends: 261 [2019-02-15 10:53:07,203 INFO L226 Difference]: Without dead ends: 260 [2019-02-15 10:53:07,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 338 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2019-02-15 10:53:07,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-02-15 10:53:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2019-02-15 10:53:07,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-02-15 10:53:07,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2019-02-15 10:53:07,210 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2019-02-15 10:53:07,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:07,210 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2019-02-15 10:53:07,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-02-15 10:53:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2019-02-15 10:53:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-02-15 10:53:07,211 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:07,212 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1] [2019-02-15 10:53:07,212 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:07,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:07,212 INFO L82 PathProgramCache]: Analyzing trace with hash -409586676, now seen corresponding path program 85 times [2019-02-15 10:53:07,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:07,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:07,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:07,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:07,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:10,643 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:10,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:10,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:10,644 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:10,644 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:10,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:10,644 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:10,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:10,654 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:10,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:10,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:53:10,736 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:10,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:10,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:53:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:15,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:19,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:19,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2019-02-15 10:53:19,307 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:19,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-02-15 10:53:19,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-02-15 10:53:19,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-15 10:53:19,310 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 174 states. [2019-02-15 10:53:20,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:20,011 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2019-02-15 10:53:20,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-15 10:53:20,011 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 258 [2019-02-15 10:53:20,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:20,012 INFO L225 Difference]: With dead ends: 264 [2019-02-15 10:53:20,013 INFO L226 Difference]: Without dead ends: 263 [2019-02-15 10:53:20,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 342 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2019-02-15 10:53:20,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-02-15 10:53:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-02-15 10:53:20,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-02-15 10:53:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2019-02-15 10:53:20,019 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2019-02-15 10:53:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:20,019 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2019-02-15 10:53:20,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-02-15 10:53:20,019 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2019-02-15 10:53:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-02-15 10:53:20,020 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:20,020 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1] [2019-02-15 10:53:20,020 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:20,021 INFO L82 PathProgramCache]: Analyzing trace with hash 5464736, now seen corresponding path program 86 times [2019-02-15 10:53:20,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:20,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:20,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:20,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:20,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:23,434 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:23,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:23,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:23,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:23,435 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:23,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:23,435 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:23,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:53:23,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:53:23,915 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2019-02-15 10:53:23,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:23,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:23,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:53:23,926 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:23,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:23,936 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:53:28,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:28,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:32,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:32,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:32,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2019-02-15 10:53:32,381 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:32,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2019-02-15 10:53:32,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2019-02-15 10:53:32,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-15 10:53:32,384 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 176 states. [2019-02-15 10:53:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:33,067 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2019-02-15 10:53:33,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-15 10:53:33,068 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 261 [2019-02-15 10:53:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:33,069 INFO L225 Difference]: With dead ends: 267 [2019-02-15 10:53:33,069 INFO L226 Difference]: Without dead ends: 266 [2019-02-15 10:53:33,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 346 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2019-02-15 10:53:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-02-15 10:53:33,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2019-02-15 10:53:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-02-15 10:53:33,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2019-02-15 10:53:33,074 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2019-02-15 10:53:33,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:33,074 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2019-02-15 10:53:33,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2019-02-15 10:53:33,074 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2019-02-15 10:53:33,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-02-15 10:53:33,077 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:33,077 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1] [2019-02-15 10:53:33,077 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:33,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:33,077 INFO L82 PathProgramCache]: Analyzing trace with hash -408765556, now seen corresponding path program 87 times [2019-02-15 10:53:33,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:33,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:33,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:33,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:36,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:36,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:36,792 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:36,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:36,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:36,792 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:36,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:53:36,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:53:36,892 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:53:36,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:53:36,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:36,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:53:36,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:36,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:53:41,362 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:41,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:45,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:45,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2019-02-15 10:53:45,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:45,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2019-02-15 10:53:45,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2019-02-15 10:53:45,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 10:53:45,658 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 178 states. [2019-02-15 10:53:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:46,284 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-02-15 10:53:46,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-15 10:53:46,284 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 264 [2019-02-15 10:53:46,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:46,286 INFO L225 Difference]: With dead ends: 270 [2019-02-15 10:53:46,286 INFO L226 Difference]: Without dead ends: 269 [2019-02-15 10:53:46,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 350 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2019-02-15 10:53:46,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-02-15 10:53:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2019-02-15 10:53:46,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-02-15 10:53:46,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2019-02-15 10:53:46,292 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2019-02-15 10:53:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:46,292 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2019-02-15 10:53:46,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2019-02-15 10:53:46,292 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2019-02-15 10:53:46,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-02-15 10:53:46,293 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:46,293 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1] [2019-02-15 10:53:46,294 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:46,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1302353120, now seen corresponding path program 88 times [2019-02-15 10:53:46,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:46,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:46,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:53:46,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:46,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:49,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:49,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:49,921 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:53:49,921 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:53:49,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:53:49,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:53:49,921 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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:53:49,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:49,929 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:53:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:53:50,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:53:50,011 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:53:50,011 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,021 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:53:50,021 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:53:54,599 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:54,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:53:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:53:58,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:53:58,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2019-02-15 10:53:58,699 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:53:58,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2019-02-15 10:53:58,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2019-02-15 10:53:58,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-15 10:53:58,702 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 180 states. [2019-02-15 10:53:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:53:59,551 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2019-02-15 10:53:59,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-15 10:53:59,551 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 267 [2019-02-15 10:53:59,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:53:59,552 INFO L225 Difference]: With dead ends: 273 [2019-02-15 10:53:59,553 INFO L226 Difference]: Without dead ends: 272 [2019-02-15 10:53:59,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 354 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2019-02-15 10:53:59,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2019-02-15 10:53:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2019-02-15 10:53:59,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-02-15 10:53:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-02-15 10:53:59,558 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2019-02-15 10:53:59,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:53:59,558 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-02-15 10:53:59,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2019-02-15 10:53:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-02-15 10:53:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-02-15 10:53:59,559 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:53:59,559 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1] [2019-02-15 10:53:59,560 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:53:59,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:53:59,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1962171636, now seen corresponding path program 89 times [2019-02-15 10:53:59,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:53:59,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:59,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:53:59,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:53:59,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:53:59,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:03,145 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:03,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:03,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:03,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:03,146 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:03,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:03,146 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:03,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:03,154 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:03,653 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2019-02-15 10:54:03,653 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:03,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:03,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:54:03,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:03,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:03,675 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:54:08,313 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:08,313 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:12,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:12,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2019-02-15 10:54:12,704 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:12,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2019-02-15 10:54:12,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2019-02-15 10:54:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-15 10:54:12,707 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 182 states. [2019-02-15 10:54:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:13,434 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2019-02-15 10:54:13,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-15 10:54:13,434 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 270 [2019-02-15 10:54:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:13,436 INFO L225 Difference]: With dead ends: 276 [2019-02-15 10:54:13,436 INFO L226 Difference]: Without dead ends: 275 [2019-02-15 10:54:13,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 358 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2019-02-15 10:54:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2019-02-15 10:54:13,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2019-02-15 10:54:13,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-02-15 10:54:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2019-02-15 10:54:13,442 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2019-02-15 10:54:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:13,442 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2019-02-15 10:54:13,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2019-02-15 10:54:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2019-02-15 10:54:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-02-15 10:54:13,443 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:13,443 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1] [2019-02-15 10:54:13,443 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:13,443 INFO L82 PathProgramCache]: Analyzing trace with hash -550268000, now seen corresponding path program 90 times [2019-02-15 10:54:13,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:13,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:13,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:13,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:13,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:13,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:17,351 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:17,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:17,351 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:17,351 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:17,351 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:17,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:17,352 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:17,360 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:54:17,360 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:54:17,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:54:17,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:17,463 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:17,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:54:17,465 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:17,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:17,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:54:22,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:22,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:26,463 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:26,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:26,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2019-02-15 10:54:26,483 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:26,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2019-02-15 10:54:26,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2019-02-15 10:54:26,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-15 10:54:26,486 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 184 states. [2019-02-15 10:54:27,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:27,228 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2019-02-15 10:54:27,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-15 10:54:27,229 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 273 [2019-02-15 10:54:27,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:27,230 INFO L225 Difference]: With dead ends: 279 [2019-02-15 10:54:27,230 INFO L226 Difference]: Without dead ends: 278 [2019-02-15 10:54:27,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 362 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2019-02-15 10:54:27,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2019-02-15 10:54:27,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2019-02-15 10:54:27,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-02-15 10:54:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2019-02-15 10:54:27,235 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2019-02-15 10:54:27,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:27,236 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2019-02-15 10:54:27,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2019-02-15 10:54:27,236 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2019-02-15 10:54:27,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-02-15 10:54:27,237 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:27,237 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1] [2019-02-15 10:54:27,237 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:27,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:27,237 INFO L82 PathProgramCache]: Analyzing trace with hash 856222348, now seen corresponding path program 91 times [2019-02-15 10:54:27,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:27,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:27,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:27,238 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:31,206 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:31,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:31,206 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:31,206 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:31,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:31,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:31,207 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:31,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:31,217 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:54:31,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:31,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:31,303 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:54:31,303 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:31,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:54:36,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:36,134 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:40,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:40,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2019-02-15 10:54:40,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:40,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2019-02-15 10:54:40,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2019-02-15 10:54:40,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 10:54:40,292 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 186 states. [2019-02-15 10:54:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:40,992 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2019-02-15 10:54:40,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-15 10:54:40,993 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 276 [2019-02-15 10:54:40,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:40,995 INFO L225 Difference]: With dead ends: 282 [2019-02-15 10:54:40,995 INFO L226 Difference]: Without dead ends: 281 [2019-02-15 10:54:40,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 366 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2019-02-15 10:54:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-02-15 10:54:41,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2019-02-15 10:54:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2019-02-15 10:54:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2019-02-15 10:54:41,002 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2019-02-15 10:54:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:41,002 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2019-02-15 10:54:41,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2019-02-15 10:54:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2019-02-15 10:54:41,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-02-15 10:54:41,003 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:41,003 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1] [2019-02-15 10:54:41,003 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:41,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:41,003 INFO L82 PathProgramCache]: Analyzing trace with hash -90760160, now seen corresponding path program 92 times [2019-02-15 10:54:41,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:41,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:54:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:41,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:54:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:45,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:45,773 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:54:45,773 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:54:45,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:54:45,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:54:45,774 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:54:45,782 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:54:45,782 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:54:46,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2019-02-15 10:54:46,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:54:46,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:54:46,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:54:46,338 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:54:46,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:54:46,347 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:54:51,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:51,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:54:55,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:54:55,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:54:55,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2019-02-15 10:54:55,277 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:54:55,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2019-02-15 10:54:55,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2019-02-15 10:54:55,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-15 10:54:55,280 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 188 states. [2019-02-15 10:54:56,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:54:56,120 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-02-15 10:54:56,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-15 10:54:56,121 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 279 [2019-02-15 10:54:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:54:56,122 INFO L225 Difference]: With dead ends: 285 [2019-02-15 10:54:56,122 INFO L226 Difference]: Without dead ends: 284 [2019-02-15 10:54:56,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 370 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2019-02-15 10:54:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-02-15 10:54:56,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2019-02-15 10:54:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-02-15 10:54:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2019-02-15 10:54:56,129 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2019-02-15 10:54:56,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:54:56,129 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2019-02-15 10:54:56,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2019-02-15 10:54:56,129 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2019-02-15 10:54:56,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-02-15 10:54:56,130 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:54:56,130 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1] [2019-02-15 10:54:56,130 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:54:56,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:54:56,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1993511436, now seen corresponding path program 93 times [2019-02-15 10:54:56,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:54:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:56,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:54:56,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:54:56,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:54:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:00,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:00,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:00,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:00,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:00,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:00,010 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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:00,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:55:00,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:55:00,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:55:00,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:00,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:00,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:55:00,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:00,143 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:00,143 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:55:05,174 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:05,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:09,549 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:09,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:09,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2019-02-15 10:55:09,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:09,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2019-02-15 10:55:09,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2019-02-15 10:55:09,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 10:55:09,572 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 190 states. [2019-02-15 10:55:10,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:10,369 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2019-02-15 10:55:10,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-15 10:55:10,369 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 282 [2019-02-15 10:55:10,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:10,370 INFO L225 Difference]: With dead ends: 288 [2019-02-15 10:55:10,371 INFO L226 Difference]: Without dead ends: 287 [2019-02-15 10:55:10,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 374 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2019-02-15 10:55:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-02-15 10:55:10,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2019-02-15 10:55:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-02-15 10:55:10,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-02-15 10:55:10,376 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2019-02-15 10:55:10,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:10,376 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-02-15 10:55:10,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2019-02-15 10:55:10,376 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-02-15 10:55:10,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-02-15 10:55:10,377 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:10,377 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1] [2019-02-15 10:55:10,378 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:10,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:10,378 INFO L82 PathProgramCache]: Analyzing trace with hash -2108537696, now seen corresponding path program 94 times [2019-02-15 10:55:10,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:10,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:10,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:10,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:10,379 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:10,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:14,632 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:14,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:14,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:14,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:14,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:14,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:14,633 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:14,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:14,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:14,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:14,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:14,739 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:55:14,739 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:14,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:14,753 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:55:19,840 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:19,841 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:24,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:24,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2019-02-15 10:55:24,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:24,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2019-02-15 10:55:24,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2019-02-15 10:55:24,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-15 10:55:24,222 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 192 states. [2019-02-15 10:55:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:24,898 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2019-02-15 10:55:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-15 10:55:24,898 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 285 [2019-02-15 10:55:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:24,900 INFO L225 Difference]: With dead ends: 291 [2019-02-15 10:55:24,900 INFO L226 Difference]: Without dead ends: 290 [2019-02-15 10:55:24,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 378 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2019-02-15 10:55:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2019-02-15 10:55:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2019-02-15 10:55:24,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-02-15 10:55:24,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2019-02-15 10:55:24,906 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2019-02-15 10:55:24,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:24,907 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2019-02-15 10:55:24,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2019-02-15 10:55:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2019-02-15 10:55:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-02-15 10:55:24,908 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:24,908 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 95, 1, 1] [2019-02-15 10:55:24,908 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:24,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:24,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1549756020, now seen corresponding path program 95 times [2019-02-15 10:55:24,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:24,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:24,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:24,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:24,909 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:29,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:29,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:29,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:29,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:29,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:29,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:29,212 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:29,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:55:29,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:55:29,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2019-02-15 10:55:29,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:29,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:29,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:55:29,797 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:29,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:29,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:55:34,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:34,766 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:39,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:39,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:39,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2019-02-15 10:55:39,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:39,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2019-02-15 10:55:39,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2019-02-15 10:55:39,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 10:55:39,287 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 194 states. [2019-02-15 10:55:40,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:40,099 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2019-02-15 10:55:40,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-15 10:55:40,100 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 288 [2019-02-15 10:55:40,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:40,102 INFO L225 Difference]: With dead ends: 294 [2019-02-15 10:55:40,102 INFO L226 Difference]: Without dead ends: 293 [2019-02-15 10:55:40,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 382 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2019-02-15 10:55:40,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-02-15 10:55:40,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2019-02-15 10:55:40,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2019-02-15 10:55:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2019-02-15 10:55:40,109 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2019-02-15 10:55:40,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:40,109 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2019-02-15 10:55:40,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2019-02-15 10:55:40,109 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2019-02-15 10:55:40,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2019-02-15 10:55:40,110 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:40,110 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 96, 1, 1] [2019-02-15 10:55:40,111 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:40,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:40,111 INFO L82 PathProgramCache]: Analyzing trace with hash 2116881696, now seen corresponding path program 96 times [2019-02-15 10:55:40,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:40,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:40,112 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:40,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:40,112 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:44,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:44,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:44,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:44,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:44,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:44,565 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:44,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:55:44,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:55:44,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:55:44,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:55:44,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:44,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:55:44,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:44,696 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:44,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:55:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:50,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:55:54,552 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:54,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:55:54,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2019-02-15 10:55:54,571 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:55:54,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2019-02-15 10:55:54,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2019-02-15 10:55:54,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-15 10:55:54,574 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 196 states. [2019-02-15 10:55:55,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:55:55,243 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2019-02-15 10:55:55,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-15 10:55:55,243 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 291 [2019-02-15 10:55:55,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:55:55,245 INFO L225 Difference]: With dead ends: 297 [2019-02-15 10:55:55,245 INFO L226 Difference]: Without dead ends: 296 [2019-02-15 10:55:55,247 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 386 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2019-02-15 10:55:55,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-02-15 10:55:55,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2019-02-15 10:55:55,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2019-02-15 10:55:55,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2019-02-15 10:55:55,251 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2019-02-15 10:55:55,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:55:55,252 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2019-02-15 10:55:55,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2019-02-15 10:55:55,252 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2019-02-15 10:55:55,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-02-15 10:55:55,253 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:55:55,253 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 97, 1, 1] [2019-02-15 10:55:55,253 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:55:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:55:55,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1017839884, now seen corresponding path program 97 times [2019-02-15 10:55:55,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:55:55,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:55,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:55:55,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:55:55,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:55:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:55:59,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:59,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:55:59,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:55:59,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:55:59,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:55:59,779 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:55:59,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:55:59,787 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:55:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:55:59,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:55:59,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:55:59,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:55:59,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:55:59,888 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:56:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:05,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:09,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:09,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2019-02-15 10:56:09,807 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:09,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2019-02-15 10:56:09,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2019-02-15 10:56:09,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-15 10:56:09,811 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 198 states. [2019-02-15 10:56:10,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:10,601 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-02-15 10:56:10,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-15 10:56:10,602 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 294 [2019-02-15 10:56:10,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:10,604 INFO L225 Difference]: With dead ends: 300 [2019-02-15 10:56:10,604 INFO L226 Difference]: Without dead ends: 299 [2019-02-15 10:56:10,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 390 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2019-02-15 10:56:10,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-02-15 10:56:10,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2019-02-15 10:56:10,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-02-15 10:56:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2019-02-15 10:56:10,611 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2019-02-15 10:56:10,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:10,611 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2019-02-15 10:56:10,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2019-02-15 10:56:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2019-02-15 10:56:10,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-02-15 10:56:10,612 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:10,612 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 98, 1, 1] [2019-02-15 10:56:10,612 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:10,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:10,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1084000, now seen corresponding path program 98 times [2019-02-15 10:56:10,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:10,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:10,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:10,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:10,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:15,040 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:15,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:15,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:15,040 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:15,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:15,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:15,041 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:15,048 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-15 10:56:15,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-15 10:56:15,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2019-02-15 10:56:15,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:15,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:15,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:56:15,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:15,741 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:15,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:56:21,214 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:21,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:25,533 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:25,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:25,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2019-02-15 10:56:25,552 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:25,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2019-02-15 10:56:25,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2019-02-15 10:56:25,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-15 10:56:25,556 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 200 states. [2019-02-15 10:56:26,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:26,489 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2019-02-15 10:56:26,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-15 10:56:26,489 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 297 [2019-02-15 10:56:26,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:26,490 INFO L225 Difference]: With dead ends: 303 [2019-02-15 10:56:26,490 INFO L226 Difference]: Without dead ends: 302 [2019-02-15 10:56:26,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 394 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2019-02-15 10:56:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-02-15 10:56:26,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2019-02-15 10:56:26,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-02-15 10:56:26,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-02-15 10:56:26,496 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2019-02-15 10:56:26,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:26,497 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-02-15 10:56:26,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2019-02-15 10:56:26,497 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-02-15 10:56:26,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-02-15 10:56:26,498 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:26,498 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 99, 1, 1] [2019-02-15 10:56:26,498 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:26,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:26,498 INFO L82 PathProgramCache]: Analyzing trace with hash 2066335884, now seen corresponding path program 99 times [2019-02-15 10:56:26,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:26,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:26,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:26,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:26,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:31,205 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:31,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:31,205 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:31,205 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:31,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:31,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:31,205 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:31,214 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-15 10:56:31,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-15 10:56:31,340 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-15 10:56:31,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-15 10:56:31,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:31,369 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-02-15 10:56:31,370 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-15 10:56:31,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-15 10:56:31,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-02-15 10:56:36,998 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:36,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:41,324 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:41,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-15 10:56:41,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2019-02-15 10:56:41,345 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-15 10:56:41,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2019-02-15 10:56:41,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2019-02-15 10:56:41,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 10:56:41,348 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 202 states. [2019-02-15 10:56:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:42,122 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-02-15 10:56:42,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-15 10:56:42,122 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 300 [2019-02-15 10:56:42,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:42,124 INFO L225 Difference]: With dead ends: 306 [2019-02-15 10:56:42,124 INFO L226 Difference]: Without dead ends: 305 [2019-02-15 10:56:42,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 399 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2019-02-15 10:56:42,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-02-15 10:56:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2019-02-15 10:56:42,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2019-02-15 10:56:42,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2019-02-15 10:56:42,130 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2019-02-15 10:56:42,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:42,131 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2019-02-15 10:56:42,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2019-02-15 10:56:42,131 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2019-02-15 10:56:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-02-15 10:56:42,132 INFO L394 BasicCegarLoop]: Found error trace [2019-02-15 10:56:42,132 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 100, 1, 1] [2019-02-15 10:56:42,133 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-15 10:56:42,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-15 10:56:42,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1553891808, now seen corresponding path program 100 times [2019-02-15 10:56:42,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-15 10:56:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:42,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-15 10:56:42,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-15 10:56:42,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-15 10:56:42,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:46,784 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 14752 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:46,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:46,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-15 10:56:46,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-15 10:56:46,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-15 10:56:46,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-15 10:56:46,784 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-15 10:56:46,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-15 10:56:46,793 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-15 10:56:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-15 10:56:46,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-15 10:56:47,009 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:47,009 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-15 10:56:51,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-15 10:56:51,433 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-02-15 10:56:51,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102, 102] imperfect sequences [102] total 103 [2019-02-15 10:56:51,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-15 10:56:51,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-15 10:56:51,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-15 10:56:51,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 10:56:51,436 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 103 states. [2019-02-15 10:56:52,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-15 10:56:52,176 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2019-02-15 10:56:52,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-15 10:56:52,177 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 303 [2019-02-15 10:56:52,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-15 10:56:52,177 INFO L225 Difference]: With dead ends: 306 [2019-02-15 10:56:52,178 INFO L226 Difference]: Without dead ends: 0 [2019-02-15 10:56:52,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 504 SyntacticMatches, 100 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5544 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2019-02-15 10:56:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-15 10:56:52,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-15 10:56:52,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-15 10:56:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-15 10:56:52,181 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 303 [2019-02-15 10:56:52,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-15 10:56:52,181 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-15 10:56:52,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-15 10:56:52,181 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-15 10:56:52,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-15 10:56:52,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-15 10:56:52,335 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2019-02-15 10:56:55,577 WARN L181 SmtUtils]: Spent 3.24 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2019-02-15 10:56:55,584 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 2 23) no Hoare annotation was computed. [2019-02-15 10:56:55,584 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 2 23) no Hoare annotation was computed. [2019-02-15 10:56:55,584 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 15) no Hoare annotation was computed. [2019-02-15 10:56:55,584 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2019-02-15 10:56:55,585 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2019-02-15 10:56:55,590 INFO L444 ceAbstractionStarter]: At program point L12-1(lines 12 21) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= main_p.offset main_q.offset) (<= main_q.offset 0) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2019-02-15 10:56:55,591 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 2 23) no Hoare annotation was computed. [2019-02-15 10:56:55,653 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 10:56:55 BoogieIcfgContainer [2019-02-15 10:56:55,653 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-15 10:56:55,654 INFO L168 Benchmark]: Toolchain (without parser) took 711741.43 ms. Allocated memory was 133.7 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 107.1 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 629.5 MB. Max. memory is 7.1 GB. [2019-02-15 10:56:55,655 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 133.7 MB. Free memory is still 108.5 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-15 10:56:55,655 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.68 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 104.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-02-15 10:56:55,656 INFO L168 Benchmark]: Boogie Preprocessor took 23.79 ms. Allocated memory is still 133.7 MB. Free memory was 104.9 MB in the beginning and 103.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-02-15 10:56:55,656 INFO L168 Benchmark]: RCFGBuilder took 383.17 ms. Allocated memory is still 133.7 MB. Free memory was 103.6 MB in the beginning and 93.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-02-15 10:56:55,656 INFO L168 Benchmark]: TraceAbstraction took 711277.72 ms. Allocated memory was 133.7 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 93.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 615.8 MB. Max. memory is 7.1 GB. [2019-02-15 10:56:55,659 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 133.7 MB. Free memory is still 108.5 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 52.68 ms. Allocated memory is still 133.7 MB. Free memory was 107.1 MB in the beginning and 104.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.79 ms. Allocated memory is still 133.7 MB. Free memory was 104.9 MB in the beginning and 103.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 383.17 ms. Allocated memory is still 133.7 MB. Free memory was 103.6 MB in the beginning and 93.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 711277.72 ms. Allocated memory was 133.7 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 93.4 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 615.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: 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: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset <= q!offset && q!offset <= 0) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 711.1s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 40.5s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 7321 SDslu, 1 SDs, 0 SdLazy, 27597 SolverSat, 353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35852 GetRequests, 20503 SyntacticMatches, 2649 SemanticMatches, 12700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303168 ImplicationChecksByTransitivity, 622.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 12.7s SatisfiabilityAnalysisTime, 645.4s InterpolantComputationTime, 30903 NumberOfCodeBlocks, 30903 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 46052 ConstructedInterpolants, 0 QuantifiedInterpolants, 70702786 SizeOfPredicates, 596 NumberOfNonLiveVariables, 32500 ConjunctsInSsa, 15942 ConjunctsInUnsatCore, 301 InterpolantComputations, 3 PerfectInterpolantSequences, 44852/1530150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...