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-simplified01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 21:29:12,640 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 21:29:12,645 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 21:29:12,662 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 21:29:12,662 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 21:29:12,663 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 21:29:12,666 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 21:29:12,668 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 21:29:12,671 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 21:29:12,673 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 21:29:12,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 21:29:12,674 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 21:29:12,675 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 21:29:12,679 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 21:29:12,689 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 21:29:12,690 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 21:29:12,691 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 21:29:12,693 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 21:29:12,698 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 21:29:12,699 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 21:29:12,702 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 21:29:12,704 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 21:29:12,707 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 21:29:12,707 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 21:29:12,707 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 21:29:12,708 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 21:29:12,709 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 21:29:12,710 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 21:29:12,711 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 21:29:12,712 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 21:29:12,712 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 21:29:12,713 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 21:29:12,713 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 21:29:12,713 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 21:29:12,714 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 21:29:12,715 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 21:29:12,715 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-01-07 21:29:12,728 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 21:29:12,728 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 21:29:12,729 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 21:29:12,729 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 21:29:12,729 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 21:29:12,729 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 21:29:12,729 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 21:29:12,730 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 21:29:12,730 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 21:29:12,730 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 21:29:12,730 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 21:29:12,730 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-07 21:29:12,731 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 21:29:12,731 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 21:29:12,732 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 21:29:12,732 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 21:29:12,732 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 21:29:12,732 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 21:29:12,733 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 21:29:12,733 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 21:29:12,733 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 21:29:12,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 21:29:12,733 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 21:29:12,734 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 21:29:12,734 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 21:29:12,734 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 21:29:12,734 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 21:29:12,734 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 21:29:12,735 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 21:29:12,735 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 21:29:12,735 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 21:29:12,735 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 21:29:12,736 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 21:29:12,736 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 21:29:12,736 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 21:29:12,736 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 21:29:12,737 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 21:29:12,737 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 21:29:12,737 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 21:29:12,737 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 21:29:12,772 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 21:29:12,790 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 21:29:12,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 21:29:12,801 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 21:29:12,802 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 21:29:12,803 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl [2019-01-07 21:29:12,803 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified01.bpl' [2019-01-07 21:29:12,862 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 21:29:12,864 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 21:29:12,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 21:29:12,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 21:29:12,865 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 21:29:12,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:12" (1/1) ... [2019-01-07 21:29:12,896 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:12" (1/1) ... [2019-01-07 21:29:12,904 WARN L165 Inliner]: Program contained no entry procedure! [2019-01-07 21:29:12,904 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-01-07 21:29:12,904 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-01-07 21:29:12,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 21:29:12,923 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 21:29:12,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 21:29:12,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 21:29:12,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:12" (1/1) ... [2019-01-07 21:29:12,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:12" (1/1) ... [2019-01-07 21:29:12,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:12" (1/1) ... [2019-01-07 21:29:12,938 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:12" (1/1) ... [2019-01-07 21:29:12,943 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:12" (1/1) ... [2019-01-07 21:29:12,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:12" (1/1) ... [2019-01-07 21:29:12,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:12" (1/1) ... [2019-01-07 21:29:12,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 21:29:12,951 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 21:29:12,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 21:29:12,951 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 21:29:12,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:12" (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-01-07 21:29:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-07 21:29:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-07 21:29:13,028 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-07 21:29:13,028 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2019-01-07 21:29:13,398 INFO L278 CfgBuilder]: Using library mode [2019-01-07 21:29:13,399 INFO L286 CfgBuilder]: Removed 5 assue(true) statements. [2019-01-07 21:29:13,400 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:29:13 BoogieIcfgContainer [2019-01-07 21:29:13,400 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 21:29:13,401 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 21:29:13,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 21:29:13,405 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 21:29:13,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 09:29:12" (1/2) ... [2019-01-07 21:29:13,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c08e779 and model type PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 09:29:13, skipping insertion in model container [2019-01-07 21:29:13,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 09:29:13" (2/2) ... [2019-01-07 21:29:13,408 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified01.bpl [2019-01-07 21:29:13,423 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 21:29:13,433 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-07 21:29:13,452 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-07 21:29:13,494 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 21:29:13,494 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 21:29:13,494 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 21:29:13,495 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 21:29:13,495 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 21:29:13,495 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 21:29:13,495 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 21:29:13,495 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 21:29:13,513 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2019-01-07 21:29:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 21:29:13,524 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:13,526 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 21:29:13,529 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:13,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:13,537 INFO L82 PathProgramCache]: Analyzing trace with hash 927590, now seen corresponding path program 1 times [2019-01-07 21:29:13,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:13,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:13,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:13,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:13,772 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:29:13,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 21:29:13,772 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:29:13,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-07 21:29:13,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-07 21:29:13,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-07 21:29:13,795 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 4 states. [2019-01-07 21:29:13,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:13,945 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2019-01-07 21:29:13,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-07 21:29:13,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-07 21:29:13,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:13,958 INFO L225 Difference]: With dead ends: 20 [2019-01-07 21:29:13,959 INFO L226 Difference]: Without dead ends: 10 [2019-01-07 21:29:13,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-07 21:29:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-07 21:29:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 7. [2019-01-07 21:29:13,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-07 21:29:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-07 21:29:13,999 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 4 [2019-01-07 21:29:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:14,000 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-07 21:29:14,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-07 21:29:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-07 21:29:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-07 21:29:14,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:14,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-07 21:29:14,001 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:14,002 INFO L82 PathProgramCache]: Analyzing trace with hash 28755331, now seen corresponding path program 1 times [2019-01-07 21:29:14,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:14,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:14,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:14,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:14,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:29:14,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 21:29:14,357 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:29:14,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-07 21:29:14,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-07 21:29:14,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-07 21:29:14,359 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 5 states. [2019-01-07 21:29:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:14,602 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2019-01-07 21:29:14,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-07 21:29:14,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-07 21:29:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:14,603 INFO L225 Difference]: With dead ends: 17 [2019-01-07 21:29:14,604 INFO L226 Difference]: Without dead ends: 16 [2019-01-07 21:29:14,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-07 21:29:14,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-07 21:29:14,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 11. [2019-01-07 21:29:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 21:29:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2019-01-07 21:29:14,616 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 5 [2019-01-07 21:29:14,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:14,616 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2019-01-07 21:29:14,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-07 21:29:14,616 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2019-01-07 21:29:14,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-07 21:29:14,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:14,617 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2019-01-07 21:29:14,617 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:14,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:14,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2132412303, now seen corresponding path program 1 times [2019-01-07 21:29:14,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:14,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:14,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:14,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:14,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:14,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 21:29:14,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-07 21:29:14,676 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 21:29:14,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 21:29:14,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 21:29:14,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:29:14,677 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 3 states. [2019-01-07 21:29:14,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:14,696 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2019-01-07 21:29:14,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 21:29:14,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-07 21:29:14,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:14,698 INFO L225 Difference]: With dead ends: 18 [2019-01-07 21:29:14,698 INFO L226 Difference]: Without dead ends: 11 [2019-01-07 21:29:14,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 21:29:14,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-07 21:29:14,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-07 21:29:14,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-07 21:29:14,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-07 21:29:14,705 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-01-07 21:29:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:14,705 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-07 21:29:14,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 21:29:14,706 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-07 21:29:14,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-07 21:29:14,706 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:14,707 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2019-01-07 21:29:14,707 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:14,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:14,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1391871885, now seen corresponding path program 1 times [2019-01-07 21:29:14,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:14,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:14,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:14,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:14,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:14,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:14,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:14,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:14,953 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2019-01-07 21:29:14,955 INFO L207 CegarAbsIntRunner]: [0], [4], [7], [9], [10], [11], [19] [2019-01-07 21:29:14,996 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-07 21:29:14,996 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 21:29:15,146 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 21:29:15,151 INFO L272 AbstractInterpreter]: Visited 7 different actions 25 times. Merged at 6 different actions 18 times. Never widened. Performed 246 root evaluator evaluations with a maximum evaluation depth of 3. Performed 246 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-01-07 21:29:15,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:15,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-07 21:29:15,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:15,160 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:15,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:15,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:15,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:15,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:15,340 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-01-07 21:29:15,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:15,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:15,369 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:15,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:15,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:15,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:15,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2019-01-07 21:29:15,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:15,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-07 21:29:15,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-07 21:29:15,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-01-07 21:29:15,718 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 8 states. [2019-01-07 21:29:16,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:16,017 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-07 21:29:16,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-07 21:29:16,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 10 [2019-01-07 21:29:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:16,021 INFO L225 Difference]: With dead ends: 20 [2019-01-07 21:29:16,021 INFO L226 Difference]: Without dead ends: 19 [2019-01-07 21:29:16,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:29:16,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-07 21:29:16,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2019-01-07 21:29:16,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-07 21:29:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-07 21:29:16,027 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2019-01-07 21:29:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:16,027 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-07 21:29:16,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-07 21:29:16,027 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-07 21:29:16,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-07 21:29:16,028 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:16,028 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1] [2019-01-07 21:29:16,028 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:16,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash -750183549, now seen corresponding path program 2 times [2019-01-07 21:29:16,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:16,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:16,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:16,030 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:16,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:16,160 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:16,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:16,161 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:16,161 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:16,161 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:16,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:16,162 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:16,171 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:16,171 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:16,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-07 21:29:16,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:16,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:16,261 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-01-07 21:29:16,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:16,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:16,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:16,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:16,742 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:16,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:16,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2019-01-07 21:29:16,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:16,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-07 21:29:16,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-07 21:29:16,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-01-07 21:29:16,766 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 10 states. [2019-01-07 21:29:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:16,939 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-07 21:29:16,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-07 21:29:16,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-01-07 21:29:16,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:16,943 INFO L225 Difference]: With dead ends: 25 [2019-01-07 21:29:16,944 INFO L226 Difference]: Without dead ends: 24 [2019-01-07 21:29:16,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2019-01-07 21:29:16,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-07 21:29:16,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2019-01-07 21:29:16,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-07 21:29:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-07 21:29:16,949 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2019-01-07 21:29:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:16,950 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-07 21:29:16,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-07 21:29:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-07 21:29:16,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-07 21:29:16,951 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:16,951 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1] [2019-01-07 21:29:16,951 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:16,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:16,952 INFO L82 PathProgramCache]: Analyzing trace with hash -948100493, now seen corresponding path program 3 times [2019-01-07 21:29:16,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:16,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:16,953 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:16,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:16,953 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:17,081 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:17,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:17,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:17,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:17,082 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:17,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:17,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:17,096 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:17,097 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:17,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:17,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:17,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:17,135 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-01-07 21:29:17,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:17,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-01-07 21:29:17,145 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:17,282 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:17,283 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:17,462 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:17,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:17,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2019-01-07 21:29:17,482 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:17,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-07 21:29:17,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-07 21:29:17,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2019-01-07 21:29:17,484 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 12 states. [2019-01-07 21:29:17,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:17,675 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-07 21:29:17,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-07 21:29:17,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-01-07 21:29:17,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:17,679 INFO L225 Difference]: With dead ends: 30 [2019-01-07 21:29:17,679 INFO L226 Difference]: Without dead ends: 29 [2019-01-07 21:29:17,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=292, Unknown=0, NotChecked=0, Total=462 [2019-01-07 21:29:17,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-07 21:29:17,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-01-07 21:29:17,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-07 21:29:17,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-07 21:29:17,687 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2019-01-07 21:29:17,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:17,687 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-07 21:29:17,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-07 21:29:17,687 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-07 21:29:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-07 21:29:17,688 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:17,688 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1] [2019-01-07 21:29:17,689 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:17,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:17,689 INFO L82 PathProgramCache]: Analyzing trace with hash 711455107, now seen corresponding path program 4 times [2019-01-07 21:29:17,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:17,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:17,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:17,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:17,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:17,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:17,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:17,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:17,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:17,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:17,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:17,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:17,915 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:17,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:17,951 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:17,968 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-01-07 21:29:17,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:17,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-01-07 21:29:17,977 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:18,087 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:18,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:18,189 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:18,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:18,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2019-01-07 21:29:18,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:18,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-07 21:29:18,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-07 21:29:18,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=246, Unknown=0, NotChecked=0, Total=380 [2019-01-07 21:29:18,209 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2019-01-07 21:29:18,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:18,516 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-07 21:29:18,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-07 21:29:18,517 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2019-01-07 21:29:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:18,518 INFO L225 Difference]: With dead ends: 35 [2019-01-07 21:29:18,518 INFO L226 Difference]: Without dead ends: 34 [2019-01-07 21:29:18,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=242, Invalid=408, Unknown=0, NotChecked=0, Total=650 [2019-01-07 21:29:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-07 21:29:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-01-07 21:29:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-07 21:29:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-07 21:29:18,526 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2019-01-07 21:29:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:18,527 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-07 21:29:18,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-07 21:29:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-07 21:29:18,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-07 21:29:18,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:18,528 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1] [2019-01-07 21:29:18,528 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:18,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:18,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1614023795, now seen corresponding path program 5 times [2019-01-07 21:29:18,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:18,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:18,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:18,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:18,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:18,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:18,709 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:18,709 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:18,709 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:18,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:18,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-07 21:29:18,719 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:18,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:18,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-07 21:29:18,786 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:18,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:18,800 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-01-07 21:29:18,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:18,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:18,811 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:19,021 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:19,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:19,183 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:19,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:19,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2019-01-07 21:29:19,211 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:19,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-07 21:29:19,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-07 21:29:19,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=323, Unknown=0, NotChecked=0, Total=506 [2019-01-07 21:29:19,213 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2019-01-07 21:29:19,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:19,721 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-07 21:29:19,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-07 21:29:19,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2019-01-07 21:29:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:19,724 INFO L225 Difference]: With dead ends: 40 [2019-01-07 21:29:19,724 INFO L226 Difference]: Without dead ends: 39 [2019-01-07 21:29:19,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=543, Unknown=0, NotChecked=0, Total=870 [2019-01-07 21:29:19,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-07 21:29:19,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-07 21:29:19,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-07 21:29:19,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-07 21:29:19,736 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2019-01-07 21:29:19,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:19,739 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-07 21:29:19,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-07 21:29:19,740 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-07 21:29:19,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-07 21:29:19,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:19,741 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1] [2019-01-07 21:29:19,741 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:19,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:19,742 INFO L82 PathProgramCache]: Analyzing trace with hash -512538749, now seen corresponding path program 6 times [2019-01-07 21:29:19,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:19,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:19,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:19,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:19,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:20,009 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:20,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:20,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:20,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:20,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:20,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:20,011 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-01-07 21:29:20,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:20,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:20,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:20,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:20,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:20,066 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-01-07 21:29:20,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:20,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:20,077 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:20,234 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:20,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:20,443 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:20,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:20,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2019-01-07 21:29:20,462 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:20,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-07 21:29:20,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-07 21:29:20,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=410, Unknown=0, NotChecked=0, Total=650 [2019-01-07 21:29:20,465 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2019-01-07 21:29:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:21,091 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-07 21:29:21,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-07 21:29:21,092 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2019-01-07 21:29:21,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:21,094 INFO L225 Difference]: With dead ends: 45 [2019-01-07 21:29:21,094 INFO L226 Difference]: Without dead ends: 44 [2019-01-07 21:29:21,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=425, Invalid=697, Unknown=0, NotChecked=0, Total=1122 [2019-01-07 21:29:21,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-07 21:29:21,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-07 21:29:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-07 21:29:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-07 21:29:21,103 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2019-01-07 21:29:21,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:21,104 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-07 21:29:21,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-07 21:29:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-07 21:29:21,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-07 21:29:21,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:21,105 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1] [2019-01-07 21:29:21,106 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:21,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:21,106 INFO L82 PathProgramCache]: Analyzing trace with hash 416183923, now seen corresponding path program 7 times [2019-01-07 21:29:21,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:21,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:21,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:21,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:21,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:21,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:21,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:21,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:21,535 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:21,535 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:21,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:21,535 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-01-07 21:29:21,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:21,545 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:21,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:21,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:21,589 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-01-07 21:29:21,589 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:21,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:21,601 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:21,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:22,305 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:22,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:22,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2019-01-07 21:29:22,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:22,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-07 21:29:22,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-07 21:29:22,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=507, Unknown=0, NotChecked=0, Total=812 [2019-01-07 21:29:22,330 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 20 states. [2019-01-07 21:29:22,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:22,647 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-07 21:29:22,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-07 21:29:22,647 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-01-07 21:29:22,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:22,649 INFO L225 Difference]: With dead ends: 50 [2019-01-07 21:29:22,649 INFO L226 Difference]: Without dead ends: 49 [2019-01-07 21:29:22,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 370 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=536, Invalid=870, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 21:29:22,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-07 21:29:22,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2019-01-07 21:29:22,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-07 21:29:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-07 21:29:22,660 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2019-01-07 21:29:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:22,661 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-07 21:29:22,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-07 21:29:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-07 21:29:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-07 21:29:22,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:22,662 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1] [2019-01-07 21:29:22,663 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:22,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:22,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1523260803, now seen corresponding path program 8 times [2019-01-07 21:29:22,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:22,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:22,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:22,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:22,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:22,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:22,865 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:22,866 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:22,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:22,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:22,866 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-01-07 21:29:22,881 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:22,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:22,942 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-07 21:29:22,942 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:22,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:22,959 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-01-07 21:29:22,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:22,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:22,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:23,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:23,342 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:23,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:23,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2019-01-07 21:29:23,361 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:23,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-07 21:29:23,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-07 21:29:23,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=614, Unknown=0, NotChecked=0, Total=992 [2019-01-07 21:29:23,363 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2019-01-07 21:29:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:23,796 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-07 21:29:23,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-07 21:29:23,796 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 45 [2019-01-07 21:29:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:23,797 INFO L225 Difference]: With dead ends: 55 [2019-01-07 21:29:23,797 INFO L226 Difference]: Without dead ends: 54 [2019-01-07 21:29:23,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=660, Invalid=1062, Unknown=0, NotChecked=0, Total=1722 [2019-01-07 21:29:23,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-07 21:29:23,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2019-01-07 21:29:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-07 21:29:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-07 21:29:23,807 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2019-01-07 21:29:23,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:23,807 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-07 21:29:23,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-07 21:29:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-07 21:29:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-07 21:29:23,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:23,809 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1] [2019-01-07 21:29:23,809 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:23,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash 183263347, now seen corresponding path program 9 times [2019-01-07 21:29:23,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:23,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:23,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:23,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:23,812 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:24,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:24,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:24,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:24,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:24,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:24,216 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-01-07 21:29:24,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:24,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:24,260 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:24,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:24,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:24,270 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-01-07 21:29:24,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:24,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:24,280 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:24,580 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:24,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:24,781 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:24,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:24,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2019-01-07 21:29:24,804 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:24,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-07 21:29:24,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-07 21:29:24,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-07 21:29:24,806 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 24 states. [2019-01-07 21:29:25,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:25,188 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-07 21:29:25,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-07 21:29:25,189 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 50 [2019-01-07 21:29:25,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:25,189 INFO L225 Difference]: With dead ends: 60 [2019-01-07 21:29:25,190 INFO L226 Difference]: Without dead ends: 59 [2019-01-07 21:29:25,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=797, Invalid=1273, Unknown=0, NotChecked=0, Total=2070 [2019-01-07 21:29:25,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-07 21:29:25,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2019-01-07 21:29:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-07 21:29:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-07 21:29:25,199 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2019-01-07 21:29:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:25,199 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-07 21:29:25,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-07 21:29:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-07 21:29:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-07 21:29:25,200 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:25,200 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1] [2019-01-07 21:29:25,201 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:25,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:25,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2133888125, now seen corresponding path program 10 times [2019-01-07 21:29:25,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:25,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:25,203 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:25,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:25,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:25,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:25,600 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:25,600 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:25,600 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:25,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:25,600 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-01-07 21:29:25,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:25,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:25,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:25,672 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-01-07 21:29:25,673 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:25,716 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:25,717 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:25,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:26,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:26,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2019-01-07 21:29:26,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:26,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-07 21:29:26,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-07 21:29:26,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=548, Invalid=858, Unknown=0, NotChecked=0, Total=1406 [2019-01-07 21:29:26,218 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 26 states. [2019-01-07 21:29:26,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:26,693 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-07 21:29:26,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-07 21:29:26,693 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2019-01-07 21:29:26,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:26,694 INFO L225 Difference]: With dead ends: 65 [2019-01-07 21:29:26,694 INFO L226 Difference]: Without dead ends: 64 [2019-01-07 21:29:26,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=947, Invalid=1503, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 21:29:26,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-07 21:29:26,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2019-01-07 21:29:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-07 21:29:26,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-07 21:29:26,706 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2019-01-07 21:29:26,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:26,706 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-07 21:29:26,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-07 21:29:26,706 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-07 21:29:26,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-07 21:29:26,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:26,707 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1] [2019-01-07 21:29:26,708 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:26,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:26,708 INFO L82 PathProgramCache]: Analyzing trace with hash -936523149, now seen corresponding path program 11 times [2019-01-07 21:29:26,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:26,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:26,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:26,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:26,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:26,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:26,968 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:26,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:26,968 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:26,968 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:26,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:26,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:26,969 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-01-07 21:29:26,977 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:26,977 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:27,034 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-07 21:29:27,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:27,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:27,048 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-01-07 21:29:27,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:27,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:27,058 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:27,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:27,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:27,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2019-01-07 21:29:27,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:27,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-07 21:29:27,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-07 21:29:27,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=645, Invalid=995, Unknown=0, NotChecked=0, Total=1640 [2019-01-07 21:29:27,620 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2019-01-07 21:29:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:28,186 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-07 21:29:28,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-07 21:29:28,187 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2019-01-07 21:29:28,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:28,188 INFO L225 Difference]: With dead ends: 70 [2019-01-07 21:29:28,188 INFO L226 Difference]: Without dead ends: 69 [2019-01-07 21:29:28,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1110, Invalid=1752, Unknown=0, NotChecked=0, Total=2862 [2019-01-07 21:29:28,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-07 21:29:28,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2019-01-07 21:29:28,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-07 21:29:28,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-07 21:29:28,202 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2019-01-07 21:29:28,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:28,202 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-07 21:29:28,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-07 21:29:28,202 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-07 21:29:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-07 21:29:28,203 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:28,204 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1] [2019-01-07 21:29:28,204 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:28,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:28,204 INFO L82 PathProgramCache]: Analyzing trace with hash -975156861, now seen corresponding path program 12 times [2019-01-07 21:29:28,204 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:28,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:28,205 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:28,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:28,206 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:29,297 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:29,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:29,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:29,298 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:29,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:29,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:29,298 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-01-07 21:29:29,309 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:29,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:29,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:29,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:29,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:29,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-01-07 21:29:29,398 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:29,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-01-07 21:29:29,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:29,701 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:29,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:30,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:30,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2019-01-07 21:29:30,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:30,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-07 21:29:30,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-07 21:29:30,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=750, Invalid=1142, Unknown=0, NotChecked=0, Total=1892 [2019-01-07 21:29:30,255 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 30 states. [2019-01-07 21:29:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:31,029 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-07 21:29:31,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-07 21:29:31,030 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 65 [2019-01-07 21:29:31,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:31,030 INFO L225 Difference]: With dead ends: 75 [2019-01-07 21:29:31,030 INFO L226 Difference]: Without dead ends: 74 [2019-01-07 21:29:31,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 930 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1286, Invalid=2020, Unknown=0, NotChecked=0, Total=3306 [2019-01-07 21:29:31,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-07 21:29:31,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2019-01-07 21:29:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-07 21:29:31,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-07 21:29:31,043 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2019-01-07 21:29:31,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:31,043 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-07 21:29:31,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-07 21:29:31,043 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-07 21:29:31,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-07 21:29:31,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:31,045 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1] [2019-01-07 21:29:31,045 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:31,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1513272435, now seen corresponding path program 13 times [2019-01-07 21:29:31,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:31,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:31,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:31,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:31,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:31,406 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:31,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:31,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:31,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:31,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:31,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:31,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 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-01-07 21:29:31,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:31,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:31,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:31,479 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-01-07 21:29:31,480 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:31,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:31,488 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:31,922 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:31,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:32,872 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:32,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:32,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2019-01-07 21:29:32,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:32,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-07 21:29:32,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-07 21:29:32,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=1299, Unknown=0, NotChecked=0, Total=2162 [2019-01-07 21:29:32,893 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 32 states. [2019-01-07 21:29:33,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:33,452 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-07 21:29:33,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-07 21:29:33,453 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 70 [2019-01-07 21:29:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:33,454 INFO L225 Difference]: With dead ends: 80 [2019-01-07 21:29:33,454 INFO L226 Difference]: Without dead ends: 79 [2019-01-07 21:29:33,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1072 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1475, Invalid=2307, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 21:29:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-07 21:29:33,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2019-01-07 21:29:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-07 21:29:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-07 21:29:33,465 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2019-01-07 21:29:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:33,466 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-07 21:29:33,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-07 21:29:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-07 21:29:33,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-07 21:29:33,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:33,467 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1] [2019-01-07 21:29:33,467 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:33,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:33,468 INFO L82 PathProgramCache]: Analyzing trace with hash 610115459, now seen corresponding path program 14 times [2019-01-07 21:29:33,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:33,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:33,468 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:33,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:33,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:33,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:33,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:33,880 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:33,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:33,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:33,880 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-01-07 21:29:33,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:33,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:33,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-07 21:29:33,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:33,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:33,999 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-01-07 21:29:34,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:34,019 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:34,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:34,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:34,879 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:34,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:34,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2019-01-07 21:29:34,899 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:34,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-07 21:29:34,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-07 21:29:34,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=984, Invalid=1466, Unknown=0, NotChecked=0, Total=2450 [2019-01-07 21:29:34,901 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 34 states. [2019-01-07 21:29:35,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:35,476 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-07 21:29:35,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-07 21:29:35,477 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 75 [2019-01-07 21:29:35,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:35,477 INFO L225 Difference]: With dead ends: 85 [2019-01-07 21:29:35,478 INFO L226 Difference]: Without dead ends: 84 [2019-01-07 21:29:35,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1677, Invalid=2613, Unknown=0, NotChecked=0, Total=4290 [2019-01-07 21:29:35,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-07 21:29:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2019-01-07 21:29:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-07 21:29:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-07 21:29:35,493 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2019-01-07 21:29:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:35,494 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-07 21:29:35,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-07 21:29:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-07 21:29:35,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-07 21:29:35,495 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:35,495 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1] [2019-01-07 21:29:35,495 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1117462131, now seen corresponding path program 15 times [2019-01-07 21:29:35,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:35,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:35,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:35,497 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:35,805 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:35,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:35,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:35,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:35,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:35,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:35,806 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-01-07 21:29:35,814 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:35,814 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:35,869 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:35,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:35,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:35,899 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-01-07 21:29:35,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:35,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:35,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:36,602 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:36,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:37,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:37,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2019-01-07 21:29:37,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:37,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-07 21:29:37,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-07 21:29:37,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1113, Invalid=1643, Unknown=0, NotChecked=0, Total=2756 [2019-01-07 21:29:37,042 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 36 states. [2019-01-07 21:29:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:37,663 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-07 21:29:37,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-07 21:29:37,663 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 80 [2019-01-07 21:29:37,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:37,664 INFO L225 Difference]: With dead ends: 90 [2019-01-07 21:29:37,664 INFO L226 Difference]: Without dead ends: 89 [2019-01-07 21:29:37,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1892, Invalid=2938, Unknown=0, NotChecked=0, Total=4830 [2019-01-07 21:29:37,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-07 21:29:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-01-07 21:29:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-07 21:29:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-07 21:29:37,678 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2019-01-07 21:29:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:37,679 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-07 21:29:37,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-07 21:29:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-07 21:29:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-07 21:29:37,680 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:37,680 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1] [2019-01-07 21:29:37,681 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:37,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:37,681 INFO L82 PathProgramCache]: Analyzing trace with hash 514291075, now seen corresponding path program 16 times [2019-01-07 21:29:37,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:37,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:37,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:37,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:37,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:38,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:38,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:38,047 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:38,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:38,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:38,047 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-01-07 21:29:38,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:38,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:38,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:38,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-01-07 21:29:38,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:38,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:38,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:38,395 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:38,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:38,871 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:38,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:38,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2019-01-07 21:29:38,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:38,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-07 21:29:38,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-07 21:29:38,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1250, Invalid=1830, Unknown=0, NotChecked=0, Total=3080 [2019-01-07 21:29:38,892 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 38 states. [2019-01-07 21:29:39,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:39,662 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-07 21:29:39,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-07 21:29:39,662 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 85 [2019-01-07 21:29:39,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:39,663 INFO L225 Difference]: With dead ends: 95 [2019-01-07 21:29:39,663 INFO L226 Difference]: Without dead ends: 94 [2019-01-07 21:29:39,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2120, Invalid=3282, Unknown=0, NotChecked=0, Total=5402 [2019-01-07 21:29:39,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-07 21:29:39,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2019-01-07 21:29:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-07 21:29:39,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-07 21:29:39,674 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2019-01-07 21:29:39,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:39,674 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-07 21:29:39,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-07 21:29:39,674 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-07 21:29:39,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-07 21:29:39,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:39,675 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1] [2019-01-07 21:29:39,675 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:39,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:39,675 INFO L82 PathProgramCache]: Analyzing trace with hash 2064058483, now seen corresponding path program 17 times [2019-01-07 21:29:39,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:39,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:39,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:39,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:39,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:39,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:40,182 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:40,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:40,182 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:40,182 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:40,182 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:40,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:40,182 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-01-07 21:29:40,191 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:40,191 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:40,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-07 21:29:40,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:40,282 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:40,285 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-01-07 21:29:40,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:40,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:40,301 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:40,695 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:40,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:41,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:41,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2019-01-07 21:29:41,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:41,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-07 21:29:41,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-07 21:29:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1395, Invalid=2027, Unknown=0, NotChecked=0, Total=3422 [2019-01-07 21:29:41,418 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 40 states. [2019-01-07 21:29:42,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:42,052 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-07 21:29:42,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-07 21:29:42,053 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-01-07 21:29:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:42,054 INFO L225 Difference]: With dead ends: 100 [2019-01-07 21:29:42,054 INFO L226 Difference]: Without dead ends: 99 [2019-01-07 21:29:42,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2361, Invalid=3645, Unknown=0, NotChecked=0, Total=6006 [2019-01-07 21:29:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-07 21:29:42,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2019-01-07 21:29:42,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-07 21:29:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-07 21:29:42,067 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2019-01-07 21:29:42,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:42,068 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-07 21:29:42,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-07 21:29:42,068 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-07 21:29:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-07 21:29:42,069 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:42,069 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1] [2019-01-07 21:29:42,069 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:42,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1088566397, now seen corresponding path program 18 times [2019-01-07 21:29:42,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:42,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:42,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:42,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:42,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:42,468 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:42,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:42,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:42,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:42,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:42,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:42,469 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-01-07 21:29:42,477 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:42,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:42,542 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:42,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:42,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:42,549 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-01-07 21:29:42,550 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:42,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-01-07 21:29:42,560 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:42,909 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:42,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:43,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:43,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2019-01-07 21:29:43,529 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:43,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-07 21:29:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-07 21:29:43,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1548, Invalid=2234, Unknown=0, NotChecked=0, Total=3782 [2019-01-07 21:29:43,530 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 42 states. [2019-01-07 21:29:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:44,171 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-07 21:29:44,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-07 21:29:44,172 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 95 [2019-01-07 21:29:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:44,173 INFO L225 Difference]: With dead ends: 105 [2019-01-07 21:29:44,173 INFO L226 Difference]: Without dead ends: 104 [2019-01-07 21:29:44,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1932 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2615, Invalid=4027, Unknown=0, NotChecked=0, Total=6642 [2019-01-07 21:29:44,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-07 21:29:44,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2019-01-07 21:29:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-07 21:29:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-07 21:29:44,187 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2019-01-07 21:29:44,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:44,187 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-07 21:29:44,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-07 21:29:44,188 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-07 21:29:44,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-07 21:29:44,188 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:44,188 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1] [2019-01-07 21:29:44,189 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:44,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:44,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1964405363, now seen corresponding path program 19 times [2019-01-07 21:29:44,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:44,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:44,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:44,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:44,703 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:44,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:44,703 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:44,703 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:44,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:44,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:44,704 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-01-07 21:29:44,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:44,713 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:44,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:44,777 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:44,783 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-01-07 21:29:44,784 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:44,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:44,795 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:45,220 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:45,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:46,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:46,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2019-01-07 21:29:46,103 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:46,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-07 21:29:46,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-07 21:29:46,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=2451, Unknown=0, NotChecked=0, Total=4160 [2019-01-07 21:29:46,104 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 44 states. [2019-01-07 21:29:46,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:46,818 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-07 21:29:46,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-07 21:29:46,823 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 100 [2019-01-07 21:29:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:46,824 INFO L225 Difference]: With dead ends: 110 [2019-01-07 21:29:46,824 INFO L226 Difference]: Without dead ends: 109 [2019-01-07 21:29:46,825 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2134 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2882, Invalid=4428, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 21:29:46,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-07 21:29:46,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2019-01-07 21:29:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-07 21:29:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-07 21:29:46,837 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2019-01-07 21:29:46,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:46,837 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-07 21:29:46,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-07 21:29:46,837 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-07 21:29:46,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-07 21:29:46,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:46,838 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 1, 1] [2019-01-07 21:29:46,838 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:46,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:46,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1742691965, now seen corresponding path program 20 times [2019-01-07 21:29:46,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:46,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:46,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:46,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:46,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:46,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:47,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:47,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:47,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:47,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:47,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:47,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 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-01-07 21:29:47,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:47,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:47,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-07 21:29:47,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:47,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:47,521 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-01-07 21:29:47,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:47,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:47,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:47,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:47,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:48,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 1030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:48,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:48,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2019-01-07 21:29:48,888 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:48,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-07 21:29:48,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-07 21:29:48,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1878, Invalid=2678, Unknown=0, NotChecked=0, Total=4556 [2019-01-07 21:29:48,890 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 46 states. [2019-01-07 21:29:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:49,851 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-07 21:29:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-07 21:29:49,852 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 105 [2019-01-07 21:29:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:49,852 INFO L225 Difference]: With dead ends: 115 [2019-01-07 21:29:49,853 INFO L226 Difference]: Without dead ends: 114 [2019-01-07 21:29:49,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3162, Invalid=4848, Unknown=0, NotChecked=0, Total=8010 [2019-01-07 21:29:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-07 21:29:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2019-01-07 21:29:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-07 21:29:49,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-07 21:29:49,866 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2019-01-07 21:29:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:49,866 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-07 21:29:49,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-07 21:29:49,867 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-07 21:29:49,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-07 21:29:49,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:49,867 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 1, 1] [2019-01-07 21:29:49,868 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:49,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:49,868 INFO L82 PathProgramCache]: Analyzing trace with hash 443112563, now seen corresponding path program 21 times [2019-01-07 21:29:49,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:49,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:49,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:49,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:49,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:50,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:50,295 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:50,295 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:50,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:50,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:50,295 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-01-07 21:29:50,304 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:29:50,304 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:29:50,370 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:29:50,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:50,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:50,381 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-01-07 21:29:50,381 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:50,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:50,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:50,787 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:51,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 0 proven. 1134 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:51,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:51,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2019-01-07 21:29:51,555 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:51,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-07 21:29:51,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-07 21:29:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2055, Invalid=2915, Unknown=0, NotChecked=0, Total=4970 [2019-01-07 21:29:51,556 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 48 states. [2019-01-07 21:29:52,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:52,460 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-01-07 21:29:52,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-07 21:29:52,461 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 110 [2019-01-07 21:29:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:52,462 INFO L225 Difference]: With dead ends: 120 [2019-01-07 21:29:52,462 INFO L226 Difference]: Without dead ends: 119 [2019-01-07 21:29:52,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2568 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3455, Invalid=5287, Unknown=0, NotChecked=0, Total=8742 [2019-01-07 21:29:52,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-07 21:29:52,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2019-01-07 21:29:52,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-01-07 21:29:52,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-01-07 21:29:52,482 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2019-01-07 21:29:52,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:52,482 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-01-07 21:29:52,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-07 21:29:52,482 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-01-07 21:29:52,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-01-07 21:29:52,483 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:52,483 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1] [2019-01-07 21:29:52,483 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:52,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:52,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1005586557, now seen corresponding path program 22 times [2019-01-07 21:29:52,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:52,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:52,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:52,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:52,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:52,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:52,967 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:52,967 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:52,967 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:52,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:52,968 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-01-07 21:29:52,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:52,976 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:29:53,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:53,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:53,067 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-01-07 21:29:53,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:53,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:29:53,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:53,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:53,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:54,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 0 proven. 1243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:54,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:54,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2019-01-07 21:29:54,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:54,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-07 21:29:54,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-07 21:29:54,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2240, Invalid=3162, Unknown=0, NotChecked=0, Total=5402 [2019-01-07 21:29:54,445 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 50 states. [2019-01-07 21:29:55,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:55,618 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2019-01-07 21:29:55,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-07 21:29:55,618 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 115 [2019-01-07 21:29:55,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:55,619 INFO L225 Difference]: With dead ends: 125 [2019-01-07 21:29:55,619 INFO L226 Difference]: Without dead ends: 124 [2019-01-07 21:29:55,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2800 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3761, Invalid=5745, Unknown=0, NotChecked=0, Total=9506 [2019-01-07 21:29:55,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-07 21:29:55,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2019-01-07 21:29:55,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-01-07 21:29:55,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2019-01-07 21:29:55,634 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2019-01-07 21:29:55,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:55,635 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2019-01-07 21:29:55,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-07 21:29:55,635 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2019-01-07 21:29:55,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-01-07 21:29:55,635 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:55,635 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 1, 1] [2019-01-07 21:29:55,636 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:55,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:55,636 INFO L82 PathProgramCache]: Analyzing trace with hash -861944205, now seen corresponding path program 23 times [2019-01-07 21:29:55,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:55,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:29:55,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:55,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:29:56,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:56,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:56,911 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:29:56,912 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:29:56,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:29:56,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:29:56,912 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-01-07 21:29:56,924 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:29:56,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:29:57,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-07 21:29:57,054 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:29:57,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:29:57,067 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-01-07 21:29:57,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:29:57,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-01-07 21:29:57,081 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:29:57,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:57,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:29:58,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1357 backedges. 0 proven. 1357 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:29:58,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:29:58,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2019-01-07 21:29:58,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:29:58,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-07 21:29:58,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-07 21:29:58,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2433, Invalid=3419, Unknown=0, NotChecked=0, Total=5852 [2019-01-07 21:29:58,459 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 52 states. [2019-01-07 21:29:59,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:29:59,403 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-01-07 21:29:59,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-07 21:29:59,404 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 120 [2019-01-07 21:29:59,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:29:59,405 INFO L225 Difference]: With dead ends: 130 [2019-01-07 21:29:59,405 INFO L226 Difference]: Without dead ends: 129 [2019-01-07 21:29:59,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3042 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4080, Invalid=6222, Unknown=0, NotChecked=0, Total=10302 [2019-01-07 21:29:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-07 21:29:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-01-07 21:29:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-07 21:29:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-01-07 21:29:59,423 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2019-01-07 21:29:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:29:59,423 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-01-07 21:29:59,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-07 21:29:59,424 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-01-07 21:29:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-07 21:29:59,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:29:59,424 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 1, 1] [2019-01-07 21:29:59,425 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:29:59,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:29:59,425 INFO L82 PathProgramCache]: Analyzing trace with hash -448017021, now seen corresponding path program 24 times [2019-01-07 21:29:59,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:29:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:59,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:29:59,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:29:59,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:29:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:00,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:00,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:00,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:00,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:00,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:00,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:00,289 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-01-07 21:30:00,298 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:30:00,298 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:30:00,381 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:30:00,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:00,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:00,389 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-01-07 21:30:00,389 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:00,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:30:00,398 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:00,900 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:01,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1476 backedges. 0 proven. 1476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:01,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:01,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2019-01-07 21:30:01,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:01,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-07 21:30:01,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-07 21:30:01,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2634, Invalid=3686, Unknown=0, NotChecked=0, Total=6320 [2019-01-07 21:30:01,898 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 54 states. [2019-01-07 21:30:02,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:02,924 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2019-01-07 21:30:02,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-07 21:30:02,925 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 125 [2019-01-07 21:30:02,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:02,926 INFO L225 Difference]: With dead ends: 135 [2019-01-07 21:30:02,926 INFO L226 Difference]: Without dead ends: 134 [2019-01-07 21:30:02,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4412, Invalid=6718, Unknown=0, NotChecked=0, Total=11130 [2019-01-07 21:30:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-07 21:30:02,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2019-01-07 21:30:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-01-07 21:30:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2019-01-07 21:30:02,969 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2019-01-07 21:30:02,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:02,969 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2019-01-07 21:30:02,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-07 21:30:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2019-01-07 21:30:02,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-01-07 21:30:02,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:02,970 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 1, 1] [2019-01-07 21:30:02,971 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:02,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:02,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1700376691, now seen corresponding path program 25 times [2019-01-07 21:30:02,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:02,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:02,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:02,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:02,972 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:04,045 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:04,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:04,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:04,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:04,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:04,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:04,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 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-01-07 21:30:04,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:04,055 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:04,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:04,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:04,161 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-01-07 21:30:04,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:04,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:30:04,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:04,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:04,759 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:05,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:06,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:06,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2019-01-07 21:30:06,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:06,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-07 21:30:06,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-07 21:30:06,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2843, Invalid=3963, Unknown=0, NotChecked=0, Total=6806 [2019-01-07 21:30:06,018 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 56 states. [2019-01-07 21:30:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:07,196 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-01-07 21:30:07,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-07 21:30:07,196 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 130 [2019-01-07 21:30:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:07,197 INFO L225 Difference]: With dead ends: 140 [2019-01-07 21:30:07,197 INFO L226 Difference]: Without dead ends: 139 [2019-01-07 21:30:07,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3556 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4757, Invalid=7233, Unknown=0, NotChecked=0, Total=11990 [2019-01-07 21:30:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-01-07 21:30:07,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2019-01-07 21:30:07,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-01-07 21:30:07,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-01-07 21:30:07,219 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2019-01-07 21:30:07,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:07,219 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-01-07 21:30:07,219 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-07 21:30:07,220 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-01-07 21:30:07,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-01-07 21:30:07,220 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:07,220 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 1, 1] [2019-01-07 21:30:07,221 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:07,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:07,221 INFO L82 PathProgramCache]: Analyzing trace with hash 640951171, now seen corresponding path program 26 times [2019-01-07 21:30:07,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:07,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:07,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:07,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:07,222 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:07,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:07,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:07,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:07,780 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:07,780 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:07,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:07,780 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-01-07 21:30:07,791 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:07,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:07,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-07 21:30:07,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:07,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:07,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-01-07 21:30:07,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:08,053 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:30:08,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:09,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:11,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:11,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:11,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2019-01-07 21:30:11,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:11,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-07 21:30:11,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-07 21:30:11,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3060, Invalid=4250, Unknown=0, NotChecked=0, Total=7310 [2019-01-07 21:30:11,084 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 58 states. [2019-01-07 21:30:12,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:12,175 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2019-01-07 21:30:12,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-07 21:30:12,175 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 135 [2019-01-07 21:30:12,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:12,176 INFO L225 Difference]: With dead ends: 145 [2019-01-07 21:30:12,176 INFO L226 Difference]: Without dead ends: 144 [2019-01-07 21:30:12,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5115, Invalid=7767, Unknown=0, NotChecked=0, Total=12882 [2019-01-07 21:30:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-01-07 21:30:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2019-01-07 21:30:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-01-07 21:30:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2019-01-07 21:30:12,197 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2019-01-07 21:30:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:12,198 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2019-01-07 21:30:12,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-07 21:30:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2019-01-07 21:30:12,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-01-07 21:30:12,199 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:12,199 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 1, 1] [2019-01-07 21:30:12,199 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:12,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:12,199 INFO L82 PathProgramCache]: Analyzing trace with hash 909580915, now seen corresponding path program 27 times [2019-01-07 21:30:12,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:12,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:12,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:12,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:12,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:12,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:12,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:12,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:12,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:12,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:12,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:12,807 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-01-07 21:30:12,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:30:12,818 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:30:12,915 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:30:12,915 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:12,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:12,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-01-07 21:30:12,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:12,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:30:12,935 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:13,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:13,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 0 proven. 1863 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:15,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:15,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2019-01-07 21:30:15,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:15,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-07 21:30:15,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-07 21:30:15,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3285, Invalid=4547, Unknown=0, NotChecked=0, Total=7832 [2019-01-07 21:30:15,020 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 60 states. [2019-01-07 21:30:16,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:16,440 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2019-01-07 21:30:16,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-07 21:30:16,440 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 140 [2019-01-07 21:30:16,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:16,441 INFO L225 Difference]: With dead ends: 150 [2019-01-07 21:30:16,441 INFO L226 Difference]: Without dead ends: 149 [2019-01-07 21:30:16,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4110 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5486, Invalid=8320, Unknown=0, NotChecked=0, Total=13806 [2019-01-07 21:30:16,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-01-07 21:30:16,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2019-01-07 21:30:16,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-07 21:30:16,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2019-01-07 21:30:16,463 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2019-01-07 21:30:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:16,464 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2019-01-07 21:30:16,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-07 21:30:16,464 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2019-01-07 21:30:16,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-01-07 21:30:16,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:16,465 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 1, 1] [2019-01-07 21:30:16,465 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:16,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:16,465 INFO L82 PathProgramCache]: Analyzing trace with hash 958986627, now seen corresponding path program 28 times [2019-01-07 21:30:16,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:16,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:16,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:16,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:16,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:17,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:17,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:17,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:17,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:17,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:17,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:17,150 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-01-07 21:30:17,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:17,160 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:17,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:17,270 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-01-07 21:30:17,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:17,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:30:17,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:17,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:17,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:19,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:19,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:19,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2019-01-07 21:30:19,205 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:19,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-07 21:30:19,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-07 21:30:19,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3518, Invalid=4854, Unknown=0, NotChecked=0, Total=8372 [2019-01-07 21:30:19,207 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 62 states. [2019-01-07 21:30:20,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:20,616 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2019-01-07 21:30:20,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-07 21:30:20,617 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 145 [2019-01-07 21:30:20,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:20,618 INFO L225 Difference]: With dead ends: 155 [2019-01-07 21:30:20,618 INFO L226 Difference]: Without dead ends: 154 [2019-01-07 21:30:20,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4402 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5870, Invalid=8892, Unknown=0, NotChecked=0, Total=14762 [2019-01-07 21:30:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-07 21:30:20,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2019-01-07 21:30:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-01-07 21:30:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2019-01-07 21:30:20,640 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2019-01-07 21:30:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:20,640 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2019-01-07 21:30:20,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-07 21:30:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2019-01-07 21:30:20,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-01-07 21:30:20,641 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:20,641 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 1, 1] [2019-01-07 21:30:20,641 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash 148374643, now seen corresponding path program 29 times [2019-01-07 21:30:20,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:20,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:20,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:20,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:21,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:21,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:21,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:21,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:21,726 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:21,726 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:21,726 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-01-07 21:30:21,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:21,736 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:21,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-01-07 21:30:21,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:21,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:21,908 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-01-07 21:30:21,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:21,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:30:21,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:23,173 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:23,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:24,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2146 backedges. 0 proven. 2146 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:24,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:24,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2019-01-07 21:30:24,417 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:24,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-07 21:30:24,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-07 21:30:24,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3759, Invalid=5171, Unknown=0, NotChecked=0, Total=8930 [2019-01-07 21:30:24,418 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 64 states. [2019-01-07 21:30:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:25,853 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2019-01-07 21:30:25,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-07 21:30:25,853 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 150 [2019-01-07 21:30:25,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:25,854 INFO L225 Difference]: With dead ends: 160 [2019-01-07 21:30:25,854 INFO L226 Difference]: Without dead ends: 159 [2019-01-07 21:30:25,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 236 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4704 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6267, Invalid=9483, Unknown=0, NotChecked=0, Total=15750 [2019-01-07 21:30:25,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-07 21:30:25,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2019-01-07 21:30:25,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-01-07 21:30:25,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2019-01-07 21:30:25,880 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2019-01-07 21:30:25,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:25,880 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2019-01-07 21:30:25,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-07 21:30:25,880 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2019-01-07 21:30:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-07 21:30:25,881 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:25,881 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 1, 1] [2019-01-07 21:30:25,882 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1485459331, now seen corresponding path program 30 times [2019-01-07 21:30:25,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:25,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:25,883 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:26,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:26,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:26,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:26,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:26,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:26,669 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-01-07 21:30:26,678 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:30:26,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:30:26,781 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:30:26,781 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:26,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:26,789 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-01-07 21:30:26,790 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:26,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:30:26,801 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:27,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:27,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2295 backedges. 0 proven. 2295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:29,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:29,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2019-01-07 21:30:29,189 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:29,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-07 21:30:29,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-07 21:30:29,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=5498, Unknown=0, NotChecked=0, Total=9506 [2019-01-07 21:30:29,190 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 66 states. [2019-01-07 21:30:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:30,720 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2019-01-07 21:30:30,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-07 21:30:30,721 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 155 [2019-01-07 21:30:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:30,722 INFO L225 Difference]: With dead ends: 165 [2019-01-07 21:30:30,722 INFO L226 Difference]: Without dead ends: 164 [2019-01-07 21:30:30,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6677, Invalid=10093, Unknown=0, NotChecked=0, Total=16770 [2019-01-07 21:30:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-01-07 21:30:30,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2019-01-07 21:30:30,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-01-07 21:30:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2019-01-07 21:30:30,750 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2019-01-07 21:30:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:30,750 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2019-01-07 21:30:30,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-07 21:30:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2019-01-07 21:30:30,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-07 21:30:30,751 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:30,752 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 1, 1] [2019-01-07 21:30:30,752 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:30,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:30,752 INFO L82 PathProgramCache]: Analyzing trace with hash 517762675, now seen corresponding path program 31 times [2019-01-07 21:30:30,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:30,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:30,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:30,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:30,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:30,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:31,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:31,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:31,582 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:31,582 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:31,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:31,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:31,582 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-01-07 21:30:31,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:31,591 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:31,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:31,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:31,702 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-01-07 21:30:31,702 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:31,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-01-07 21:30:31,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:32,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:33,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2449 backedges. 0 proven. 2449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:33,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:33,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2019-01-07 21:30:33,951 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:33,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-07 21:30:33,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-07 21:30:33,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4265, Invalid=5835, Unknown=0, NotChecked=0, Total=10100 [2019-01-07 21:30:33,954 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 68 states. [2019-01-07 21:30:34,702 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-07 21:30:36,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:36,207 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2019-01-07 21:30:36,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-07 21:30:36,208 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 160 [2019-01-07 21:30:36,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:36,209 INFO L225 Difference]: With dead ends: 170 [2019-01-07 21:30:36,209 INFO L226 Difference]: Without dead ends: 169 [2019-01-07 21:30:36,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5338 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7100, Invalid=10722, Unknown=0, NotChecked=0, Total=17822 [2019-01-07 21:30:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-01-07 21:30:36,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2019-01-07 21:30:36,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-01-07 21:30:36,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2019-01-07 21:30:36,243 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2019-01-07 21:30:36,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:36,243 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2019-01-07 21:30:36,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-07 21:30:36,243 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2019-01-07 21:30:36,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-07 21:30:36,244 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:36,244 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 1, 1] [2019-01-07 21:30:36,244 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:36,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:36,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1186473347, now seen corresponding path program 32 times [2019-01-07 21:30:36,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:36,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:36,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:36,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:36,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:37,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:37,760 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:37,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:37,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:37,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:37,761 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-01-07 21:30:37,769 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:37,769 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:37,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-01-07 21:30:37,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:37,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:37,968 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-01-07 21:30:37,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:37,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-01-07 21:30:37,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:38,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2608 backedges. 0 proven. 2608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:41,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:41,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2019-01-07 21:30:41,223 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:41,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-07 21:30:41,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-07 21:30:41,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4530, Invalid=6182, Unknown=0, NotChecked=0, Total=10712 [2019-01-07 21:30:41,225 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 70 states. [2019-01-07 21:30:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:42,666 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2019-01-07 21:30:42,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-07 21:30:42,666 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 165 [2019-01-07 21:30:42,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:42,667 INFO L225 Difference]: With dead ends: 175 [2019-01-07 21:30:42,667 INFO L226 Difference]: Without dead ends: 174 [2019-01-07 21:30:42,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5670 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7536, Invalid=11370, Unknown=0, NotChecked=0, Total=18906 [2019-01-07 21:30:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2019-01-07 21:30:42,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2019-01-07 21:30:42,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-01-07 21:30:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2019-01-07 21:30:42,706 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2019-01-07 21:30:42,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:42,706 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2019-01-07 21:30:42,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-07 21:30:42,706 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2019-01-07 21:30:42,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-01-07 21:30:42,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:42,707 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 1, 1] [2019-01-07 21:30:42,707 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:42,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:42,708 INFO L82 PathProgramCache]: Analyzing trace with hash 837048435, now seen corresponding path program 33 times [2019-01-07 21:30:42,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:42,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:42,709 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:42,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:42,709 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:42,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:43,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:43,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:43,864 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:43,865 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:43,865 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:43,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:43,865 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-01-07 21:30:43,881 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:30:43,881 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:30:43,989 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:30:43,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:43,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:43,998 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-01-07 21:30:43,998 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:44,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:30:44,009 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:44,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:46,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 0 proven. 2772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:46,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:46,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2019-01-07 21:30:46,810 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:46,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-07 21:30:46,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-07 21:30:46,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4803, Invalid=6539, Unknown=0, NotChecked=0, Total=11342 [2019-01-07 21:30:46,812 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 72 states. [2019-01-07 21:30:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:48,340 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-01-07 21:30:48,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-07 21:30:48,340 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 170 [2019-01-07 21:30:48,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:48,341 INFO L225 Difference]: With dead ends: 180 [2019-01-07 21:30:48,342 INFO L226 Difference]: Without dead ends: 179 [2019-01-07 21:30:48,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6012 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7985, Invalid=12037, Unknown=0, NotChecked=0, Total=20022 [2019-01-07 21:30:48,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-01-07 21:30:48,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2019-01-07 21:30:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-01-07 21:30:48,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2019-01-07 21:30:48,377 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2019-01-07 21:30:48,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:48,377 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2019-01-07 21:30:48,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-07 21:30:48,378 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2019-01-07 21:30:48,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-01-07 21:30:48,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:48,379 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 1, 1] [2019-01-07 21:30:48,379 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:48,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:48,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1309834115, now seen corresponding path program 34 times [2019-01-07 21:30:48,380 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:48,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:48,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:30:48,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:48,380 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:49,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:49,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:49,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:49,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:49,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:49,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:49,223 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-01-07 21:30:49,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:49,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:30:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:49,347 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:49,363 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-01-07 21:30:49,364 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:49,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:30:49,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:50,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:50,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:52,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2941 backedges. 0 proven. 2941 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:52,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:52,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2019-01-07 21:30:52,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:52,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-07 21:30:52,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-07 21:30:52,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5084, Invalid=6906, Unknown=0, NotChecked=0, Total=11990 [2019-01-07 21:30:52,378 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2019-01-07 21:30:54,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:30:54,296 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2019-01-07 21:30:54,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-07 21:30:54,296 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2019-01-07 21:30:54,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:30:54,297 INFO L225 Difference]: With dead ends: 185 [2019-01-07 21:30:54,297 INFO L226 Difference]: Without dead ends: 184 [2019-01-07 21:30:54,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6364 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8447, Invalid=12723, Unknown=0, NotChecked=0, Total=21170 [2019-01-07 21:30:54,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-01-07 21:30:54,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2019-01-07 21:30:54,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2019-01-07 21:30:54,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2019-01-07 21:30:54,335 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2019-01-07 21:30:54,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:30:54,335 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2019-01-07 21:30:54,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-07 21:30:54,336 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2019-01-07 21:30:54,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-01-07 21:30:54,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:30:54,337 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 1, 1] [2019-01-07 21:30:54,337 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:30:54,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:30:54,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1938801267, now seen corresponding path program 35 times [2019-01-07 21:30:54,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:30:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:54,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:30:54,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:30:54,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:30:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:30:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:55,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:55,531 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:30:55,531 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:30:55,531 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:30:55,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:30:55,531 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-01-07 21:30:55,559 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:30:55,559 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:30:55,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-01-07 21:30:55,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:30:55,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:30:55,782 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-01-07 21:30:55,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:30:55,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:30:55,871 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:30:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:57,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:30:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3115 backedges. 0 proven. 3115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:30:59,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:30:59,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2019-01-07 21:30:59,036 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:30:59,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-07 21:30:59,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-07 21:30:59,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5373, Invalid=7283, Unknown=0, NotChecked=0, Total=12656 [2019-01-07 21:30:59,038 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 76 states. [2019-01-07 21:31:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:00,637 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2019-01-07 21:31:00,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-07 21:31:00,638 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 180 [2019-01-07 21:31:00,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:00,639 INFO L225 Difference]: With dead ends: 190 [2019-01-07 21:31:00,639 INFO L226 Difference]: Without dead ends: 189 [2019-01-07 21:31:00,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6726 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8922, Invalid=13428, Unknown=0, NotChecked=0, Total=22350 [2019-01-07 21:31:00,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-01-07 21:31:00,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2019-01-07 21:31:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-01-07 21:31:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2019-01-07 21:31:00,670 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2019-01-07 21:31:00,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:00,671 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2019-01-07 21:31:00,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-07 21:31:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2019-01-07 21:31:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-01-07 21:31:00,672 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:00,672 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 1, 1] [2019-01-07 21:31:00,672 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:00,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:00,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1090081155, now seen corresponding path program 36 times [2019-01-07 21:31:00,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:00,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:00,674 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:00,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:00,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:01,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:01,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:01,913 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:01,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:01,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:01,913 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-01-07 21:31:01,921 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:31:01,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:31:02,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:31:02,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:02,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:02,073 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-01-07 21:31:02,074 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:02,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:31:02,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:04,001 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:04,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:06,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3294 backedges. 0 proven. 3294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:06,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:06,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2019-01-07 21:31:06,105 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:06,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-07 21:31:06,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-07 21:31:06,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5670, Invalid=7670, Unknown=0, NotChecked=0, Total=13340 [2019-01-07 21:31:06,108 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 78 states. [2019-01-07 21:31:08,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:08,117 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2019-01-07 21:31:08,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-07 21:31:08,117 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 185 [2019-01-07 21:31:08,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:08,118 INFO L225 Difference]: With dead ends: 195 [2019-01-07 21:31:08,118 INFO L226 Difference]: Without dead ends: 194 [2019-01-07 21:31:08,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 444 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7098 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9410, Invalid=14152, Unknown=0, NotChecked=0, Total=23562 [2019-01-07 21:31:08,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-01-07 21:31:08,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2019-01-07 21:31:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-01-07 21:31:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2019-01-07 21:31:08,152 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2019-01-07 21:31:08,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:08,152 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2019-01-07 21:31:08,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-07 21:31:08,152 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2019-01-07 21:31:08,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-01-07 21:31:08,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:08,153 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 1, 1] [2019-01-07 21:31:08,154 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:08,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:08,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1921078157, now seen corresponding path program 37 times [2019-01-07 21:31:08,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:08,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:08,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:08,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:08,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:09,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:09,171 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:09,171 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:09,171 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:09,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:09,171 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-01-07 21:31:09,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:09,181 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:31:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:09,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:09,311 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-01-07 21:31:09,311 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:09,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:31:09,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:10,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:12,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3478 backedges. 0 proven. 3478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:12,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:12,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2019-01-07 21:31:12,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:12,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-07 21:31:12,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-07 21:31:12,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5975, Invalid=8067, Unknown=0, NotChecked=0, Total=14042 [2019-01-07 21:31:12,663 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 80 states. [2019-01-07 21:31:14,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:14,589 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2019-01-07 21:31:14,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-07 21:31:14,589 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 190 [2019-01-07 21:31:14,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:14,590 INFO L225 Difference]: With dead ends: 200 [2019-01-07 21:31:14,590 INFO L226 Difference]: Without dead ends: 199 [2019-01-07 21:31:14,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7480 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9911, Invalid=14895, Unknown=0, NotChecked=0, Total=24806 [2019-01-07 21:31:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-01-07 21:31:14,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2019-01-07 21:31:14,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-01-07 21:31:14,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-01-07 21:31:14,632 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2019-01-07 21:31:14,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:14,632 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-01-07 21:31:14,632 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-07 21:31:14,632 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-01-07 21:31:14,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-01-07 21:31:14,633 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:14,633 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 1, 1] [2019-01-07 21:31:14,633 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:14,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:14,633 INFO L82 PathProgramCache]: Analyzing trace with hash 2043455363, now seen corresponding path program 38 times [2019-01-07 21:31:14,633 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:14,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:14,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:14,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:14,634 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:14,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:15,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:15,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:15,544 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:15,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:15,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:15,545 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-01-07 21:31:15,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:31:15,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:31:15,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-01-07 21:31:15,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:15,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:15,837 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-01-07 21:31:15,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:15,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:31:15,846 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:17,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:19,247 INFO L134 CoverageAnalysis]: Checked inductivity of 3667 backedges. 0 proven. 3667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:19,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:19,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2019-01-07 21:31:19,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:19,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-07 21:31:19,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-07 21:31:19,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6288, Invalid=8474, Unknown=0, NotChecked=0, Total=14762 [2019-01-07 21:31:19,270 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 82 states. [2019-01-07 21:31:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:21,315 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2019-01-07 21:31:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-07 21:31:21,316 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 195 [2019-01-07 21:31:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:21,317 INFO L225 Difference]: With dead ends: 205 [2019-01-07 21:31:21,317 INFO L226 Difference]: Without dead ends: 204 [2019-01-07 21:31:21,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 308 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7872 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=10425, Invalid=15657, Unknown=0, NotChecked=0, Total=26082 [2019-01-07 21:31:21,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-07 21:31:21,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2019-01-07 21:31:21,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-01-07 21:31:21,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2019-01-07 21:31:21,352 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2019-01-07 21:31:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:21,352 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2019-01-07 21:31:21,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-07 21:31:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2019-01-07 21:31:21,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-01-07 21:31:21,353 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:21,353 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 1, 1] [2019-01-07 21:31:21,353 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:21,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:21,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1588521357, now seen corresponding path program 39 times [2019-01-07 21:31:21,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:21,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:21,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:21,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:21,354 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:22,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:22,678 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:22,678 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:22,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:22,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:22,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 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-01-07 21:31:22,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:31:22,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:31:22,827 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:31:22,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:22,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:22,839 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-01-07 21:31:22,839 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:22,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:31:22,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:23,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:26,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3861 backedges. 0 proven. 3861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:26,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:26,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2019-01-07 21:31:26,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:26,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-07 21:31:26,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-07 21:31:26,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6609, Invalid=8891, Unknown=0, NotChecked=0, Total=15500 [2019-01-07 21:31:26,193 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 84 states. [2019-01-07 21:31:28,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:28,263 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2019-01-07 21:31:28,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-07 21:31:28,264 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 200 [2019-01-07 21:31:28,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:28,265 INFO L225 Difference]: With dead ends: 210 [2019-01-07 21:31:28,265 INFO L226 Difference]: Without dead ends: 209 [2019-01-07 21:31:28,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8274 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=10952, Invalid=16438, Unknown=0, NotChecked=0, Total=27390 [2019-01-07 21:31:28,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-01-07 21:31:28,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2019-01-07 21:31:28,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-01-07 21:31:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2019-01-07 21:31:28,308 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2019-01-07 21:31:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:28,309 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2019-01-07 21:31:28,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-07 21:31:28,309 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2019-01-07 21:31:28,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-01-07 21:31:28,310 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:28,310 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 1, 1] [2019-01-07 21:31:28,310 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:28,311 INFO L82 PathProgramCache]: Analyzing trace with hash -622035581, now seen corresponding path program 40 times [2019-01-07 21:31:28,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:28,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:28,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:28,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:29,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:29,869 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:29,869 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:29,869 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:29,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:29,870 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-01-07 21:31:29,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:29,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:31:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:30,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:30,028 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-01-07 21:31:30,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:30,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:31:30,037 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:31,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:31,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4060 backedges. 0 proven. 4060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:33,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:33,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2019-01-07 21:31:33,847 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:33,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-07 21:31:33,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-07 21:31:33,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6938, Invalid=9318, Unknown=0, NotChecked=0, Total=16256 [2019-01-07 21:31:33,848 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 86 states. [2019-01-07 21:31:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:35,886 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2019-01-07 21:31:35,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-07 21:31:35,887 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 205 [2019-01-07 21:31:35,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:35,888 INFO L225 Difference]: With dead ends: 215 [2019-01-07 21:31:35,888 INFO L226 Difference]: Without dead ends: 214 [2019-01-07 21:31:35,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 324 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8686 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=11492, Invalid=17238, Unknown=0, NotChecked=0, Total=28730 [2019-01-07 21:31:35,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-01-07 21:31:35,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2019-01-07 21:31:35,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2019-01-07 21:31:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2019-01-07 21:31:35,927 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2019-01-07 21:31:35,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:35,928 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2019-01-07 21:31:35,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-07 21:31:35,928 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2019-01-07 21:31:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-01-07 21:31:35,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:35,929 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 1, 1] [2019-01-07 21:31:35,929 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:35,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:35,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1218904179, now seen corresponding path program 41 times [2019-01-07 21:31:35,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:35,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:35,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:35,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:35,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:37,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:37,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:37,591 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:37,591 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:37,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:37,592 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-01-07 21:31:37,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:31:37,602 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:31:38,074 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-01-07 21:31:38,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:38,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:38,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-01-07 21:31:38,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:38,115 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:31:38,116 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:39,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:39,366 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4264 backedges. 0 proven. 4264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:41,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:41,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2019-01-07 21:31:41,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:41,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-07 21:31:41,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-07 21:31:41,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7275, Invalid=9755, Unknown=0, NotChecked=0, Total=17030 [2019-01-07 21:31:41,855 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 88 states. [2019-01-07 21:31:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:44,176 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2019-01-07 21:31:44,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-07 21:31:44,176 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 210 [2019-01-07 21:31:44,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:44,177 INFO L225 Difference]: With dead ends: 220 [2019-01-07 21:31:44,177 INFO L226 Difference]: Without dead ends: 219 [2019-01-07 21:31:44,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 504 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=12045, Invalid=18057, Unknown=0, NotChecked=0, Total=30102 [2019-01-07 21:31:44,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2019-01-07 21:31:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2019-01-07 21:31:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-01-07 21:31:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2019-01-07 21:31:44,233 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2019-01-07 21:31:44,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:44,233 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2019-01-07 21:31:44,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-07 21:31:44,233 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2019-01-07 21:31:44,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-01-07 21:31:44,234 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:44,234 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 42, 42, 1, 1] [2019-01-07 21:31:44,234 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:44,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:44,234 INFO L82 PathProgramCache]: Analyzing trace with hash -826748029, now seen corresponding path program 42 times [2019-01-07 21:31:44,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:44,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:44,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:44,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:44,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:45,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:45,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:45,439 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:45,439 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:45,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:45,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:45,439 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-01-07 21:31:45,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:31:45,450 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:31:45,592 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:31:45,592 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:31:45,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:45,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-01-07 21:31:45,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:45,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:31:45,620 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:46,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:46,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4473 backedges. 0 proven. 4473 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:49,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:49,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2019-01-07 21:31:49,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:49,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-07 21:31:49,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-07 21:31:49,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7620, Invalid=10202, Unknown=0, NotChecked=0, Total=17822 [2019-01-07 21:31:49,863 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 90 states. [2019-01-07 21:31:52,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:31:52,014 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2019-01-07 21:31:52,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-07 21:31:52,014 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 215 [2019-01-07 21:31:52,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:31:52,015 INFO L225 Difference]: With dead ends: 225 [2019-01-07 21:31:52,015 INFO L226 Difference]: Without dead ends: 224 [2019-01-07 21:31:52,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9540 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=12611, Invalid=18895, Unknown=0, NotChecked=0, Total=31506 [2019-01-07 21:31:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-01-07 21:31:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2019-01-07 21:31:52,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-01-07 21:31:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2019-01-07 21:31:52,058 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2019-01-07 21:31:52,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:31:52,058 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2019-01-07 21:31:52,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-07 21:31:52,058 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2019-01-07 21:31:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-01-07 21:31:52,059 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:31:52,059 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 1, 1] [2019-01-07 21:31:52,059 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:31:52,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:31:52,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1793037709, now seen corresponding path program 43 times [2019-01-07 21:31:52,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:31:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:52,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:31:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:31:52,060 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:31:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:53,648 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:53,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:53,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:31:53,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:31:53,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:31:53,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:31:53,649 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-01-07 21:31:53,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:31:53,680 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:31:53,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:31:53,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:31:53,832 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-01-07 21:31:53,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:31:53,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:31:53,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:31:55,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:55,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:31:58,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4687 backedges. 0 proven. 4687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:31:58,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:31:58,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2019-01-07 21:31:58,081 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:31:58,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-07 21:31:58,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-07 21:31:58,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7973, Invalid=10659, Unknown=0, NotChecked=0, Total=18632 [2019-01-07 21:31:58,083 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 92 states. [2019-01-07 21:32:00,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:00,545 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2019-01-07 21:32:00,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-07 21:32:00,545 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 220 [2019-01-07 21:32:00,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:00,546 INFO L225 Difference]: With dead ends: 230 [2019-01-07 21:32:00,546 INFO L226 Difference]: Without dead ends: 229 [2019-01-07 21:32:00,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 348 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9982 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=13190, Invalid=19752, Unknown=0, NotChecked=0, Total=32942 [2019-01-07 21:32:00,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-01-07 21:32:00,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-01-07 21:32:00,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-01-07 21:32:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2019-01-07 21:32:00,600 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2019-01-07 21:32:00,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:00,600 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2019-01-07 21:32:00,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-07 21:32:00,601 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2019-01-07 21:32:00,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-01-07 21:32:00,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:00,602 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 1, 1] [2019-01-07 21:32:00,602 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:00,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:00,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1200728451, now seen corresponding path program 44 times [2019-01-07 21:32:00,603 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:00,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:00,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:00,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:00,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:01,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:01,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:01,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:01,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:01,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:01,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:01,948 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-01-07 21:32:01,959 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:32:01,960 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:32:02,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-01-07 21:32:02,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:02,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:02,299 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-01-07 21:32:02,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32:02,307 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:32:02,307 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:03,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4906 backedges. 0 proven. 4906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:07,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:07,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2019-01-07 21:32:07,136 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:07,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-07 21:32:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-07 21:32:07,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8334, Invalid=11126, Unknown=0, NotChecked=0, Total=19460 [2019-01-07 21:32:07,139 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 94 states. [2019-01-07 21:32:09,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:09,820 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2019-01-07 21:32:09,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-07 21:32:09,821 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 225 [2019-01-07 21:32:09,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:09,822 INFO L225 Difference]: With dead ends: 235 [2019-01-07 21:32:09,822 INFO L226 Difference]: Without dead ends: 234 [2019-01-07 21:32:09,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 540 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10434 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=13782, Invalid=20628, Unknown=0, NotChecked=0, Total=34410 [2019-01-07 21:32:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-01-07 21:32:09,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2019-01-07 21:32:09,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2019-01-07 21:32:09,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2019-01-07 21:32:09,884 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2019-01-07 21:32:09,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:09,885 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2019-01-07 21:32:09,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-07 21:32:09,885 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2019-01-07 21:32:09,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-01-07 21:32:09,886 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:09,886 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 1, 1] [2019-01-07 21:32:09,887 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:09,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:09,887 INFO L82 PathProgramCache]: Analyzing trace with hash 274551923, now seen corresponding path program 45 times [2019-01-07 21:32:09,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:09,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:09,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:09,888 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:11,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:11,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:11,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:11,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:11,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:11,305 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-01-07 21:32:11,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:32:11,314 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:32:11,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:32:11,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:11,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:11,487 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-01-07 21:32:11,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32:11,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:32:11,495 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:13,088 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:13,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:16,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5130 backedges. 0 proven. 5130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:16,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:16,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2019-01-07 21:32:16,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:16,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-07 21:32:16,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-07 21:32:16,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8703, Invalid=11603, Unknown=0, NotChecked=0, Total=20306 [2019-01-07 21:32:16,107 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 96 states. [2019-01-07 21:32:18,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:18,920 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2019-01-07 21:32:18,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-07 21:32:18,920 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 230 [2019-01-07 21:32:18,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:18,921 INFO L225 Difference]: With dead ends: 240 [2019-01-07 21:32:18,922 INFO L226 Difference]: Without dead ends: 239 [2019-01-07 21:32:18,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10896 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=14387, Invalid=21523, Unknown=0, NotChecked=0, Total=35910 [2019-01-07 21:32:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-01-07 21:32:18,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-01-07 21:32:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-01-07 21:32:18,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2019-01-07 21:32:18,989 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2019-01-07 21:32:18,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:18,990 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2019-01-07 21:32:18,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-07 21:32:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2019-01-07 21:32:18,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-07 21:32:18,991 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:18,991 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 46, 46, 1, 1] [2019-01-07 21:32:18,991 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:18,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:18,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1076428925, now seen corresponding path program 46 times [2019-01-07 21:32:18,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:18,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:18,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:18,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:18,993 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:20,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:20,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:20,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:20,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:20,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:20,327 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-01-07 21:32:20,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:20,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:32:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:20,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:20,516 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-01-07 21:32:20,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32:20,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:32:20,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:22,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:25,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5359 backedges. 0 proven. 5359 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:25,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:25,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2019-01-07 21:32:25,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:25,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-07 21:32:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-07 21:32:25,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9080, Invalid=12090, Unknown=0, NotChecked=0, Total=21170 [2019-01-07 21:32:25,647 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 98 states. [2019-01-07 21:32:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:28,587 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2019-01-07 21:32:28,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-07 21:32:28,588 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 235 [2019-01-07 21:32:28,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:28,589 INFO L225 Difference]: With dead ends: 245 [2019-01-07 21:32:28,589 INFO L226 Difference]: Without dead ends: 244 [2019-01-07 21:32:28,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 372 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11368 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=15005, Invalid=22437, Unknown=0, NotChecked=0, Total=37442 [2019-01-07 21:32:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-01-07 21:32:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2019-01-07 21:32:28,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-01-07 21:32:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2019-01-07 21:32:28,639 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2019-01-07 21:32:28,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:28,639 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2019-01-07 21:32:28,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-07 21:32:28,639 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2019-01-07 21:32:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-01-07 21:32:28,640 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:28,640 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 1, 1] [2019-01-07 21:32:28,640 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:28,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:28,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1140998541, now seen corresponding path program 47 times [2019-01-07 21:32:28,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:28,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:28,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:28,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:28,641 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:29,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:29,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:29,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:29,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:29,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:29,964 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-01-07 21:32:29,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:32:29,972 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:32:30,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-01-07 21:32:30,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:30,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:30,318 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-01-07 21:32:30,318 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32:30,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:32:30,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:31,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:35,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5593 backedges. 0 proven. 5593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:35,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:35,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2019-01-07 21:32:35,442 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:35,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-07 21:32:35,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-07 21:32:35,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9465, Invalid=12587, Unknown=0, NotChecked=0, Total=22052 [2019-01-07 21:32:35,444 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 100 states. [2019-01-07 21:32:36,907 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-07 21:32:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:38,599 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2019-01-07 21:32:38,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-07 21:32:38,600 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 240 [2019-01-07 21:32:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:38,601 INFO L225 Difference]: With dead ends: 250 [2019-01-07 21:32:38,601 INFO L226 Difference]: Without dead ends: 249 [2019-01-07 21:32:38,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 380 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11850 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=15636, Invalid=23370, Unknown=0, NotChecked=0, Total=39006 [2019-01-07 21:32:38,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-01-07 21:32:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2019-01-07 21:32:38,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-01-07 21:32:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2019-01-07 21:32:38,713 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2019-01-07 21:32:38,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:38,713 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2019-01-07 21:32:38,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-07 21:32:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2019-01-07 21:32:38,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-01-07 21:32:38,714 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:38,715 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 48, 48, 1, 1] [2019-01-07 21:32:38,715 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:38,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:38,715 INFO L82 PathProgramCache]: Analyzing trace with hash 971560323, now seen corresponding path program 48 times [2019-01-07 21:32:38,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:38,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:38,716 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:38,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:38,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:40,039 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:40,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:40,039 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:40,039 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:40,039 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:40,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:40,040 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-01-07 21:32:40,049 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:32:40,049 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:32:40,223 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:32:40,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:32:40,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:40,236 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-01-07 21:32:40,236 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32:40,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:32:40,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:41,860 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:41,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:45,568 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 0 proven. 5832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:45,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:45,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2019-01-07 21:32:45,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:45,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-07 21:32:45,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-07 21:32:45,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9858, Invalid=13094, Unknown=0, NotChecked=0, Total=22952 [2019-01-07 21:32:45,591 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 102 states. [2019-01-07 21:32:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:48,383 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2019-01-07 21:32:48,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-07 21:32:48,383 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 245 [2019-01-07 21:32:48,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:48,385 INFO L225 Difference]: With dead ends: 255 [2019-01-07 21:32:48,385 INFO L226 Difference]: Without dead ends: 254 [2019-01-07 21:32:48,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 588 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12342 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=16280, Invalid=24322, Unknown=0, NotChecked=0, Total=40602 [2019-01-07 21:32:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2019-01-07 21:32:48,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2019-01-07 21:32:48,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2019-01-07 21:32:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2019-01-07 21:32:48,450 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2019-01-07 21:32:48,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:48,450 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2019-01-07 21:32:48,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-07 21:32:48,450 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2019-01-07 21:32:48,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-01-07 21:32:48,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:48,452 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 1, 1] [2019-01-07 21:32:48,452 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:48,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash 295807091, now seen corresponding path program 49 times [2019-01-07 21:32:48,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:48,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:32:48,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:48,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:50,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:50,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:32:50,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:32:50,196 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:32:50,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:32:50,196 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-01-07 21:32:50,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:50,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:32:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:32:50,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:32:50,380 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-01-07 21:32:50,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:32:50,393 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:32:50,394 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:32:52,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:52,063 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:32:55,943 INFO L134 CoverageAnalysis]: Checked inductivity of 6076 backedges. 0 proven. 6076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:32:55,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:32:55,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2019-01-07 21:32:55,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:32:55,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-07 21:32:55,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-07 21:32:55,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10259, Invalid=13611, Unknown=0, NotChecked=0, Total=23870 [2019-01-07 21:32:55,966 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 104 states. [2019-01-07 21:32:58,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:32:58,710 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-01-07 21:32:58,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-07 21:32:58,711 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 250 [2019-01-07 21:32:58,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:32:58,712 INFO L225 Difference]: With dead ends: 260 [2019-01-07 21:32:58,712 INFO L226 Difference]: Without dead ends: 259 [2019-01-07 21:32:58,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12844 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=16937, Invalid=25293, Unknown=0, NotChecked=0, Total=42230 [2019-01-07 21:32:58,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-01-07 21:32:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2019-01-07 21:32:58,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-01-07 21:32:58,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2019-01-07 21:32:58,783 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2019-01-07 21:32:58,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:32:58,783 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2019-01-07 21:32:58,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-07 21:32:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2019-01-07 21:32:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-01-07 21:32:58,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:32:58,785 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 50, 50, 1, 1] [2019-01-07 21:32:58,785 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:32:58,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:32:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1076308867, now seen corresponding path program 50 times [2019-01-07 21:32:58,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:32:58,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:58,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:32:58,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:32:58,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:32:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:00,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:00,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:00,379 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:00,379 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:00,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:00,379 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-01-07 21:33:00,431 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:33:00,431 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:33:00,796 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-01-07 21:33:00,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:33:00,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:00,809 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-01-07 21:33:00,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:00,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:00,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:02,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:06,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6325 backedges. 0 proven. 6325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:06,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:06,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 154 [2019-01-07 21:33:06,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:06,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-07 21:33:06,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-07 21:33:06,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10361, Invalid=13819, Unknown=0, NotChecked=0, Total=24180 [2019-01-07 21:33:06,349 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 106 states. [2019-01-07 21:33:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:09,280 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2019-01-07 21:33:09,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-07 21:33:09,281 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 255 [2019-01-07 21:33:09,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:09,282 INFO L225 Difference]: With dead ends: 265 [2019-01-07 21:33:09,282 INFO L226 Difference]: Without dead ends: 264 [2019-01-07 21:33:09,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 404 SyntacticMatches, 2 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13447 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=17196, Invalid=25860, Unknown=0, NotChecked=0, Total=43056 [2019-01-07 21:33:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-01-07 21:33:09,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2019-01-07 21:33:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2019-01-07 21:33:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2019-01-07 21:33:09,339 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2019-01-07 21:33:09,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:09,339 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2019-01-07 21:33:09,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-07 21:33:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2019-01-07 21:33:09,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-01-07 21:33:09,341 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:09,341 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 1, 1] [2019-01-07 21:33:09,341 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:33:09,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:09,341 INFO L82 PathProgramCache]: Analyzing trace with hash 48829043, now seen corresponding path program 51 times [2019-01-07 21:33:09,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:09,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:09,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:33:09,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:09,343 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:10,852 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:10,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:10,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:10,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:10,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:10,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:10,853 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-01-07 21:33:10,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:33:10,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:33:11,040 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:33:11,040 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:33:11,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:11,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-01-07 21:33:11,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:11,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:11,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:12,934 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:12,934 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6579 backedges. 0 proven. 6579 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:16,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:16,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 155 [2019-01-07 21:33:16,813 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:16,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-07 21:33:16,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-07 21:33:16,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10463, Invalid=14029, Unknown=0, NotChecked=0, Total=24492 [2019-01-07 21:33:16,816 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 108 states. [2019-01-07 21:33:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:19,947 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2019-01-07 21:33:19,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-07 21:33:19,947 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 260 [2019-01-07 21:33:19,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:19,948 INFO L225 Difference]: With dead ends: 270 [2019-01-07 21:33:19,948 INFO L226 Difference]: Without dead ends: 269 [2019-01-07 21:33:19,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 412 SyntacticMatches, 4 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14052 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=17456, Invalid=26434, Unknown=0, NotChecked=0, Total=43890 [2019-01-07 21:33:19,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-01-07 21:33:20,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2019-01-07 21:33:20,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-07 21:33:20,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2019-01-07 21:33:20,014 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2019-01-07 21:33:20,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:20,014 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2019-01-07 21:33:20,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-07 21:33:20,014 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2019-01-07 21:33:20,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-01-07 21:33:20,015 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:20,016 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 52, 52, 1, 1] [2019-01-07 21:33:20,016 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:33:20,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:20,016 INFO L82 PathProgramCache]: Analyzing trace with hash -453901949, now seen corresponding path program 52 times [2019-01-07 21:33:20,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:20,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:20,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:33:20,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:20,017 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:20,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:21,534 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:21,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:21,534 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:21,534 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:21,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:21,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:21,535 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-01-07 21:33:21,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:21,547 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:21,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:21,726 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-01-07 21:33:21,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:21,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-01-07 21:33:21,735 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:23,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:23,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6838 backedges. 0 proven. 6838 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:27,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:27,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 156 [2019-01-07 21:33:27,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:27,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-07 21:33:27,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-07 21:33:27,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10565, Invalid=14241, Unknown=0, NotChecked=0, Total=24806 [2019-01-07 21:33:27,398 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 110 states. [2019-01-07 21:33:30,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:30,519 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2019-01-07 21:33:30,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-07 21:33:30,519 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 265 [2019-01-07 21:33:30,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:30,520 INFO L225 Difference]: With dead ends: 275 [2019-01-07 21:33:30,520 INFO L226 Difference]: Without dead ends: 274 [2019-01-07 21:33:30,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 636 GetRequests, 420 SyntacticMatches, 6 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14659 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=17717, Invalid=27015, Unknown=0, NotChecked=0, Total=44732 [2019-01-07 21:33:30,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-01-07 21:33:30,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2019-01-07 21:33:30,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-01-07 21:33:30,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2019-01-07 21:33:30,602 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 265 [2019-01-07 21:33:30,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:30,602 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2019-01-07 21:33:30,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-07 21:33:30,602 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2019-01-07 21:33:30,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-01-07 21:33:30,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:30,604 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 1, 1] [2019-01-07 21:33:30,604 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:33:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:30,605 INFO L82 PathProgramCache]: Analyzing trace with hash -109839245, now seen corresponding path program 53 times [2019-01-07 21:33:30,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:30,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:30,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:30,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:30,606 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:32,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:32,339 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:32,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:32,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:32,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:32,339 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-01-07 21:33:32,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:33:32,350 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:33:32,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-01-07 21:33:32,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:33:32,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:32,785 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-01-07 21:33:32,785 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:32,794 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:32,794 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:34,719 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:34,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:38,608 INFO L134 CoverageAnalysis]: Checked inductivity of 7102 backedges. 0 proven. 7102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:38,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:38,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 157 [2019-01-07 21:33:38,628 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:38,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-07 21:33:38,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-07 21:33:38,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10667, Invalid=14455, Unknown=0, NotChecked=0, Total=25122 [2019-01-07 21:33:38,630 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 112 states. [2019-01-07 21:33:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:41,883 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2019-01-07 21:33:41,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-07 21:33:41,884 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 270 [2019-01-07 21:33:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:41,885 INFO L225 Difference]: With dead ends: 280 [2019-01-07 21:33:41,885 INFO L226 Difference]: Without dead ends: 279 [2019-01-07 21:33:41,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 428 SyntacticMatches, 8 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15268 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=17979, Invalid=27603, Unknown=0, NotChecked=0, Total=45582 [2019-01-07 21:33:41,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2019-01-07 21:33:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 276. [2019-01-07 21:33:41,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2019-01-07 21:33:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2019-01-07 21:33:41,952 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 270 [2019-01-07 21:33:41,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:41,953 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2019-01-07 21:33:41,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-07 21:33:41,953 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2019-01-07 21:33:41,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2019-01-07 21:33:41,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:41,954 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 1, 1] [2019-01-07 21:33:41,954 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:33:41,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:41,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1029089405, now seen corresponding path program 54 times [2019-01-07 21:33:41,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:41,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:41,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:33:41,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:41,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:42,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:43,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:43,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:43,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:43,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:43,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:43,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:43,530 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-01-07 21:33:43,538 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:33:43,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:33:43,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:33:43,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:33:43,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:43,773 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-01-07 21:33:43,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:43,784 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:43,784 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:45,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:33:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 7371 backedges. 0 proven. 7371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:49,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:33:49,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 158 [2019-01-07 21:33:49,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:33:49,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2019-01-07 21:33:49,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2019-01-07 21:33:49,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10769, Invalid=14671, Unknown=0, NotChecked=0, Total=25440 [2019-01-07 21:33:49,835 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 114 states. [2019-01-07 21:33:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:33:53,128 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2019-01-07 21:33:53,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-07 21:33:53,129 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 275 [2019-01-07 21:33:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:33:53,130 INFO L225 Difference]: With dead ends: 285 [2019-01-07 21:33:53,130 INFO L226 Difference]: Without dead ends: 284 [2019-01-07 21:33:53,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 436 SyntacticMatches, 10 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15879 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=18242, Invalid=28198, Unknown=0, NotChecked=0, Total=46440 [2019-01-07 21:33:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-01-07 21:33:53,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 281. [2019-01-07 21:33:53,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2019-01-07 21:33:53,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2019-01-07 21:33:53,190 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 275 [2019-01-07 21:33:53,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:33:53,190 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2019-01-07 21:33:53,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2019-01-07 21:33:53,190 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2019-01-07 21:33:53,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-01-07 21:33:53,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:33:53,191 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 1, 1] [2019-01-07 21:33:53,191 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:33:53,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:33:53,192 INFO L82 PathProgramCache]: Analyzing trace with hash -689805709, now seen corresponding path program 55 times [2019-01-07 21:33:53,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:33:53,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:53,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:33:53,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:33:53,193 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:33:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:55,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:55,054 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:33:55,054 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:33:55,054 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:33:55,054 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:33:55,054 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-01-07 21:33:55,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:33:55,063 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:33:55,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:33:55,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:33:55,261 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-01-07 21:33:55,261 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:33:55,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:33:55,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:33:57,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:33:57,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 7645 backedges. 0 proven. 7645 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:01,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:01,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 159 [2019-01-07 21:34:01,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:01,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2019-01-07 21:34:01,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2019-01-07 21:34:01,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10871, Invalid=14889, Unknown=0, NotChecked=0, Total=25760 [2019-01-07 21:34:01,517 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 116 states. [2019-01-07 21:34:04,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:04,728 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2019-01-07 21:34:04,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-07 21:34:04,729 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 280 [2019-01-07 21:34:04,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:04,730 INFO L225 Difference]: With dead ends: 290 [2019-01-07 21:34:04,730 INFO L226 Difference]: Without dead ends: 289 [2019-01-07 21:34:04,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 444 SyntacticMatches, 12 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16492 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=18506, Invalid=28800, Unknown=0, NotChecked=0, Total=47306 [2019-01-07 21:34:04,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-01-07 21:34:04,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2019-01-07 21:34:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-01-07 21:34:04,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2019-01-07 21:34:04,794 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 280 [2019-01-07 21:34:04,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:04,795 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2019-01-07 21:34:04,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2019-01-07 21:34:04,795 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2019-01-07 21:34:04,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-01-07 21:34:04,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:04,796 INFO L402 BasicCegarLoop]: trace histogram [57, 57, 57, 56, 56, 1, 1] [2019-01-07 21:34:04,796 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:34:04,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:04,796 INFO L82 PathProgramCache]: Analyzing trace with hash -72536701, now seen corresponding path program 56 times [2019-01-07 21:34:04,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:04,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:04,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:04,797 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:04,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:06,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:06,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:06,817 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:06,817 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:06,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:06,817 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-01-07 21:34:06,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:06,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:07,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-01-07 21:34:07,297 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:07,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:07,310 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-01-07 21:34:07,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:07,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:07,322 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:34:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:09,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7924 backedges. 0 proven. 7924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:13,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:13,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 160 [2019-01-07 21:34:13,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:13,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-07 21:34:13,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-07 21:34:13,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10973, Invalid=15109, Unknown=0, NotChecked=0, Total=26082 [2019-01-07 21:34:13,610 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 118 states. [2019-01-07 21:34:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:17,104 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2019-01-07 21:34:17,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-07 21:34:17,105 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 285 [2019-01-07 21:34:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:17,106 INFO L225 Difference]: With dead ends: 295 [2019-01-07 21:34:17,106 INFO L226 Difference]: Without dead ends: 294 [2019-01-07 21:34:17,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 452 SyntacticMatches, 14 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17107 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=18771, Invalid=29409, Unknown=0, NotChecked=0, Total=48180 [2019-01-07 21:34:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-01-07 21:34:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 291. [2019-01-07 21:34:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-01-07 21:34:17,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2019-01-07 21:34:17,180 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 285 [2019-01-07 21:34:17,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:17,180 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2019-01-07 21:34:17,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-07 21:34:17,181 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2019-01-07 21:34:17,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-01-07 21:34:17,182 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:17,182 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 1, 1] [2019-01-07 21:34:17,182 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:34:17,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:17,182 INFO L82 PathProgramCache]: Analyzing trace with hash -187412365, now seen corresponding path program 57 times [2019-01-07 21:34:17,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:17,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:17,183 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:17,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:17,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:17,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:19,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:19,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:19,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:19,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:19,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:19,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:19,034 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-01-07 21:34:19,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:34:19,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:34:19,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:34:19,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:19,246 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:19,248 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-01-07 21:34:19,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:19,262 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:19,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:34:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:21,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:25,505 INFO L134 CoverageAnalysis]: Checked inductivity of 8208 backedges. 0 proven. 8208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:25,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:25,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 161 [2019-01-07 21:34:25,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:25,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2019-01-07 21:34:25,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2019-01-07 21:34:25,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11075, Invalid=15331, Unknown=0, NotChecked=0, Total=26406 [2019-01-07 21:34:25,527 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 120 states. [2019-01-07 21:34:29,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:29,045 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2019-01-07 21:34:29,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-07 21:34:29,045 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 290 [2019-01-07 21:34:29,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:29,046 INFO L225 Difference]: With dead ends: 300 [2019-01-07 21:34:29,047 INFO L226 Difference]: Without dead ends: 299 [2019-01-07 21:34:29,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 696 GetRequests, 460 SyntacticMatches, 16 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17724 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=19037, Invalid=30025, Unknown=0, NotChecked=0, Total=49062 [2019-01-07 21:34:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-01-07 21:34:29,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2019-01-07 21:34:29,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2019-01-07 21:34:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2019-01-07 21:34:29,172 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 290 [2019-01-07 21:34:29,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:29,172 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2019-01-07 21:34:29,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2019-01-07 21:34:29,172 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2019-01-07 21:34:29,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-01-07 21:34:29,173 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:29,174 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 59, 58, 58, 1, 1] [2019-01-07 21:34:29,174 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:34:29,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:29,174 INFO L82 PathProgramCache]: Analyzing trace with hash 979207043, now seen corresponding path program 58 times [2019-01-07 21:34:29,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:29,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:29,175 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:29,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:29,175 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:31,048 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:31,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:31,049 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:31,049 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:31,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:31,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:31,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 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-01-07 21:34:31,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:31,058 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:34:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:31,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:31,256 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-01-07 21:34:31,256 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:31,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:31,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:34:33,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:33,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:37,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8497 backedges. 0 proven. 8497 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:37,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:37,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 162 [2019-01-07 21:34:37,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:37,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2019-01-07 21:34:37,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2019-01-07 21:34:37,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11177, Invalid=15555, Unknown=0, NotChecked=0, Total=26732 [2019-01-07 21:34:37,831 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 122 states. [2019-01-07 21:34:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:41,492 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2019-01-07 21:34:41,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-07 21:34:41,492 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 295 [2019-01-07 21:34:41,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:41,493 INFO L225 Difference]: With dead ends: 305 [2019-01-07 21:34:41,493 INFO L226 Difference]: Without dead ends: 304 [2019-01-07 21:34:41,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 468 SyntacticMatches, 18 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18343 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=19304, Invalid=30648, Unknown=0, NotChecked=0, Total=49952 [2019-01-07 21:34:41,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-01-07 21:34:41,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2019-01-07 21:34:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2019-01-07 21:34:41,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2019-01-07 21:34:41,562 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 295 [2019-01-07 21:34:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:41,562 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2019-01-07 21:34:41,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2019-01-07 21:34:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2019-01-07 21:34:41,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-07 21:34:41,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:41,563 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 1, 1] [2019-01-07 21:34:41,563 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:34:41,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash 619297395, now seen corresponding path program 59 times [2019-01-07 21:34:41,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:41,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:41,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:34:41,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:41,565 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:43,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:43,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:43,520 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:43,520 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:43,520 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:43,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:43,520 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-01-07 21:34:43,528 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:34:43,528 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:34:43,982 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-01-07 21:34:43,982 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:43,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:43,995 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-01-07 21:34:43,995 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:44,007 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:44,008 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:34:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:46,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:34:50,434 INFO L134 CoverageAnalysis]: Checked inductivity of 8791 backedges. 0 proven. 8791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:50,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:34:50,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 163 [2019-01-07 21:34:50,454 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:34:50,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-07 21:34:50,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-07 21:34:50,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11279, Invalid=15781, Unknown=0, NotChecked=0, Total=27060 [2019-01-07 21:34:50,457 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 124 states. [2019-01-07 21:34:54,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:34:54,354 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2019-01-07 21:34:54,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-07 21:34:54,354 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 300 [2019-01-07 21:34:54,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:34:54,355 INFO L225 Difference]: With dead ends: 310 [2019-01-07 21:34:54,355 INFO L226 Difference]: Without dead ends: 309 [2019-01-07 21:34:54,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 720 GetRequests, 476 SyntacticMatches, 20 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18964 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=19572, Invalid=31278, Unknown=0, NotChecked=0, Total=50850 [2019-01-07 21:34:54,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-01-07 21:34:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 306. [2019-01-07 21:34:54,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2019-01-07 21:34:54,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2019-01-07 21:34:54,425 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 300 [2019-01-07 21:34:54,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:34:54,425 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2019-01-07 21:34:54,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-07 21:34:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2019-01-07 21:34:54,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2019-01-07 21:34:54,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:34:54,427 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 61, 60, 60, 1, 1] [2019-01-07 21:34:54,427 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:34:54,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:34:54,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1323673213, now seen corresponding path program 60 times [2019-01-07 21:34:54,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:34:54,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:54,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:34:54,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:34:54,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:34:54,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:34:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:56,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:56,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:34:56,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:34:56,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:34:56,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:34:56,457 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-01-07 21:34:56,466 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:34:56,466 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:34:56,671 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:34:56,671 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:34:56,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:34:56,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-01-07 21:34:56,685 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:34:56,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:34:56,694 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:34:59,209 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:34:59,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:03,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9090 backedges. 0 proven. 9090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:03,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:03,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 164 [2019-01-07 21:35:03,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:03,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2019-01-07 21:35:03,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2019-01-07 21:35:03,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11381, Invalid=16009, Unknown=0, NotChecked=0, Total=27390 [2019-01-07 21:35:03,314 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 126 states. [2019-01-07 21:35:07,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:07,240 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2019-01-07 21:35:07,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-07 21:35:07,240 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 305 [2019-01-07 21:35:07,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:07,242 INFO L225 Difference]: With dead ends: 315 [2019-01-07 21:35:07,242 INFO L226 Difference]: Without dead ends: 314 [2019-01-07 21:35:07,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 732 GetRequests, 484 SyntacticMatches, 22 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19587 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=19841, Invalid=31915, Unknown=0, NotChecked=0, Total=51756 [2019-01-07 21:35:07,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-01-07 21:35:07,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2019-01-07 21:35:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-01-07 21:35:07,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2019-01-07 21:35:07,329 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 305 [2019-01-07 21:35:07,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:07,330 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2019-01-07 21:35:07,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2019-01-07 21:35:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2019-01-07 21:35:07,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-01-07 21:35:07,331 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:07,331 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 1, 1] [2019-01-07 21:35:07,331 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:35:07,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:07,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1329421197, now seen corresponding path program 61 times [2019-01-07 21:35:07,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:07,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:07,332 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:35:07,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:07,333 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:09,396 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:09,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:09,396 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:09,396 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:09,396 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:09,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:09,396 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-01-07 21:35:09,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:35:09,405 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:35:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:09,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:09,611 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-01-07 21:35:09,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:35:09,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:35:09,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:35:12,094 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:12,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 9394 backedges. 0 proven. 9394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:16,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:16,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 165 [2019-01-07 21:35:16,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:16,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2019-01-07 21:35:16,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2019-01-07 21:35:16,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11483, Invalid=16239, Unknown=0, NotChecked=0, Total=27722 [2019-01-07 21:35:16,234 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 128 states. [2019-01-07 21:35:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:20,423 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2019-01-07 21:35:20,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-07 21:35:20,424 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 310 [2019-01-07 21:35:20,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:20,425 INFO L225 Difference]: With dead ends: 320 [2019-01-07 21:35:20,425 INFO L226 Difference]: Without dead ends: 319 [2019-01-07 21:35:20,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 744 GetRequests, 492 SyntacticMatches, 24 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20212 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=20111, Invalid=32559, Unknown=0, NotChecked=0, Total=52670 [2019-01-07 21:35:20,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2019-01-07 21:35:20,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2019-01-07 21:35:20,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-01-07 21:35:20,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2019-01-07 21:35:20,505 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 310 [2019-01-07 21:35:20,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:20,505 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2019-01-07 21:35:20,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2019-01-07 21:35:20,506 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2019-01-07 21:35:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-01-07 21:35:20,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:20,507 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 63, 62, 62, 1, 1] [2019-01-07 21:35:20,508 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:35:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:20,508 INFO L82 PathProgramCache]: Analyzing trace with hash 440643459, now seen corresponding path program 62 times [2019-01-07 21:35:20,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:20,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:20,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:35:20,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:20,509 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:22,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:22,957 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:22,957 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:22,957 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:22,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:22,957 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-01-07 21:35:22,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:35:22,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:35:23,504 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-01-07 21:35:23,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:35:23,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:23,521 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-01-07 21:35:23,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:35:23,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:35:23,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:35:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:26,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:30,338 INFO L134 CoverageAnalysis]: Checked inductivity of 9703 backedges. 0 proven. 9703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:30,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:30,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 166 [2019-01-07 21:35:30,358 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:30,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-07 21:35:30,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-07 21:35:30,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11585, Invalid=16471, Unknown=0, NotChecked=0, Total=28056 [2019-01-07 21:35:30,361 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 130 states. [2019-01-07 21:35:34,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:34,443 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2019-01-07 21:35:34,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-07 21:35:34,444 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 315 [2019-01-07 21:35:34,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:34,445 INFO L225 Difference]: With dead ends: 325 [2019-01-07 21:35:34,445 INFO L226 Difference]: Without dead ends: 324 [2019-01-07 21:35:34,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 756 GetRequests, 500 SyntacticMatches, 26 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20839 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=20382, Invalid=33210, Unknown=0, NotChecked=0, Total=53592 [2019-01-07 21:35:34,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-01-07 21:35:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2019-01-07 21:35:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2019-01-07 21:35:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2019-01-07 21:35:34,529 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 315 [2019-01-07 21:35:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:34,530 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2019-01-07 21:35:34,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-07 21:35:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2019-01-07 21:35:34,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2019-01-07 21:35:34,531 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:34,531 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 1, 1] [2019-01-07 21:35:34,531 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:35:34,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:34,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1509887603, now seen corresponding path program 63 times [2019-01-07 21:35:34,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:34,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:34,532 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:35:34,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:34,532 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:36,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:36,636 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:36,636 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:36,636 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:36,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:36,636 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-01-07 21:35:36,646 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:35:36,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:35:36,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:35:36,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:35:36,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:36,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-01-07 21:35:36,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:35:36,893 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:35:36,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:35:39,865 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:39,865 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 10017 backedges. 0 proven. 10017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:44,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:44,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 167 [2019-01-07 21:35:44,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:44,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-01-07 21:35:44,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-01-07 21:35:44,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11687, Invalid=16705, Unknown=0, NotChecked=0, Total=28392 [2019-01-07 21:35:44,195 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 132 states. [2019-01-07 21:35:48,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:35:48,452 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2019-01-07 21:35:48,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-07 21:35:48,452 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 320 [2019-01-07 21:35:48,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:35:48,453 INFO L225 Difference]: With dead ends: 330 [2019-01-07 21:35:48,453 INFO L226 Difference]: Without dead ends: 329 [2019-01-07 21:35:48,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 768 GetRequests, 508 SyntacticMatches, 28 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21468 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=20654, Invalid=33868, Unknown=0, NotChecked=0, Total=54522 [2019-01-07 21:35:48,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-01-07 21:35:48,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2019-01-07 21:35:48,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-01-07 21:35:48,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2019-01-07 21:35:48,541 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 320 [2019-01-07 21:35:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:35:48,541 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2019-01-07 21:35:48,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-01-07 21:35:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2019-01-07 21:35:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-01-07 21:35:48,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:35:48,542 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 1, 1] [2019-01-07 21:35:48,543 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:35:48,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:35:48,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1204189821, now seen corresponding path program 64 times [2019-01-07 21:35:48,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:35:48,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:48,543 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:35:48,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:35:48,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:35:48,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:50,777 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:50,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:50,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:35:50,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:35:50,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:35:50,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:35:50,778 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-01-07 21:35:50,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:35:50,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:35:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:35:51,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:35:51,013 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-01-07 21:35:51,013 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:35:51,026 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:35:51,026 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:35:53,943 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:53,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:35:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 10336 backedges. 0 proven. 10336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:35:57,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:35:57,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 168 [2019-01-07 21:35:57,965 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:35:57,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2019-01-07 21:35:57,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2019-01-07 21:35:57,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11789, Invalid=16941, Unknown=0, NotChecked=0, Total=28730 [2019-01-07 21:35:57,968 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 134 states. [2019-01-07 21:36:02,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:36:02,365 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2019-01-07 21:36:02,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-07 21:36:02,365 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 325 [2019-01-07 21:36:02,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:36:02,367 INFO L225 Difference]: With dead ends: 335 [2019-01-07 21:36:02,367 INFO L226 Difference]: Without dead ends: 334 [2019-01-07 21:36:02,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 780 GetRequests, 516 SyntacticMatches, 30 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22099 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=20927, Invalid=34533, Unknown=0, NotChecked=0, Total=55460 [2019-01-07 21:36:02,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2019-01-07 21:36:02,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2019-01-07 21:36:02,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-01-07 21:36:02,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2019-01-07 21:36:02,456 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 325 [2019-01-07 21:36:02,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:36:02,456 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2019-01-07 21:36:02,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2019-01-07 21:36:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2019-01-07 21:36:02,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-01-07 21:36:02,458 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:36:02,458 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 1, 1] [2019-01-07 21:36:02,458 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:36:02,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:36:02,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1514076275, now seen corresponding path program 65 times [2019-01-07 21:36:02,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:36:02,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:02,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:36:02,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:02,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:36:02,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:05,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:05,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:05,079 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:36:05,079 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:36:05,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:36:05,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:05,080 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-01-07 21:36:05,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:36:05,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:36:05,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-01-07 21:36:05,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:36:05,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:36:05,650 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-01-07 21:36:05,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:36:05,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:36:05,656 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:36:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:08,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:36:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:12,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:36:12,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 169 [2019-01-07 21:36:12,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:36:12,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-07 21:36:12,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-07 21:36:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11891, Invalid=17179, Unknown=0, NotChecked=0, Total=29070 [2019-01-07 21:36:12,676 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 136 states. [2019-01-07 21:36:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:36:17,214 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2019-01-07 21:36:17,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-07 21:36:17,215 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 330 [2019-01-07 21:36:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:36:17,216 INFO L225 Difference]: With dead ends: 340 [2019-01-07 21:36:17,216 INFO L226 Difference]: Without dead ends: 339 [2019-01-07 21:36:17,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 792 GetRequests, 524 SyntacticMatches, 32 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22732 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=21201, Invalid=35205, Unknown=0, NotChecked=0, Total=56406 [2019-01-07 21:36:17,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2019-01-07 21:36:17,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 336. [2019-01-07 21:36:17,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-01-07 21:36:17,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2019-01-07 21:36:17,307 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 330 [2019-01-07 21:36:17,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:36:17,307 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2019-01-07 21:36:17,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-07 21:36:17,307 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2019-01-07 21:36:17,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-01-07 21:36:17,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:36:17,309 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 1, 1] [2019-01-07 21:36:17,309 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:36:17,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:36:17,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1432083331, now seen corresponding path program 66 times [2019-01-07 21:36:17,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:36:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:17,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:36:17,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:17,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:36:17,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:19,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:19,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:36:19,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:36:19,905 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:36:19,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:19,905 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-01-07 21:36:19,914 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:36:19,914 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:36:20,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:36:20,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:36:20,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:36:20,156 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-01-07 21:36:20,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:36:20,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:36:20,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:36:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:23,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:36:27,352 INFO L134 CoverageAnalysis]: Checked inductivity of 10989 backedges. 0 proven. 10989 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:27,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:36:27,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 170 [2019-01-07 21:36:27,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:36:27,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2019-01-07 21:36:27,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2019-01-07 21:36:27,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11993, Invalid=17419, Unknown=0, NotChecked=0, Total=29412 [2019-01-07 21:36:27,376 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 138 states. [2019-01-07 21:36:32,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:36:32,133 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2019-01-07 21:36:32,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-07 21:36:32,134 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 335 [2019-01-07 21:36:32,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:36:32,135 INFO L225 Difference]: With dead ends: 345 [2019-01-07 21:36:32,135 INFO L226 Difference]: Without dead ends: 344 [2019-01-07 21:36:32,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 804 GetRequests, 532 SyntacticMatches, 34 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21476, Invalid=35884, Unknown=0, NotChecked=0, Total=57360 [2019-01-07 21:36:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-01-07 21:36:32,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 341. [2019-01-07 21:36:32,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2019-01-07 21:36:32,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2019-01-07 21:36:32,246 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 335 [2019-01-07 21:36:32,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:36:32,246 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2019-01-07 21:36:32,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2019-01-07 21:36:32,246 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2019-01-07 21:36:32,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2019-01-07 21:36:32,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:36:32,248 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 68, 67, 67, 1, 1] [2019-01-07 21:36:32,248 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:36:32,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:36:32,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1663197811, now seen corresponding path program 67 times [2019-01-07 21:36:32,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:36:32,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:32,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:36:32,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:32,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:36:32,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:34,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:34,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:36:34,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:36:34,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:36:34,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:34,978 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-01-07 21:36:34,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:36:34,986 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:36:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:35,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:36:35,217 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-01-07 21:36:35,218 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:36:35,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:36:35,230 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:36:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:38,120 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:36:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 11323 backedges. 0 proven. 11323 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:42,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:36:42,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 171 [2019-01-07 21:36:42,470 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:36:42,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2019-01-07 21:36:42,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2019-01-07 21:36:42,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12095, Invalid=17661, Unknown=0, NotChecked=0, Total=29756 [2019-01-07 21:36:42,472 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 140 states. [2019-01-07 21:36:47,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:36:47,228 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2019-01-07 21:36:47,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-07 21:36:47,228 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 340 [2019-01-07 21:36:47,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:36:47,229 INFO L225 Difference]: With dead ends: 350 [2019-01-07 21:36:47,229 INFO L226 Difference]: Without dead ends: 349 [2019-01-07 21:36:47,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 816 GetRequests, 540 SyntacticMatches, 36 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24004 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21752, Invalid=36570, Unknown=0, NotChecked=0, Total=58322 [2019-01-07 21:36:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2019-01-07 21:36:47,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 346. [2019-01-07 21:36:47,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-01-07 21:36:47,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2019-01-07 21:36:47,327 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 340 [2019-01-07 21:36:47,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:36:47,328 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2019-01-07 21:36:47,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2019-01-07 21:36:47,328 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2019-01-07 21:36:47,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-01-07 21:36:47,329 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:36:47,329 INFO L402 BasicCegarLoop]: trace histogram [69, 69, 69, 68, 68, 1, 1] [2019-01-07 21:36:47,329 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:36:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:36:47,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1141551491, now seen corresponding path program 68 times [2019-01-07 21:36:47,330 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:36:47,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:47,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:36:47,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:36:47,331 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:36:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:36:49,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:49,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:49,886 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:36:49,886 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:36:49,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:36:49,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:36:49,886 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-01-07 21:36:49,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:36:49,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:36:50,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2019-01-07 21:36:50,473 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:36:50,485 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:36:50,488 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-01-07 21:36:50,489 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:36:50,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:36:50,500 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:36:53,439 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:53,439 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:36:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 11662 backedges. 0 proven. 11662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:36:57,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:36:57,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 172 [2019-01-07 21:36:57,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:36:57,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-07 21:36:57,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-07 21:36:57,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12197, Invalid=17905, Unknown=0, NotChecked=0, Total=30102 [2019-01-07 21:36:57,994 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 142 states. [2019-01-07 21:37:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:02,930 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2019-01-07 21:37:02,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-07 21:37:02,930 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 345 [2019-01-07 21:37:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:02,932 INFO L225 Difference]: With dead ends: 355 [2019-01-07 21:37:02,932 INFO L226 Difference]: Without dead ends: 354 [2019-01-07 21:37:02,933 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 828 GetRequests, 548 SyntacticMatches, 38 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24643 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=22029, Invalid=37263, Unknown=0, NotChecked=0, Total=59292 [2019-01-07 21:37:02,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-01-07 21:37:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2019-01-07 21:37:03,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-01-07 21:37:03,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2019-01-07 21:37:03,023 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 345 [2019-01-07 21:37:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:03,023 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2019-01-07 21:37:03,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-07 21:37:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2019-01-07 21:37:03,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-07 21:37:03,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:03,025 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 70, 69, 69, 1, 1] [2019-01-07 21:37:03,025 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:37:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:03,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1639363469, now seen corresponding path program 69 times [2019-01-07 21:37:03,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:03,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:03,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:37:03,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:03,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:05,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:05,782 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:05,782 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:05,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:05,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:05,783 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-01-07 21:37:05,791 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:37:05,791 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:37:06,028 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:37:06,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:06,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:06,059 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-01-07 21:37:06,060 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:06,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:06,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:37:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:09,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:13,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:13,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 173 [2019-01-07 21:37:13,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:13,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2019-01-07 21:37:13,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2019-01-07 21:37:13,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12299, Invalid=18151, Unknown=0, NotChecked=0, Total=30450 [2019-01-07 21:37:13,899 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 144 states. [2019-01-07 21:37:18,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:18,869 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2019-01-07 21:37:18,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-07 21:37:18,869 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 350 [2019-01-07 21:37:18,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:18,871 INFO L225 Difference]: With dead ends: 360 [2019-01-07 21:37:18,871 INFO L226 Difference]: Without dead ends: 359 [2019-01-07 21:37:18,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 840 GetRequests, 556 SyntacticMatches, 40 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=22307, Invalid=37963, Unknown=0, NotChecked=0, Total=60270 [2019-01-07 21:37:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2019-01-07 21:37:18,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2019-01-07 21:37:18,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-01-07 21:37:18,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2019-01-07 21:37:18,970 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 350 [2019-01-07 21:37:18,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:18,970 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2019-01-07 21:37:18,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2019-01-07 21:37:18,970 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2019-01-07 21:37:18,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-07 21:37:18,971 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:18,972 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 71, 70, 70, 1, 1] [2019-01-07 21:37:18,972 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:37:18,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:18,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1587939203, now seen corresponding path program 70 times [2019-01-07 21:37:18,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:18,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:18,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:37:18,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:18,973 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:19,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:21,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:21,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:21,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:21,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:21,852 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:21,852 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:21,853 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-01-07 21:37:21,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:21,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:37:22,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:22,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:22,100 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-01-07 21:37:22,100 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:22,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:22,108 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:37:25,220 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:25,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 12355 backedges. 0 proven. 12355 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:29,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:29,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 174 [2019-01-07 21:37:29,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:29,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2019-01-07 21:37:29,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2019-01-07 21:37:29,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12401, Invalid=18399, Unknown=0, NotChecked=0, Total=30800 [2019-01-07 21:37:29,505 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 146 states. [2019-01-07 21:37:34,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:34,603 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2019-01-07 21:37:34,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-07 21:37:34,604 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 355 [2019-01-07 21:37:34,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:34,605 INFO L225 Difference]: With dead ends: 365 [2019-01-07 21:37:34,605 INFO L226 Difference]: Without dead ends: 364 [2019-01-07 21:37:34,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 852 GetRequests, 564 SyntacticMatches, 42 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25927 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=22586, Invalid=38670, Unknown=0, NotChecked=0, Total=61256 [2019-01-07 21:37:34,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2019-01-07 21:37:34,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2019-01-07 21:37:34,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2019-01-07 21:37:34,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2019-01-07 21:37:34,711 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 355 [2019-01-07 21:37:34,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:34,712 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2019-01-07 21:37:34,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2019-01-07 21:37:34,712 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2019-01-07 21:37:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2019-01-07 21:37:34,713 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:34,713 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 72, 71, 71, 1, 1] [2019-01-07 21:37:34,713 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:37:34,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:34,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1387022733, now seen corresponding path program 71 times [2019-01-07 21:37:34,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:34,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:34,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:37:34,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:34,715 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:37,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:37,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:37,623 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:37,623 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:37,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:37,623 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-01-07 21:37:37,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:37:37,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:37:38,294 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2019-01-07 21:37:38,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:38,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:38,310 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-01-07 21:37:38,310 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:38,318 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:38,319 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:37:41,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:41,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:37:46,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12709 backedges. 0 proven. 12709 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:46,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:37:46,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 175 [2019-01-07 21:37:46,311 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:37:46,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-07 21:37:46,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-07 21:37:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12503, Invalid=18649, Unknown=0, NotChecked=0, Total=31152 [2019-01-07 21:37:46,313 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 148 states. [2019-01-07 21:37:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:37:51,406 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2019-01-07 21:37:51,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-07 21:37:51,406 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 360 [2019-01-07 21:37:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:37:51,408 INFO L225 Difference]: With dead ends: 370 [2019-01-07 21:37:51,408 INFO L226 Difference]: Without dead ends: 369 [2019-01-07 21:37:51,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 864 GetRequests, 572 SyntacticMatches, 44 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26572 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=22866, Invalid=39384, Unknown=0, NotChecked=0, Total=62250 [2019-01-07 21:37:51,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2019-01-07 21:37:51,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 366. [2019-01-07 21:37:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2019-01-07 21:37:51,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2019-01-07 21:37:51,561 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 360 [2019-01-07 21:37:51,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:37:51,561 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2019-01-07 21:37:51,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-07 21:37:51,562 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2019-01-07 21:37:51,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2019-01-07 21:37:51,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:37:51,563 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 73, 72, 72, 1, 1] [2019-01-07 21:37:51,563 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:37:51,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:37:51,564 INFO L82 PathProgramCache]: Analyzing trace with hash 126737795, now seen corresponding path program 72 times [2019-01-07 21:37:51,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:37:51,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:51,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:37:51,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:37:51,564 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:37:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:37:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:54,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:54,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:37:54,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:37:54,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:37:54,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:37:54,263 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-01-07 21:37:54,271 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:37:54,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:37:54,518 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:37:54,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:37:54,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:37:54,536 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-01-07 21:37:54,536 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:37:54,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:37:54,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:37:58,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:37:58,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:02,548 INFO L134 CoverageAnalysis]: Checked inductivity of 13068 backedges. 0 proven. 13068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:02,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:02,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 176 [2019-01-07 21:38:02,569 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:02,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2019-01-07 21:38:02,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2019-01-07 21:38:02,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12605, Invalid=18901, Unknown=0, NotChecked=0, Total=31506 [2019-01-07 21:38:02,572 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 150 states. [2019-01-07 21:38:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:07,768 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2019-01-07 21:38:07,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-07 21:38:07,769 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 365 [2019-01-07 21:38:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:07,770 INFO L225 Difference]: With dead ends: 375 [2019-01-07 21:38:07,770 INFO L226 Difference]: Without dead ends: 374 [2019-01-07 21:38:07,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 580 SyntacticMatches, 46 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27219 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=23147, Invalid=40105, Unknown=0, NotChecked=0, Total=63252 [2019-01-07 21:38:07,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2019-01-07 21:38:07,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 371. [2019-01-07 21:38:07,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-01-07 21:38:07,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2019-01-07 21:38:07,883 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 365 [2019-01-07 21:38:07,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:07,884 INFO L480 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2019-01-07 21:38:07,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2019-01-07 21:38:07,884 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2019-01-07 21:38:07,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-01-07 21:38:07,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:07,885 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 74, 73, 73, 1, 1] [2019-01-07 21:38:07,886 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:38:07,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:07,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1444831117, now seen corresponding path program 73 times [2019-01-07 21:38:07,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:07,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:07,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:07,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:07,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:07,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:10,683 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:10,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:10,683 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:10,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:10,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:10,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:10,684 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-01-07 21:38:10,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:10,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:38:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:10,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:10,942 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-01-07 21:38:10,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:10,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:10,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:38:14,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:14,513 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:19,039 INFO L134 CoverageAnalysis]: Checked inductivity of 13432 backedges. 0 proven. 13432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:19,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:19,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 177 [2019-01-07 21:38:19,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:19,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2019-01-07 21:38:19,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2019-01-07 21:38:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12707, Invalid=19155, Unknown=0, NotChecked=0, Total=31862 [2019-01-07 21:38:19,062 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 152 states. [2019-01-07 21:38:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:24,458 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2019-01-07 21:38:24,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-07 21:38:24,458 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 370 [2019-01-07 21:38:24,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:24,460 INFO L225 Difference]: With dead ends: 380 [2019-01-07 21:38:24,460 INFO L226 Difference]: Without dead ends: 379 [2019-01-07 21:38:24,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 888 GetRequests, 588 SyntacticMatches, 48 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27868 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23429, Invalid=40833, Unknown=0, NotChecked=0, Total=64262 [2019-01-07 21:38:24,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-01-07 21:38:24,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2019-01-07 21:38:24,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2019-01-07 21:38:24,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2019-01-07 21:38:24,569 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 370 [2019-01-07 21:38:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:24,569 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2019-01-07 21:38:24,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2019-01-07 21:38:24,569 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2019-01-07 21:38:24,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2019-01-07 21:38:24,570 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:24,570 INFO L402 BasicCegarLoop]: trace histogram [75, 75, 75, 74, 74, 1, 1] [2019-01-07 21:38:24,571 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:38:24,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:24,571 INFO L82 PathProgramCache]: Analyzing trace with hash 690107267, now seen corresponding path program 74 times [2019-01-07 21:38:24,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:24,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:38:24,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:24,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:24,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:27,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:27,676 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:27,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:27,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:27,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:27,677 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-01-07 21:38:27,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:38:27,686 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:38:28,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2019-01-07 21:38:28,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:28,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38:28,415 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-01-07 21:38:28,415 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:28,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:38:28,427 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:38:31,807 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:31,807 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:36,208 INFO L134 CoverageAnalysis]: Checked inductivity of 13801 backedges. 0 proven. 13801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:36,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:36,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 178 [2019-01-07 21:38:36,229 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:36,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-07 21:38:36,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-07 21:38:36,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12809, Invalid=19411, Unknown=0, NotChecked=0, Total=32220 [2019-01-07 21:38:36,232 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 154 states. [2019-01-07 21:38:41,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:41,626 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2019-01-07 21:38:41,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-07 21:38:41,627 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 375 [2019-01-07 21:38:41,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:41,628 INFO L225 Difference]: With dead ends: 385 [2019-01-07 21:38:41,628 INFO L226 Difference]: Without dead ends: 384 [2019-01-07 21:38:41,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 900 GetRequests, 596 SyntacticMatches, 50 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28519 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23712, Invalid=41568, Unknown=0, NotChecked=0, Total=65280 [2019-01-07 21:38:41,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2019-01-07 21:38:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 381. [2019-01-07 21:38:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-01-07 21:38:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2019-01-07 21:38:41,739 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 375 [2019-01-07 21:38:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:41,739 INFO L480 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2019-01-07 21:38:41,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-07 21:38:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2019-01-07 21:38:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-01-07 21:38:41,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:41,741 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 76, 75, 75, 1, 1] [2019-01-07 21:38:41,741 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:38:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash 630393459, now seen corresponding path program 75 times [2019-01-07 21:38:41,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:41,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:41,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:41,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:41,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:38:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:44,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:44,882 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:38:44,882 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:38:44,882 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:38:44,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:38:44,882 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-01-07 21:38:44,890 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:38:44,890 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:38:45,149 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:38:45,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:38:45,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:38: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-01-07 21:38:45,177 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:38:45,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-01-07 21:38:45,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:38:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:48,828 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:38:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 14175 backedges. 0 proven. 14175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:38:53,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:38:53,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 179 [2019-01-07 21:38:53,396 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:38:53,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2019-01-07 21:38:53,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2019-01-07 21:38:53,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12911, Invalid=19669, Unknown=0, NotChecked=0, Total=32580 [2019-01-07 21:38:53,399 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 156 states. [2019-01-07 21:38:59,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:38:59,134 INFO L93 Difference]: Finished difference Result 390 states and 390 transitions. [2019-01-07 21:38:59,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-07 21:38:59,135 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 380 [2019-01-07 21:38:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:38:59,136 INFO L225 Difference]: With dead ends: 390 [2019-01-07 21:38:59,136 INFO L226 Difference]: Without dead ends: 389 [2019-01-07 21:38:59,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 912 GetRequests, 604 SyntacticMatches, 52 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29172 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=23996, Invalid=42310, Unknown=0, NotChecked=0, Total=66306 [2019-01-07 21:38:59,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-01-07 21:38:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2019-01-07 21:38:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2019-01-07 21:38:59,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2019-01-07 21:38:59,252 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 380 [2019-01-07 21:38:59,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:38:59,252 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2019-01-07 21:38:59,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2019-01-07 21:38:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2019-01-07 21:38:59,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2019-01-07 21:38:59,254 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:38:59,254 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 1, 1] [2019-01-07 21:38:59,254 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:38:59,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:38:59,254 INFO L82 PathProgramCache]: Analyzing trace with hash 901974403, now seen corresponding path program 76 times [2019-01-07 21:38:59,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:38:59,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:59,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:38:59,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:38:59,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:38:59,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:02,234 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:02,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:02,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:02,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:02,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:02,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:02,234 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-01-07 21:39:02,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:02,242 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:02,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:02,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:02,504 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-01-07 21:39:02,504 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:02,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:02,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:39:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:06,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 14554 backedges. 0 proven. 14554 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:10,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:10,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 180 [2019-01-07 21:39:10,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:10,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2019-01-07 21:39:10,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2019-01-07 21:39:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13013, Invalid=19929, Unknown=0, NotChecked=0, Total=32942 [2019-01-07 21:39:10,949 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 158 states. [2019-01-07 21:39:16,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:16,865 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2019-01-07 21:39:16,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-07 21:39:16,865 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 385 [2019-01-07 21:39:16,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:16,867 INFO L225 Difference]: With dead ends: 395 [2019-01-07 21:39:16,867 INFO L226 Difference]: Without dead ends: 394 [2019-01-07 21:39:16,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 924 GetRequests, 612 SyntacticMatches, 54 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29827 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=24281, Invalid=43059, Unknown=0, NotChecked=0, Total=67340 [2019-01-07 21:39:16,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2019-01-07 21:39:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 391. [2019-01-07 21:39:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-01-07 21:39:16,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 391 transitions. [2019-01-07 21:39:16,995 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 391 transitions. Word has length 385 [2019-01-07 21:39:16,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:16,995 INFO L480 AbstractCegarLoop]: Abstraction has 391 states and 391 transitions. [2019-01-07 21:39:16,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2019-01-07 21:39:16,995 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 391 transitions. [2019-01-07 21:39:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-01-07 21:39:16,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:16,997 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 1, 1] [2019-01-07 21:39:16,997 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:39:16,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:16,998 INFO L82 PathProgramCache]: Analyzing trace with hash 705164403, now seen corresponding path program 77 times [2019-01-07 21:39:16,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:16,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:16,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:16,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:16,998 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:20,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:20,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:20,289 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:20,289 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:20,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:20,289 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-01-07 21:39:20,297 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:39:20,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:39:21,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2019-01-07 21:39:21,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:21,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:21,029 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-01-07 21:39:21,029 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:21,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:21,041 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:39:25,010 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:25,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:29,589 INFO L134 CoverageAnalysis]: Checked inductivity of 14938 backedges. 0 proven. 14938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:29,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:29,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 181 [2019-01-07 21:39:29,610 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:29,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-07 21:39:29,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-07 21:39:29,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13115, Invalid=20191, Unknown=0, NotChecked=0, Total=33306 [2019-01-07 21:39:29,613 INFO L87 Difference]: Start difference. First operand 391 states and 391 transitions. Second operand 160 states. [2019-01-07 21:39:35,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:35,673 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2019-01-07 21:39:35,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-07 21:39:35,674 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 390 [2019-01-07 21:39:35,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:35,675 INFO L225 Difference]: With dead ends: 400 [2019-01-07 21:39:35,675 INFO L226 Difference]: Without dead ends: 399 [2019-01-07 21:39:35,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 936 GetRequests, 620 SyntacticMatches, 56 SemanticMatches, 260 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30484 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=24567, Invalid=43815, Unknown=0, NotChecked=0, Total=68382 [2019-01-07 21:39:35,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-01-07 21:39:35,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 396. [2019-01-07 21:39:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-01-07 21:39:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2019-01-07 21:39:35,860 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 390 [2019-01-07 21:39:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:35,861 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2019-01-07 21:39:35,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-07 21:39:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2019-01-07 21:39:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-01-07 21:39:35,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:35,862 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 1, 1] [2019-01-07 21:39:35,863 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:39:35,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:35,863 INFO L82 PathProgramCache]: Analyzing trace with hash 667967363, now seen corresponding path program 78 times [2019-01-07 21:39:35,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:35,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:35,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:35,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:35,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:35,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:39,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:39,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:39,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:39,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:39,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:39,216 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-01-07 21:39:39,224 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:39:39,224 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:39:39,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:39:39,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:39:39,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:39,511 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-01-07 21:39:39,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:39,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:39,520 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:39:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:43,345 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:39:48,031 INFO L134 CoverageAnalysis]: Checked inductivity of 15327 backedges. 0 proven. 15327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:48,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:39:48,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 182 [2019-01-07 21:39:48,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:39:48,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2019-01-07 21:39:48,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2019-01-07 21:39:48,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13217, Invalid=20455, Unknown=0, NotChecked=0, Total=33672 [2019-01-07 21:39:48,054 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 162 states. [2019-01-07 21:39:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:39:54,212 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2019-01-07 21:39:54,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-07 21:39:54,212 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 395 [2019-01-07 21:39:54,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:39:54,213 INFO L225 Difference]: With dead ends: 405 [2019-01-07 21:39:54,214 INFO L226 Difference]: Without dead ends: 404 [2019-01-07 21:39:54,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 948 GetRequests, 628 SyntacticMatches, 58 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31143 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=24854, Invalid=44578, Unknown=0, NotChecked=0, Total=69432 [2019-01-07 21:39:54,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-01-07 21:39:54,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 401. [2019-01-07 21:39:54,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-01-07 21:39:54,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 401 transitions. [2019-01-07 21:39:54,349 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 401 transitions. Word has length 395 [2019-01-07 21:39:54,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:39:54,349 INFO L480 AbstractCegarLoop]: Abstraction has 401 states and 401 transitions. [2019-01-07 21:39:54,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2019-01-07 21:39:54,350 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 401 transitions. [2019-01-07 21:39:54,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-01-07 21:39:54,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:39:54,351 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 80, 79, 79, 1, 1] [2019-01-07 21:39:54,351 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:39:54,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:39:54,352 INFO L82 PathProgramCache]: Analyzing trace with hash 954228339, now seen corresponding path program 79 times [2019-01-07 21:39:54,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:39:54,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:54,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:39:54,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:39:54,353 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:39:54,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:57,586 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:39:57,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:57,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:39:57,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:39:57,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:39:57,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:39:57,587 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-01-07 21:39:57,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:39:57,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:39:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:39:57,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:39:57,864 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-01-07 21:39:57,864 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:39:57,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:39:57,875 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:40:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:02,046 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:06,578 INFO L134 CoverageAnalysis]: Checked inductivity of 15721 backedges. 0 proven. 15721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:06,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:06,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 183 [2019-01-07 21:40:06,598 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:06,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2019-01-07 21:40:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2019-01-07 21:40:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13319, Invalid=20721, Unknown=0, NotChecked=0, Total=34040 [2019-01-07 21:40:06,600 INFO L87 Difference]: Start difference. First operand 401 states and 401 transitions. Second operand 164 states. [2019-01-07 21:40:12,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:12,679 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2019-01-07 21:40:12,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-07 21:40:12,680 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 400 [2019-01-07 21:40:12,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:12,681 INFO L225 Difference]: With dead ends: 410 [2019-01-07 21:40:12,681 INFO L226 Difference]: Without dead ends: 409 [2019-01-07 21:40:12,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 960 GetRequests, 636 SyntacticMatches, 60 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31804 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=25142, Invalid=45348, Unknown=0, NotChecked=0, Total=70490 [2019-01-07 21:40:12,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2019-01-07 21:40:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 406. [2019-01-07 21:40:12,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2019-01-07 21:40:12,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2019-01-07 21:40:12,873 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 400 [2019-01-07 21:40:12,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:12,873 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2019-01-07 21:40:12,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2019-01-07 21:40:12,873 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2019-01-07 21:40:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2019-01-07 21:40:12,875 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:12,875 INFO L402 BasicCegarLoop]: trace histogram [81, 81, 81, 80, 80, 1, 1] [2019-01-07 21:40:12,875 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:40:12,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:12,875 INFO L82 PathProgramCache]: Analyzing trace with hash -2119551613, now seen corresponding path program 80 times [2019-01-07 21:40:12,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:12,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:12,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:12,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:12,876 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:16,329 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:16,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:16,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:16,330 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:40:16,330 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:40:16,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:16,330 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-01-07 21:40:16,338 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:40:16,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:40:17,128 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2019-01-07 21:40:17,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:40:17,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:17,146 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-01-07 21:40:17,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:17,154 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:17,154 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:40:21,468 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:21,468 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:26,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16120 backedges. 0 proven. 16120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:26,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:26,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 184 [2019-01-07 21:40:26,130 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:26,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-07 21:40:26,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-07 21:40:26,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13421, Invalid=20989, Unknown=0, NotChecked=0, Total=34410 [2019-01-07 21:40:26,133 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 166 states. [2019-01-07 21:40:32,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:32,528 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2019-01-07 21:40:32,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-07 21:40:32,528 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 405 [2019-01-07 21:40:32,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:32,530 INFO L225 Difference]: With dead ends: 415 [2019-01-07 21:40:32,530 INFO L226 Difference]: Without dead ends: 414 [2019-01-07 21:40:32,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 972 GetRequests, 644 SyntacticMatches, 62 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32467 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=25431, Invalid=46125, Unknown=0, NotChecked=0, Total=71556 [2019-01-07 21:40:32,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2019-01-07 21:40:32,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2019-01-07 21:40:32,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-01-07 21:40:32,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2019-01-07 21:40:32,673 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 405 [2019-01-07 21:40:32,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:32,673 INFO L480 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2019-01-07 21:40:32,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-07 21:40:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2019-01-07 21:40:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-01-07 21:40:32,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:32,675 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 82, 81, 81, 1, 1] [2019-01-07 21:40:32,675 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:40:32,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:32,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1270630515, now seen corresponding path program 81 times [2019-01-07 21:40:32,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:32,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:32,676 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:40:32,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:32,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:32,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:36,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:36,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:36,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:40:36,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:40:36,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:36,395 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-01-07 21:40:36,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:40:36,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:40:36,693 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:40:36,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:40:36,709 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:36,711 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-01-07 21:40:36,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:36,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:36,719 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:40:41,087 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:41,087 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:40:45,822 INFO L134 CoverageAnalysis]: Checked inductivity of 16524 backedges. 0 proven. 16524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:45,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:40:45,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 185 [2019-01-07 21:40:45,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:40:45,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2019-01-07 21:40:45,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2019-01-07 21:40:45,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13523, Invalid=21259, Unknown=0, NotChecked=0, Total=34782 [2019-01-07 21:40:45,845 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 168 states. [2019-01-07 21:40:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:40:52,362 INFO L93 Difference]: Finished difference Result 420 states and 420 transitions. [2019-01-07 21:40:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-07 21:40:52,362 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 410 [2019-01-07 21:40:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:40:52,363 INFO L225 Difference]: With dead ends: 420 [2019-01-07 21:40:52,363 INFO L226 Difference]: Without dead ends: 419 [2019-01-07 21:40:52,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 652 SyntacticMatches, 64 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33132 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=25721, Invalid=46909, Unknown=0, NotChecked=0, Total=72630 [2019-01-07 21:40:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2019-01-07 21:40:52,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2019-01-07 21:40:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-01-07 21:40:52,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2019-01-07 21:40:52,509 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 410 [2019-01-07 21:40:52,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:40:52,509 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2019-01-07 21:40:52,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2019-01-07 21:40:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2019-01-07 21:40:52,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-01-07 21:40:52,511 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:40:52,511 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 83, 82, 82, 1, 1] [2019-01-07 21:40:52,511 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:40:52,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:40:52,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1303415683, now seen corresponding path program 82 times [2019-01-07 21:40:52,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:40:52,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:52,513 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:40:52,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:40:52,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:40:52,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:40:56,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:56,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:40:56,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:40:56,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:40:56,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:40:56,226 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-01-07 21:40:56,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:40:56,236 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:40:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:40:56,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:40:56,518 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-01-07 21:40:56,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:40:56,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:40:56,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:41:00,996 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:00,996 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:05,452 INFO L134 CoverageAnalysis]: Checked inductivity of 16933 backedges. 0 proven. 16933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:05,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:05,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 186 [2019-01-07 21:41:05,472 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:05,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2019-01-07 21:41:05,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2019-01-07 21:41:05,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13625, Invalid=21531, Unknown=0, NotChecked=0, Total=35156 [2019-01-07 21:41:05,475 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 170 states. [2019-01-07 21:41:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:12,129 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2019-01-07 21:41:12,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-07 21:41:12,129 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 415 [2019-01-07 21:41:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:12,130 INFO L225 Difference]: With dead ends: 425 [2019-01-07 21:41:12,131 INFO L226 Difference]: Without dead ends: 424 [2019-01-07 21:41:12,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 660 SyntacticMatches, 66 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33799 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=26012, Invalid=47700, Unknown=0, NotChecked=0, Total=73712 [2019-01-07 21:41:12,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-01-07 21:41:12,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 421. [2019-01-07 21:41:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-07 21:41:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 421 transitions. [2019-01-07 21:41:12,278 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 421 transitions. Word has length 415 [2019-01-07 21:41:12,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:12,278 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 421 transitions. [2019-01-07 21:41:12,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2019-01-07 21:41:12,278 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 421 transitions. [2019-01-07 21:41:12,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-01-07 21:41:12,280 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:12,280 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 84, 83, 83, 1, 1] [2019-01-07 21:41:12,281 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:41:12,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:12,281 INFO L82 PathProgramCache]: Analyzing trace with hash -734285197, now seen corresponding path program 83 times [2019-01-07 21:41:12,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:12,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:12,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:12,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:12,282 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:16,418 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:16,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:16,418 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:16,418 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:16,418 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:16,418 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:16,418 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-01-07 21:41:16,427 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-07 21:41:16,427 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-07 21:41:17,299 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2019-01-07 21:41:17,299 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:41:17,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:17,320 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-01-07 21:41:17,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:17,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:17,331 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:41:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:21,944 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:26,702 INFO L134 CoverageAnalysis]: Checked inductivity of 17347 backedges. 0 proven. 17347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:26,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:26,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 187 [2019-01-07 21:41:26,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:26,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2019-01-07 21:41:26,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2019-01-07 21:41:26,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13727, Invalid=21805, Unknown=0, NotChecked=0, Total=35532 [2019-01-07 21:41:26,727 INFO L87 Difference]: Start difference. First operand 421 states and 421 transitions. Second operand 172 states. [2019-01-07 21:41:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:33,571 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2019-01-07 21:41:33,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-07 21:41:33,571 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 420 [2019-01-07 21:41:33,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:33,573 INFO L225 Difference]: With dead ends: 430 [2019-01-07 21:41:33,573 INFO L226 Difference]: Without dead ends: 429 [2019-01-07 21:41:33,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1008 GetRequests, 668 SyntacticMatches, 68 SemanticMatches, 272 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34468 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=26304, Invalid=48498, Unknown=0, NotChecked=0, Total=74802 [2019-01-07 21:41:33,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-01-07 21:41:33,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 426. [2019-01-07 21:41:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-01-07 21:41:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2019-01-07 21:41:33,717 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 420 [2019-01-07 21:41:33,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:33,717 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2019-01-07 21:41:33,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2019-01-07 21:41:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2019-01-07 21:41:33,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2019-01-07 21:41:33,719 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:33,719 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 85, 84, 84, 1, 1] [2019-01-07 21:41:33,720 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:41:33,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:33,720 INFO L82 PathProgramCache]: Analyzing trace with hash 507732355, now seen corresponding path program 84 times [2019-01-07 21:41:33,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:33,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:33,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:41:33,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:33,721 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:33,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:37,546 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:37,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:37,546 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:37,546 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:37,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:37,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:37,547 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-01-07 21:41:37,555 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-07 21:41:37,555 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-07 21:41:37,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-07 21:41:37,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-07 21:41:37,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:37,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-01-07 21:41:37,861 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:37,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-01-07 21:41:42,516 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:42,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-07 21:41:47,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:47,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-07 21:41:47,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 188 [2019-01-07 21:41:47,256 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-07 21:41:47,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2019-01-07 21:41:47,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2019-01-07 21:41:47,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13829, Invalid=22081, Unknown=0, NotChecked=0, Total=35910 [2019-01-07 21:41:47,260 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 174 states. [2019-01-07 21:41:54,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 21:41:54,199 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2019-01-07 21:41:54,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-07 21:41:54,199 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 425 [2019-01-07 21:41:54,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 21:41:54,201 INFO L225 Difference]: With dead ends: 435 [2019-01-07 21:41:54,201 INFO L226 Difference]: Without dead ends: 434 [2019-01-07 21:41:54,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1020 GetRequests, 676 SyntacticMatches, 70 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35139 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=26597, Invalid=49303, Unknown=0, NotChecked=0, Total=75900 [2019-01-07 21:41:54,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2019-01-07 21:41:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2019-01-07 21:41:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2019-01-07 21:41:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2019-01-07 21:41:54,359 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 425 [2019-01-07 21:41:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 21:41:54,359 INFO L480 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2019-01-07 21:41:54,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2019-01-07 21:41:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2019-01-07 21:41:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2019-01-07 21:41:54,361 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 21:41:54,361 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 86, 85, 85, 1, 1] [2019-01-07 21:41:54,361 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONPRE_CONDITIONandASSERT, mainErr1ASSERT_VIOLATIONPRE_CONDITIONandASSERT]=== [2019-01-07 21:41:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 21:41:54,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1140941709, now seen corresponding path program 85 times [2019-01-07 21:41:54,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 21:41:54,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:54,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-07 21:41:54,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 21:41:54,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 21:41:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:58,282 INFO L134 CoverageAnalysis]: Checked inductivity of 18190 backedges. 0 proven. 18190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 21:41:58,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:58,283 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 21:41:58,283 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-07 21:41:58,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-07 21:41:58,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 21:41:58,284 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-01-07 21:41:58,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 21:41:58,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-07 21:41:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 21:41:58,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-07 21:41:58,587 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-01-07 21:41:58,587 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-07 21:41:58,595 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9