java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:49:39,347 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:49:39,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:49:39,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:49:39,372 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:49:39,373 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:49:39,375 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:49:39,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:49:39,381 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:49:39,385 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:49:39,386 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:49:39,386 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:49:39,389 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:49:39,390 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:49:39,393 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:49:39,394 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:49:39,395 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:49:39,405 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:49:39,407 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:49:39,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:49:39,414 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:49:39,415 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:49:39,417 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:49:39,418 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:49:39,418 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:49:39,419 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:49:39,420 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:49:39,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:49:39,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:49:39,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:49:39,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:49:39,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:49:39,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:49:39,430 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:49:39,431 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:49:39,432 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:49:39,432 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:49:39,456 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:49:39,458 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:49:39,458 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:49:39,459 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:49:39,459 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:49:39,459 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:49:39,459 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:49:39,460 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:49:39,460 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:49:39,460 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:49:39,460 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:49:39,460 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:49:39,461 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:49:39,461 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:49:39,461 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:49:39,461 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:49:39,463 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:49:39,463 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:49:39,463 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:49:39,464 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:49:39,464 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:49:39,464 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:49:39,464 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:49:39,464 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:49:39,464 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:49:39,465 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:49:39,465 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:49:39,465 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:49:39,465 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:49:39,465 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:49:39,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:49:39,467 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:49:39,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:49:39,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:49:39,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:49:39,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:49:39,468 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:49:39,468 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:49:39,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:49:39,469 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:49:39,469 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:49:39,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:49:39,519 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:49:39,523 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:49:39,525 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:49:39,525 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:49:39,526 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-12-03 16:49:39,526 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl' [2018-12-03 16:49:39,559 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:49:39,561 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:49:39,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:49:39,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:49:39,562 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:49:39,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:49:39" (1/1) ... [2018-12-03 16:49:39,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:49:39" (1/1) ... [2018-12-03 16:49:39,591 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:49:39,591 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:49:39,591 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:49:39,594 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:49:39,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:49:39,595 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:49:39,595 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:49:39,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:49:39" (1/1) ... [2018-12-03 16:49:39,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:49:39" (1/1) ... [2018-12-03 16:49:39,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:49:39" (1/1) ... [2018-12-03 16:49:39,608 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:49:39" (1/1) ... [2018-12-03 16:49:39,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:49:39" (1/1) ... [2018-12-03 16:49:39,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:49:39" (1/1) ... [2018-12-03 16:49:39,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:49:39" (1/1) ... [2018-12-03 16:49:39,617 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:49:39,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:49:39,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:49:39,618 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:49:39,619 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:49:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:49:39,687 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 16:49:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 16:49:39,687 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 16:49:39,936 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:49:39,936 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:49:39,937 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:49:39 BoogieIcfgContainer [2018-12-03 16:49:39,937 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:49:39,938 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:49:39,938 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:49:39,942 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:49:39,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:49:39" (1/2) ... [2018-12-03 16:49:39,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3508357b and model type BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:49:39, skipping insertion in model container [2018-12-03 16:49:39,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:49:39" (2/2) ... [2018-12-03 16:49:39,946 INFO L112 eAbstractionObserver]: Analyzing ICFG BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl [2018-12-03 16:49:39,957 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:49:39,965 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-03 16:49:39,984 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-03 16:49:40,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:49:40,021 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:49:40,021 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:49:40,021 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:49:40,022 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:49:40,022 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:49:40,022 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:49:40,022 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:49:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-03 16:49:40,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:49:40,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:40,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:49:40,048 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:40,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash 30176, now seen corresponding path program 1 times [2018-12-03 16:49:40,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:40,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:40,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:40,103 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:40,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:49:40,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:49:40,189 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:49:40,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:49:40,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:49:40,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:49:40,212 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 3 states. [2018-12-03 16:49:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:40,330 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2018-12-03 16:49:40,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:49:40,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:49:40,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:40,358 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:49:40,359 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:49:40,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:49:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:49:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:49:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:49:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 16:49:40,410 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 3 [2018-12-03 16:49:40,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:40,411 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 16:49:40,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:49:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 16:49:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:49:40,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:40,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:49:40,412 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:40,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:40,413 INFO L82 PathProgramCache]: Analyzing trace with hash 28755427, now seen corresponding path program 1 times [2018-12-03 16:49:40,413 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:40,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:40,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:40,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:40,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:40,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:40,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:40,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:40,483 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 16:49:40,485 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [12], [13] [2018-12-03 16:49:40,528 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:49:40,528 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:49:40,702 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:49:40,703 INFO L272 AbstractInterpreter]: Visited 5 different actions 11 times. Merged at 2 different actions 4 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:49:40,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:40,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:49:40,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:40,720 INFO L192 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 [2018-12-03 16:49:40,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:40,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:40,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:40,798 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:40,852 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-03 16:49:40,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [3] total 6 [2018-12-03 16:49:40,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:49:40,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:49:40,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:49:40,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:49:40,854 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 3 states. [2018-12-03 16:49:40,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:40,903 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2018-12-03 16:49:40,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:49:40,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2018-12-03 16:49:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:40,904 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:49:40,904 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:49:40,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:49:40,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:49:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-03 16:49:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:49:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2018-12-03 16:49:40,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2018-12-03 16:49:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:40,909 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2018-12-03 16:49:40,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:49:40,909 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2018-12-03 16:49:40,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:49:40,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:40,910 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2018-12-03 16:49:40,910 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:40,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:40,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1863919784, now seen corresponding path program 1 times [2018-12-03 16:49:40,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:40,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:40,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:40,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:40,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:40,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:40,949 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:40,949 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 8 with the following transitions: [2018-12-03 16:49:40,950 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [13] [2018-12-03 16:49:40,951 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:49:40,951 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:49:41,050 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:49:41,050 INFO L272 AbstractInterpreter]: Visited 6 different actions 33 times. Merged at 5 different actions 18 times. Widened at 1 different actions 2 times. Found 7 fixpoints after 3 different actions. Largest state had 0 variables. [2018-12-03 16:49:41,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:41,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:49:41,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:41,068 INFO L192 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 [2018-12-03 16:49:41,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:41,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:41,089 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:41,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:41,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:41,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:41,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:49:41,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:41,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:49:41,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:49:41,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:49:41,173 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 4 states. [2018-12-03 16:49:41,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:41,239 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-12-03 16:49:41,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:49:41,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2018-12-03 16:49:41,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:41,240 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:49:41,240 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:49:41,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:49:41,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:49:41,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:49:41,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:49:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2018-12-03 16:49:41,244 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 7 [2018-12-03 16:49:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:41,245 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2018-12-03 16:49:41,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:49:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2018-12-03 16:49:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:49:41,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:41,246 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1] [2018-12-03 16:49:41,246 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:41,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:41,247 INFO L82 PathProgramCache]: Analyzing trace with hash 223461163, now seen corresponding path program 2 times [2018-12-03 16:49:41,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:41,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:41,248 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:41,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:41,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:41,342 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:41,342 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:41,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:41,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:41,343 INFO L192 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 [2018-12-03 16:49:41,352 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:49:41,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:49:41,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:49:41,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:41,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:41,591 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:41,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:49:41,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:41,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 11 [2018-12-03 16:49:41,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:41,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:49:41,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:49:41,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:49:41,738 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 8 states. [2018-12-03 16:49:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:41,916 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2018-12-03 16:49:41,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:49:41,916 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-03 16:49:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:41,919 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:49:41,919 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:49:41,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:49:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:49:41,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2018-12-03 16:49:41,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:49:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-12-03 16:49:41,925 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 9 [2018-12-03 16:49:41,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:41,926 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-12-03 16:49:41,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:49:41,926 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2018-12-03 16:49:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:49:41,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:41,927 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 1, 1, 1] [2018-12-03 16:49:41,927 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:41,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:41,928 INFO L82 PathProgramCache]: Analyzing trace with hash -2120520776, now seen corresponding path program 3 times [2018-12-03 16:49:41,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:41,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:41,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:41,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:41,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:41,991 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:49:41,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:41,993 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:41,993 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:41,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:41,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:41,994 INFO L192 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 [2018-12-03 16:49:42,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:49:42,005 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:49:42,030 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:49:42,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:42,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:42,038 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:49:42,038 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:42,154 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:49:42,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:42,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:49:42,175 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:42,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:49:42,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:49:42,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:49:42,177 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 6 states. [2018-12-03 16:49:42,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:42,215 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2018-12-03 16:49:42,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:49:42,218 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-12-03 16:49:42,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:42,219 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:49:42,219 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:49:42,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:49:42,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:49:42,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:49:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:49:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-03 16:49:42,224 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 15 [2018-12-03 16:49:42,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:42,225 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-03 16:49:42,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:49:42,225 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2018-12-03 16:49:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:49:42,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:42,226 INFO L402 BasicCegarLoop]: trace histogram [7, 4, 3, 1, 1, 1] [2018-12-03 16:49:42,226 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:42,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:42,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1608699707, now seen corresponding path program 4 times [2018-12-03 16:49:42,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:42,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:42,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:42,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:42,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:42,331 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:49:42,331 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:42,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:42,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:42,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:42,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:42,333 INFO L192 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 [2018-12-03 16:49:42,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:42,344 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:42,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:49:42,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:42,769 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 25 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:49:42,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:42,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:49:42,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:42,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:49:42,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:49:42,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:49:42,791 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand 7 states. [2018-12-03 16:49:42,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:42,832 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-12-03 16:49:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:49:42,832 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 16:49:42,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:42,834 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:49:42,834 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:49:42,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:49:42,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:49:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:49:42,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:49:42,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2018-12-03 16:49:42,841 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2018-12-03 16:49:42,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:42,843 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2018-12-03 16:49:42,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:49:42,843 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2018-12-03 16:49:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:49:42,844 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:42,844 INFO L402 BasicCegarLoop]: trace histogram [8, 5, 3, 1, 1, 1] [2018-12-03 16:49:42,844 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:42,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:42,845 INFO L82 PathProgramCache]: Analyzing trace with hash -908108290, now seen corresponding path program 5 times [2018-12-03 16:49:42,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:42,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:42,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:42,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-03 16:49:42,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:42,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:42,960 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:42,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:42,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:42,961 INFO L192 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 [2018-12-03 16:49:42,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:49:42,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:49:42,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:49:42,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:42,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:49:43,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 35 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-12-03 16:49:43,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:43,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2018-12-03 16:49:43,315 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:43,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:49:43,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:49:43,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:49:43,317 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 12 states. [2018-12-03 16:49:43,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:43,443 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2018-12-03 16:49:43,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:49:43,444 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 19 [2018-12-03 16:49:43,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:43,445 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:49:43,445 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:49:43,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:49:43,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:49:43,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-12-03 16:49:43,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:49:43,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-12-03 16:49:43,451 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2018-12-03 16:49:43,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:43,452 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-12-03 16:49:43,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:49:43,452 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-12-03 16:49:43,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:49:43,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:43,453 INFO L402 BasicCegarLoop]: trace histogram [10, 6, 4, 1, 1, 1] [2018-12-03 16:49:43,453 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:43,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:43,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1220699322, now seen corresponding path program 6 times [2018-12-03 16:49:43,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:43,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:43,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:43,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:43,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:43,586 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:49:43,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:43,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:43,586 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:43,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:43,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:43,587 INFO L192 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 [2018-12-03 16:49:43,604 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:49:43,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:49:43,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:49:43,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:43,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:43,628 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:49:43,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:43,978 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 49 proven. 42 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:49:43,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:43,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:49:43,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:43,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:49:43,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:49:43,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:49:43,999 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 9 states. [2018-12-03 16:49:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:44,047 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2018-12-03 16:49:44,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:49:44,047 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-12-03 16:49:44,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:44,048 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:49:44,048 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:49:44,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:49:44,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:49:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:49:44,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:49:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-12-03 16:49:44,055 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2018-12-03 16:49:44,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:44,055 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-12-03 16:49:44,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:49:44,055 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-12-03 16:49:44,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:49:44,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:44,056 INFO L402 BasicCegarLoop]: trace histogram [11, 7, 4, 1, 1, 1] [2018-12-03 16:49:44,056 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:44,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:44,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1267282999, now seen corresponding path program 7 times [2018-12-03 16:49:44,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:44,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:44,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:44,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:44,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:49:44,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:44,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:44,187 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:44,187 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:44,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:44,187 INFO L192 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 [2018-12-03 16:49:44,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:44,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:44,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:44,217 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:49:44,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:44,415 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:49:44,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:44,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:49:44,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:44,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:49:44,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:49:44,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:49:44,450 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 10 states. [2018-12-03 16:49:44,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:44,539 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-12-03 16:49:44,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:49:44,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2018-12-03 16:49:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:44,541 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:49:44,541 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:49:44,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:49:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:49:44,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 16:49:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:49:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-03 16:49:44,547 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 25 [2018-12-03 16:49:44,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:44,548 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-03 16:49:44,548 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:49:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-03 16:49:44,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:49:44,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:44,548 INFO L402 BasicCegarLoop]: trace histogram [12, 8, 4, 1, 1, 1] [2018-12-03 16:49:44,549 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:44,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:44,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1210443660, now seen corresponding path program 8 times [2018-12-03 16:49:44,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:44,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:44,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:44,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:44,550 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:44,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 63 proven. 72 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 16:49:44,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:44,670 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:44,671 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:44,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:44,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:44,671 INFO L192 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 [2018-12-03 16:49:44,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:49:44,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:49:44,693 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:49:44,693 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:44,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:44,805 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 16:49:44,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:44,984 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 72 proven. 16 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-12-03 16:49:45,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:45,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 21 [2018-12-03 16:49:45,005 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:45,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:49:45,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:49:45,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:49:45,006 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 16 states. [2018-12-03 16:49:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:45,347 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2018-12-03 16:49:45,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:49:45,349 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 27 [2018-12-03 16:49:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:45,350 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:49:45,350 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:49:45,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-12-03 16:49:45,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:49:45,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-03 16:49:45,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:49:45,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2018-12-03 16:49:45,359 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 27 [2018-12-03 16:49:45,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:45,359 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2018-12-03 16:49:45,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:49:45,360 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-12-03 16:49:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:49:45,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:45,361 INFO L402 BasicCegarLoop]: trace histogram [14, 9, 5, 1, 1, 1] [2018-12-03 16:49:45,364 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:45,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:45,365 INFO L82 PathProgramCache]: Analyzing trace with hash -2119432620, now seen corresponding path program 9 times [2018-12-03 16:49:45,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:45,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:45,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:45,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:45,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:45,553 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:49:45,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:45,554 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:45,554 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:45,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:45,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:45,554 INFO L192 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 [2018-12-03 16:49:45,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:49:45,563 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:49:45,601 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:49:45,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:45,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:45,610 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:49:45,611 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:49:45,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:45,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:49:45,802 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:45,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:49:45,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:49:45,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:49:45,804 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand 12 states. [2018-12-03 16:49:45,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:45,876 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-12-03 16:49:45,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:49:45,876 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-03 16:49:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:45,877 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:49:45,878 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:49:45,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:49:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:49:45,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:49:45,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:49:45,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2018-12-03 16:49:45,885 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 31 [2018-12-03 16:49:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:45,885 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2018-12-03 16:49:45,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:49:45,885 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2018-12-03 16:49:45,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:49:45,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:45,887 INFO L402 BasicCegarLoop]: trace histogram [15, 10, 5, 1, 1, 1] [2018-12-03 16:49:45,887 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:45,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:45,887 INFO L82 PathProgramCache]: Analyzing trace with hash -373685289, now seen corresponding path program 10 times [2018-12-03 16:49:45,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:45,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:45,888 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:45,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:45,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:46,036 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:49:46,036 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:46,037 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:46,037 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:46,037 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:46,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:46,037 INFO L192 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 [2018-12-03 16:49:46,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:46,048 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:46,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:46,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:49:46,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 99 proven. 110 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:49:46,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:46,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:49:46,569 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:46,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:49:46,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:49:46,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:49:46,570 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 13 states. [2018-12-03 16:49:46,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:46,618 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-12-03 16:49:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:49:46,619 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-12-03 16:49:46,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:46,620 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:49:46,621 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:49:46,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:49:46,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:49:46,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 16:49:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 16:49:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-12-03 16:49:46,626 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 33 [2018-12-03 16:49:46,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:46,627 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-12-03 16:49:46,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:49:46,627 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-12-03 16:49:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:49:46,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:46,628 INFO L402 BasicCegarLoop]: trace histogram [16, 11, 5, 1, 1, 1] [2018-12-03 16:49:46,628 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:46,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:46,629 INFO L82 PathProgramCache]: Analyzing trace with hash -2042712934, now seen corresponding path program 11 times [2018-12-03 16:49:46,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:46,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:46,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:46,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:46,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:46,793 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 108 proven. 132 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-03 16:49:46,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:46,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:46,793 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:46,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:46,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:46,794 INFO L192 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 [2018-12-03 16:49:46,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:49:46,803 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:49:46,849 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 16:49:46,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:46,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:46,993 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 16:49:46,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:47,101 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 121 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-12-03 16:49:47,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:47,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 26 [2018-12-03 16:49:47,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:47,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:49:47,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:49:47,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:49:47,123 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 20 states. [2018-12-03 16:49:47,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:47,226 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-12-03 16:49:47,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:49:47,227 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 35 [2018-12-03 16:49:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:47,228 INFO L225 Difference]: With dead ends: 58 [2018-12-03 16:49:47,228 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:49:47,229 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:49:47,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:49:47,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-12-03 16:49:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:49:47,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2018-12-03 16:49:47,234 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 35 [2018-12-03 16:49:47,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:47,235 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2018-12-03 16:49:47,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:49:47,235 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2018-12-03 16:49:47,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:49:47,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:47,236 INFO L402 BasicCegarLoop]: trace histogram [18, 12, 6, 1, 1, 1] [2018-12-03 16:49:47,236 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:47,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:47,236 INFO L82 PathProgramCache]: Analyzing trace with hash -168899358, now seen corresponding path program 12 times [2018-12-03 16:49:47,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:47,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:47,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:47,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:47,371 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:49:47,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:47,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:47,371 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:47,371 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:47,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:47,372 INFO L192 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 [2018-12-03 16:49:47,381 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:49:47,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:49:47,426 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:49:47,426 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:47,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:47,436 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:49:47,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 143 proven. 156 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:49:47,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:47,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:49:47,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:47,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:49:47,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:49:47,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:49:47,965 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 15 states. [2018-12-03 16:49:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:48,057 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2018-12-03 16:49:48,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:49:48,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 39 [2018-12-03 16:49:48,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:48,059 INFO L225 Difference]: With dead ends: 61 [2018-12-03 16:49:48,059 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:49:48,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:49:48,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:49:48,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 16:49:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:49:48,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2018-12-03 16:49:48,064 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 39 [2018-12-03 16:49:48,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:48,065 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2018-12-03 16:49:48,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:49:48,065 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-12-03 16:49:48,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:49:48,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:48,066 INFO L402 BasicCegarLoop]: trace histogram [19, 13, 6, 1, 1, 1] [2018-12-03 16:49:48,066 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:48,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:48,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2118871195, now seen corresponding path program 13 times [2018-12-03 16:49:48,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:48,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:48,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:48,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:48,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:48,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:48,343 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:49:48,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:48,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:48,343 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:48,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:48,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:48,344 INFO L192 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 [2018-12-03 16:49:48,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:48,353 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:48,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:48,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:48,374 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:49:48,374 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 154 proven. 182 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:49:49,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:49,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:49:49,130 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:49,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:49:49,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:49:49,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:49:49,131 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 16 states. [2018-12-03 16:49:49,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:49,199 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2018-12-03 16:49:49,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:49:49,199 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 41 [2018-12-03 16:49:49,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:49,200 INFO L225 Difference]: With dead ends: 63 [2018-12-03 16:49:49,201 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:49:49,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:49:49,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:49:49,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 16:49:49,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 16:49:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2018-12-03 16:49:49,206 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 41 [2018-12-03 16:49:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:49,207 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2018-12-03 16:49:49,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:49:49,207 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2018-12-03 16:49:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:49:49,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:49,208 INFO L402 BasicCegarLoop]: trace histogram [20, 14, 6, 1, 1, 1] [2018-12-03 16:49:49,208 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:49,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:49,209 INFO L82 PathProgramCache]: Analyzing trace with hash 858901800, now seen corresponding path program 14 times [2018-12-03 16:49:49,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:49,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:49,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:49,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:49,210 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:49,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 165 proven. 210 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-12-03 16:49:49,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:49,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:49,407 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:49,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:49,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:49,407 INFO L192 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 [2018-12-03 16:49:49,417 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:49:49,417 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:49:49,447 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:49:49,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:49,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 16:49:49,627 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 182 proven. 36 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-03 16:49:49,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:49,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9, 9] total 31 [2018-12-03 16:49:49,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:49,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:49:49,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:49:49,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:49:49,859 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 24 states. [2018-12-03 16:49:50,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:50,019 INFO L93 Difference]: Finished difference Result 68 states and 84 transitions. [2018-12-03 16:49:50,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:49:50,020 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-12-03 16:49:50,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:50,021 INFO L225 Difference]: With dead ends: 68 [2018-12-03 16:49:50,021 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:49:50,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:49:50,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:49:50,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-12-03 16:49:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 16:49:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2018-12-03 16:49:50,028 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 43 [2018-12-03 16:49:50,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:50,028 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2018-12-03 16:49:50,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:49:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-12-03 16:49:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:49:50,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:50,029 INFO L402 BasicCegarLoop]: trace histogram [22, 15, 7, 1, 1, 1] [2018-12-03 16:49:50,030 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:50,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:50,030 INFO L82 PathProgramCache]: Analyzing trace with hash -830075152, now seen corresponding path program 15 times [2018-12-03 16:49:50,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:50,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:50,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:50,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:50,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:50,334 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:49:50,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:50,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:50,334 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:50,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:50,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:50,335 INFO L192 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 [2018-12-03 16:49:50,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:49:50,351 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:49:50,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:49:50,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:50,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:49:50,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:51,053 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 208 proven. 240 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:49:51,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:51,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:49:51,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:51,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:49:51,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:49:51,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:49:51,074 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 18 states. [2018-12-03 16:49:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:51,124 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-12-03 16:49:51,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:49:51,125 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 47 [2018-12-03 16:49:51,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:51,126 INFO L225 Difference]: With dead ends: 71 [2018-12-03 16:49:51,126 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:49:51,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:49:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:49:51,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:49:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:49:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2018-12-03 16:49:51,133 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 47 [2018-12-03 16:49:51,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:51,133 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2018-12-03 16:49:51,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:49:51,133 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2018-12-03 16:49:51,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 16:49:51,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:51,134 INFO L402 BasicCegarLoop]: trace histogram [23, 16, 7, 1, 1, 1] [2018-12-03 16:49:51,134 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:51,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:51,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1545165197, now seen corresponding path program 16 times [2018-12-03 16:49:51,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:51,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:51,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:51,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:51,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:51,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:49:51,315 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:51,315 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:51,315 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:51,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:51,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:51,316 INFO L192 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 [2018-12-03 16:49:51,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:51,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:51,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:49:51,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 221 proven. 272 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:49:52,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:52,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:49:52,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:52,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:49:52,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:49:52,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:49:52,290 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 19 states. [2018-12-03 16:49:52,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:52,415 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2018-12-03 16:49:52,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:49:52,415 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-03 16:49:52,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:52,416 INFO L225 Difference]: With dead ends: 73 [2018-12-03 16:49:52,416 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 16:49:52,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:49:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 16:49:52,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 16:49:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:49:52,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2018-12-03 16:49:52,422 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 49 [2018-12-03 16:49:52,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:52,423 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2018-12-03 16:49:52,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:49:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2018-12-03 16:49:52,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:49:52,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:52,424 INFO L402 BasicCegarLoop]: trace histogram [24, 17, 7, 1, 1, 1] [2018-12-03 16:49:52,424 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:52,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:52,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1551931082, now seen corresponding path program 17 times [2018-12-03 16:49:52,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:52,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:52,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:52,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:52,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:53,114 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 234 proven. 306 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-12-03 16:49:53,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:53,115 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:53,115 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:53,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:53,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:53,115 INFO L192 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 [2018-12-03 16:49:53,125 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:49:53,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:49:53,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:49:53,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:53,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 16:49:53,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:54,294 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 255 proven. 49 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-12-03 16:49:54,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:54,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 10, 10] total 36 [2018-12-03 16:49:54,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:54,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:49:54,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:49:54,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:49:54,315 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand 28 states. [2018-12-03 16:49:54,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:54,619 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2018-12-03 16:49:54,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:49:54,620 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 51 [2018-12-03 16:49:54,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:54,620 INFO L225 Difference]: With dead ends: 78 [2018-12-03 16:49:54,620 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:49:54,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:49:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:49:54,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-03 16:49:54,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 16:49:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2018-12-03 16:49:54,627 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 51 [2018-12-03 16:49:54,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:54,627 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2018-12-03 16:49:54,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:49:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2018-12-03 16:49:54,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 16:49:54,628 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:54,628 INFO L402 BasicCegarLoop]: trace histogram [26, 18, 8, 1, 1, 1] [2018-12-03 16:49:54,629 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:54,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:54,629 INFO L82 PathProgramCache]: Analyzing trace with hash -311825282, now seen corresponding path program 18 times [2018-12-03 16:49:54,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:54,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:54,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:54,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:54,630 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:54,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:49:54,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:54,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:54,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:54,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:54,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:54,851 INFO L192 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 [2018-12-03 16:49:54,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:49:54,859 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:49:54,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:49:54,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:54,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:54,886 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:49:54,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:55,838 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 285 proven. 342 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:49:55,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:55,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:49:55,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:55,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:49:55,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:49:55,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:49:55,859 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand 21 states. [2018-12-03 16:49:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:55,924 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-12-03 16:49:55,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:49:55,924 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-12-03 16:49:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:55,925 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:49:55,925 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 16:49:55,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:49:55,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 16:49:55,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 16:49:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:49:55,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2018-12-03 16:49:55,931 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 55 [2018-12-03 16:49:55,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:55,932 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2018-12-03 16:49:55,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:49:55,932 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-12-03 16:49:55,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 16:49:55,932 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:55,933 INFO L402 BasicCegarLoop]: trace histogram [27, 19, 8, 1, 1, 1] [2018-12-03 16:49:55,933 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:55,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:55,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1622650623, now seen corresponding path program 19 times [2018-12-03 16:49:55,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:55,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:55,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:55,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:55,934 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:49:56,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:56,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:56,160 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:56,160 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:56,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:56,160 INFO L192 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 [2018-12-03 16:49:56,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:56,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:56,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:56,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:56,197 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:49:56,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:56,934 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 300 proven. 380 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:49:56,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:56,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:49:56,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:56,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:49:56,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:49:56,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:49:56,954 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand 22 states. [2018-12-03 16:49:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:57,145 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2018-12-03 16:49:57,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:49:57,146 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-12-03 16:49:57,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:57,147 INFO L225 Difference]: With dead ends: 83 [2018-12-03 16:49:57,147 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 16:49:57,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:49:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 16:49:57,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 16:49:57,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 16:49:57,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2018-12-03 16:49:57,153 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 57 [2018-12-03 16:49:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:57,153 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2018-12-03 16:49:57,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:49:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-12-03 16:49:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:49:57,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:57,154 INFO L402 BasicCegarLoop]: trace histogram [28, 20, 8, 1, 1, 1] [2018-12-03 16:49:57,155 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:57,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:57,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1394581700, now seen corresponding path program 20 times [2018-12-03 16:49:57,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:57,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:57,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:57,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:57,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:57,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:57,441 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 315 proven. 420 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-12-03 16:49:57,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:57,442 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:57,442 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:57,442 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:57,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:57,442 INFO L192 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 [2018-12-03 16:49:57,457 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:49:57,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:49:57,529 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 16:49:57,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:57,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:57,724 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 16:49:57,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:57,934 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 340 proven. 64 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-12-03 16:49:57,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:57,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 11, 11] total 41 [2018-12-03 16:49:57,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:57,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:49:57,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:49:57,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:49:57,954 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand 32 states. [2018-12-03 16:49:58,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:58,233 INFO L93 Difference]: Finished difference Result 88 states and 108 transitions. [2018-12-03 16:49:58,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:49:58,237 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 59 [2018-12-03 16:49:58,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:58,237 INFO L225 Difference]: With dead ends: 88 [2018-12-03 16:49:58,237 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:49:58,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:49:58,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:49:58,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-12-03 16:49:58,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:49:58,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2018-12-03 16:49:58,242 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 59 [2018-12-03 16:49:58,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:58,243 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2018-12-03 16:49:58,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:49:58,243 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-12-03 16:49:58,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:49:58,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:58,244 INFO L402 BasicCegarLoop]: trace histogram [30, 21, 9, 1, 1, 1] [2018-12-03 16:49:58,244 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:58,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:58,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1577747852, now seen corresponding path program 21 times [2018-12-03 16:49:58,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:58,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:58,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:58,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:58,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:49:58,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:58,775 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:58,775 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:58,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:58,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:58,775 INFO L192 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 [2018-12-03 16:49:58,785 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:49:58,785 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:49:58,805 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:49:58,805 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:49:58,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:49:58,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:49:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 374 proven. 462 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:49:59,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:49:59,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:49:59,417 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:49:59,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:49:59,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:49:59,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:49:59,419 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 24 states. [2018-12-03 16:49:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:49:59,506 INFO L93 Difference]: Finished difference Result 91 states and 110 transitions. [2018-12-03 16:49:59,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:49:59,506 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 63 [2018-12-03 16:49:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:49:59,507 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:49:59,507 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 16:49:59,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:49:59,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 16:49:59,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 16:49:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 16:49:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2018-12-03 16:49:59,514 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 63 [2018-12-03 16:49:59,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:49:59,514 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2018-12-03 16:49:59,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:49:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2018-12-03 16:49:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 16:49:59,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:49:59,515 INFO L402 BasicCegarLoop]: trace histogram [31, 22, 9, 1, 1, 1] [2018-12-03 16:49:59,516 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:49:59,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:49:59,516 INFO L82 PathProgramCache]: Analyzing trace with hash -330713329, now seen corresponding path program 22 times [2018-12-03 16:49:59,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:49:59,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:59,517 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:49:59,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:49:59,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:49:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:49:59,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:59,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:49:59,891 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:49:59,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:49:59,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:49:59,892 INFO L192 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 [2018-12-03 16:49:59,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:49:59,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:49:59,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:49:59,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:49:59,929 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:49:59,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 391 proven. 506 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:50:00,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:00,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:50:00,543 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:00,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:50:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:50:00,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:50:00,544 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand 25 states. [2018-12-03 16:50:00,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:00,662 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-12-03 16:50:00,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:50:00,663 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-12-03 16:50:00,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:00,664 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:50:00,664 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 16:50:00,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:50:00,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 16:50:00,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 16:50:00,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 16:50:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2018-12-03 16:50:00,670 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 65 [2018-12-03 16:50:00,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:00,671 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2018-12-03 16:50:00,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:50:00,671 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2018-12-03 16:50:00,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:50:00,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:00,672 INFO L402 BasicCegarLoop]: trace histogram [32, 23, 9, 1, 1, 1] [2018-12-03 16:50:00,672 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:00,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:00,672 INFO L82 PathProgramCache]: Analyzing trace with hash -410872878, now seen corresponding path program 23 times [2018-12-03 16:50:00,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:00,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:00,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:00,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:00,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:01,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 408 proven. 552 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-12-03 16:50:01,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:01,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:01,123 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:01,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:01,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:01,123 INFO L192 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 [2018-12-03 16:50:01,133 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:01,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:01,158 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:50:01,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:01,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:01,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 16:50:01,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:01,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 437 proven. 81 refuted. 0 times theorem prover too weak. 506 trivial. 0 not checked. [2018-12-03 16:50:01,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:01,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 12, 12] total 46 [2018-12-03 16:50:01,907 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:01,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:50:01,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:50:01,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:50:01,909 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand 36 states. [2018-12-03 16:50:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:02,123 INFO L93 Difference]: Finished difference Result 98 states and 120 transitions. [2018-12-03 16:50:02,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:50:02,123 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 67 [2018-12-03 16:50:02,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:02,124 INFO L225 Difference]: With dead ends: 98 [2018-12-03 16:50:02,124 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:50:02,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:50:02,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:50:02,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-12-03 16:50:02,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 16:50:02,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2018-12-03 16:50:02,129 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 67 [2018-12-03 16:50:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:02,129 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2018-12-03 16:50:02,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:50:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2018-12-03 16:50:02,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 16:50:02,130 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:02,130 INFO L402 BasicCegarLoop]: trace histogram [34, 24, 10, 1, 1, 1] [2018-12-03 16:50:02,130 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:02,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:02,131 INFO L82 PathProgramCache]: Analyzing trace with hash -682624486, now seen corresponding path program 24 times [2018-12-03 16:50:02,131 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:02,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:02,132 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:02,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:02,132 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:50:02,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:02,530 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:02,530 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:02,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:02,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:02,530 INFO L192 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 [2018-12-03 16:50:02,541 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:02,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:02,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:02,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:02,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:02,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:50:02,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:03,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 475 proven. 600 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:50:03,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:03,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:50:03,301 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:03,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:50:03,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:50:03,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:03,302 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand 27 states. [2018-12-03 16:50:03,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:03,415 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2018-12-03 16:50:03,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:50:03,417 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 71 [2018-12-03 16:50:03,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:03,418 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:50:03,418 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:50:03,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:03,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:50:03,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:50:03,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:50:03,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-12-03 16:50:03,423 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 71 [2018-12-03 16:50:03,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:03,423 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-12-03 16:50:03,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:50:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-12-03 16:50:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 16:50:03,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:03,424 INFO L402 BasicCegarLoop]: trace histogram [35, 25, 10, 1, 1, 1] [2018-12-03 16:50:03,424 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:03,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1361905507, now seen corresponding path program 25 times [2018-12-03 16:50:03,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:03,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:03,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:03,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:03,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:03,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:50:03,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:03,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:03,849 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:03,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:03,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:03,850 INFO L192 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 [2018-12-03 16:50:03,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:03,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:03,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:03,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:50:03,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:04,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 494 proven. 650 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:50:04,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:04,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 51 [2018-12-03 16:50:04,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:04,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:50:04,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:50:04,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:04,847 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 28 states. [2018-12-03 16:50:05,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:05,295 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2018-12-03 16:50:05,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:50:05,295 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 73 [2018-12-03 16:50:05,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:05,296 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:50:05,296 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 16:50:05,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 119 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:05,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 16:50:05,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 16:50:05,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 16:50:05,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 88 transitions. [2018-12-03 16:50:05,301 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 88 transitions. Word has length 73 [2018-12-03 16:50:05,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:05,301 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 88 transitions. [2018-12-03 16:50:05,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:50:05,301 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 88 transitions. [2018-12-03 16:50:05,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:50:05,302 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:05,302 INFO L402 BasicCegarLoop]: trace histogram [36, 26, 10, 1, 1, 1] [2018-12-03 16:50:05,302 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:05,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:05,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1315937696, now seen corresponding path program 26 times [2018-12-03 16:50:05,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:05,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:05,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:05,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:05,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:06,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 513 proven. 702 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-12-03 16:50:06,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:06,562 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:06,562 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:06,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:06,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:06,562 INFO L192 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 [2018-12-03 16:50:06,573 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:06,573 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:06,595 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:50:06,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:06,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 16:50:06,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 546 proven. 100 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2018-12-03 16:50:07,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:07,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 13, 13] total 51 [2018-12-03 16:50:07,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:07,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:50:07,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:50:07,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:50:07,211 INFO L87 Difference]: Start difference. First operand 78 states and 88 transitions. Second operand 40 states. [2018-12-03 16:50:07,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:07,381 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-12-03 16:50:07,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:50:07,382 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 75 [2018-12-03 16:50:07,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:07,383 INFO L225 Difference]: With dead ends: 108 [2018-12-03 16:50:07,383 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 16:50:07,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 16:50:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 16:50:07,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-12-03 16:50:07,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 16:50:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2018-12-03 16:50:07,388 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 75 [2018-12-03 16:50:07,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:07,389 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2018-12-03 16:50:07,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:50:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2018-12-03 16:50:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 16:50:07,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:07,389 INFO L402 BasicCegarLoop]: trace histogram [38, 27, 11, 1, 1, 1] [2018-12-03 16:50:07,390 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:07,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:07,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1113953752, now seen corresponding path program 27 times [2018-12-03 16:50:07,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:07,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:07,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:07,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:07,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:07,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:50:07,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:07,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:07,930 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:07,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:07,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:07,931 INFO L192 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 [2018-12-03 16:50:07,940 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:07,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:07,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:07,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:07,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:07,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:50:07,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 588 proven. 756 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:50:09,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:09,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 51 [2018-12-03 16:50:09,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:09,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:50:09,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:50:09,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:09,147 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 30 states. [2018-12-03 16:50:09,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:09,245 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2018-12-03 16:50:09,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:50:09,245 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 79 [2018-12-03 16:50:09,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:09,246 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:50:09,247 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:50:09,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 129 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:09,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:50:09,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 16:50:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:50:09,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 95 transitions. [2018-12-03 16:50:09,252 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 95 transitions. Word has length 79 [2018-12-03 16:50:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:09,252 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 95 transitions. [2018-12-03 16:50:09,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:50:09,252 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-12-03 16:50:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 16:50:09,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:09,253 INFO L402 BasicCegarLoop]: trace histogram [39, 28, 11, 1, 1, 1] [2018-12-03 16:50:09,253 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:09,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1203489365, now seen corresponding path program 28 times [2018-12-03 16:50:09,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:09,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:09,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:09,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:09,254 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:09,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:09,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:50:09,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:09,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:09,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:09,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:09,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:09,861 INFO L192 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 [2018-12-03 16:50:09,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:09,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:09,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:50:09,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:11,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 609 proven. 812 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:50:11,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:11,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 51 [2018-12-03 16:50:11,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:11,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:50:11,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:50:11,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:11,198 INFO L87 Difference]: Start difference. First operand 84 states and 95 transitions. Second operand 31 states. [2018-12-03 16:50:11,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:11,309 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2018-12-03 16:50:11,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:50:11,309 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 81 [2018-12-03 16:50:11,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:11,310 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:50:11,311 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 16:50:11,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 132 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:11,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 16:50:11,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 16:50:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 16:50:11,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 97 transitions. [2018-12-03 16:50:11,316 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 97 transitions. Word has length 81 [2018-12-03 16:50:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:11,316 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 97 transitions. [2018-12-03 16:50:11,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:50:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 97 transitions. [2018-12-03 16:50:11,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:50:11,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:11,317 INFO L402 BasicCegarLoop]: trace histogram [40, 29, 11, 1, 1, 1] [2018-12-03 16:50:11,317 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:11,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:11,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1347867538, now seen corresponding path program 29 times [2018-12-03 16:50:11,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:11,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:11,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:11,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 630 proven. 870 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2018-12-03 16:50:11,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:11,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:11,698 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:11,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:11,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:11,699 INFO L192 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 [2018-12-03 16:50:11,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:11,709 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:11,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 16:50:11,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:11,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:12,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 16:50:12,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:12,499 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 667 proven. 121 refuted. 0 times theorem prover too weak. 812 trivial. 0 not checked. [2018-12-03 16:50:12,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:12,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 14, 14] total 56 [2018-12-03 16:50:12,518 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:12,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:50:12,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:50:12,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:50:12,519 INFO L87 Difference]: Start difference. First operand 86 states and 97 transitions. Second operand 44 states. [2018-12-03 16:50:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:12,701 INFO L93 Difference]: Finished difference Result 118 states and 144 transitions. [2018-12-03 16:50:12,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:50:12,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 83 [2018-12-03 16:50:12,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:12,702 INFO L225 Difference]: With dead ends: 118 [2018-12-03 16:50:12,702 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:50:12,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:50:12,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:50:12,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-12-03 16:50:12,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:50:12,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2018-12-03 16:50:12,705 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 83 [2018-12-03 16:50:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:12,705 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2018-12-03 16:50:12,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:50:12,706 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2018-12-03 16:50:12,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:50:12,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:12,706 INFO L402 BasicCegarLoop]: trace histogram [42, 30, 12, 1, 1, 1] [2018-12-03 16:50:12,706 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:12,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:12,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1530792522, now seen corresponding path program 30 times [2018-12-03 16:50:12,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:12,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:12,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:12,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:12,708 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:50:13,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:13,332 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:13,332 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:13,332 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:13,333 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:13,333 INFO L192 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 [2018-12-03 16:50:13,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:13,342 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:13,371 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:13,371 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:13,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:13,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:50:13,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 713 proven. 930 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:50:14,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:14,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 51 [2018-12-03 16:50:14,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:14,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:50:14,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:50:14,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:14,608 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand 33 states. [2018-12-03 16:50:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:14,803 INFO L93 Difference]: Finished difference Result 121 states and 146 transitions. [2018-12-03 16:50:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:50:14,803 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 87 [2018-12-03 16:50:14,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:14,804 INFO L225 Difference]: With dead ends: 121 [2018-12-03 16:50:14,804 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 16:50:14,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 142 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:14,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 16:50:14,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 16:50:14,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:50:14,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 104 transitions. [2018-12-03 16:50:14,810 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 104 transitions. Word has length 87 [2018-12-03 16:50:14,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:14,810 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 104 transitions. [2018-12-03 16:50:14,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:50:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 104 transitions. [2018-12-03 16:50:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:50:14,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:14,811 INFO L402 BasicCegarLoop]: trace histogram [43, 31, 12, 1, 1, 1] [2018-12-03 16:50:14,811 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:14,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:14,812 INFO L82 PathProgramCache]: Analyzing trace with hash 158699065, now seen corresponding path program 31 times [2018-12-03 16:50:14,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:14,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:14,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:14,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:14,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:15,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:50:15,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:15,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:15,246 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:15,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:15,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:15,246 INFO L192 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 [2018-12-03 16:50:15,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:15,255 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:15,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:15,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:50:15,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:16,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 736 proven. 992 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:50:16,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:16,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2018-12-03 16:50:16,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:16,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:50:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:50:16,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:16,078 INFO L87 Difference]: Start difference. First operand 92 states and 104 transitions. Second operand 34 states. [2018-12-03 16:50:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:16,197 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2018-12-03 16:50:16,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:50:16,198 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 89 [2018-12-03 16:50:16,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:16,199 INFO L225 Difference]: With dead ends: 123 [2018-12-03 16:50:16,199 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:50:16,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 145 SyntacticMatches, 14 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:50:16,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 16:50:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:50:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2018-12-03 16:50:16,204 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 89 [2018-12-03 16:50:16,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:16,204 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2018-12-03 16:50:16,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:50:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2018-12-03 16:50:16,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 16:50:16,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:16,205 INFO L402 BasicCegarLoop]: trace histogram [44, 32, 12, 1, 1, 1] [2018-12-03 16:50:16,205 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:16,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:16,205 INFO L82 PathProgramCache]: Analyzing trace with hash 262476284, now seen corresponding path program 32 times [2018-12-03 16:50:16,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:16,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:16,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:16,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:16,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:16,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:16,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 759 proven. 1056 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-12-03 16:50:16,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:16,743 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:16,743 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:16,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:16,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:16,743 INFO L192 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 [2018-12-03 16:50:16,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:16,752 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:16,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:50:16,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:16,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:17,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 16:50:17,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 800 proven. 144 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-12-03 16:50:18,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:18,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 15, 15] total 61 [2018-12-03 16:50:18,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:18,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:50:18,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:50:18,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:50:18,330 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 48 states. [2018-12-03 16:50:18,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:18,568 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2018-12-03 16:50:18,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:50:18,570 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 91 [2018-12-03 16:50:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:18,571 INFO L225 Difference]: With dead ends: 128 [2018-12-03 16:50:18,571 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:50:18,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 16:50:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:50:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-12-03 16:50:18,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:50:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-12-03 16:50:18,576 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 91 [2018-12-03 16:50:18,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:18,576 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-12-03 16:50:18,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:50:18,576 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-12-03 16:50:18,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:50:18,577 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:18,577 INFO L402 BasicCegarLoop]: trace histogram [46, 33, 13, 1, 1, 1] [2018-12-03 16:50:18,577 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:18,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:18,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1377221828, now seen corresponding path program 33 times [2018-12-03 16:50:18,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:18,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:18,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:18,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:18,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:19,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:50:19,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:19,472 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:19,472 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:19,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:19,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:19,472 INFO L192 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 [2018-12-03 16:50:19,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:19,481 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:19,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:19,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:19,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:19,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:50:19,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 850 proven. 1122 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:50:20,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:20,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 51 [2018-12-03 16:50:20,380 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:20,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:50:20,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:50:20,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:20,381 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 36 states. [2018-12-03 16:50:20,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:20,478 INFO L93 Difference]: Finished difference Result 131 states and 158 transitions. [2018-12-03 16:50:20,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:50:20,478 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 95 [2018-12-03 16:50:20,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:20,480 INFO L225 Difference]: With dead ends: 131 [2018-12-03 16:50:20,480 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:50:20,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 155 SyntacticMatches, 18 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:20,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:50:20,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:50:20,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:50:20,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2018-12-03 16:50:20,485 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 95 [2018-12-03 16:50:20,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:20,485 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2018-12-03 16:50:20,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:50:20,485 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2018-12-03 16:50:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 16:50:20,486 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:20,486 INFO L402 BasicCegarLoop]: trace histogram [47, 34, 13, 1, 1, 1] [2018-12-03 16:50:20,486 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:20,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:20,487 INFO L82 PathProgramCache]: Analyzing trace with hash -726195641, now seen corresponding path program 34 times [2018-12-03 16:50:20,487 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:20,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:20,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:20,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:20,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:20,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:21,879 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:50:21,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:21,879 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:21,880 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:21,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:21,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:21,880 INFO L192 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 [2018-12-03 16:50:21,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:21,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:21,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:21,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:50:21,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:22,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 875 proven. 1190 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:50:22,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:22,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 51 [2018-12-03 16:50:22,822 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:22,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:50:22,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:50:22,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:22,823 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand 37 states. [2018-12-03 16:50:22,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:22,928 INFO L93 Difference]: Finished difference Result 133 states and 160 transitions. [2018-12-03 16:50:22,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:50:22,928 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 97 [2018-12-03 16:50:22,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:22,929 INFO L225 Difference]: With dead ends: 133 [2018-12-03 16:50:22,929 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 16:50:22,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 158 SyntacticMatches, 20 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 16:50:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 16:50:22,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:50:22,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2018-12-03 16:50:22,932 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 97 [2018-12-03 16:50:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:22,932 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2018-12-03 16:50:22,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:50:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2018-12-03 16:50:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:50:22,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:22,933 INFO L402 BasicCegarLoop]: trace histogram [48, 35, 13, 1, 1, 1] [2018-12-03 16:50:22,933 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:22,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:22,934 INFO L82 PathProgramCache]: Analyzing trace with hash 819213066, now seen corresponding path program 35 times [2018-12-03 16:50:22,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:22,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:22,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:22,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:23,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 900 proven. 1260 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-03 16:50:23,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:23,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:23,631 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:23,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:23,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:23,631 INFO L192 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 [2018-12-03 16:50:23,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:23,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:23,666 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:50:23,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:23,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 16:50:24,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:25,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 945 proven. 169 refuted. 0 times theorem prover too weak. 1190 trivial. 0 not checked. [2018-12-03 16:50:25,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:25,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 16, 16] total 66 [2018-12-03 16:50:25,187 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:25,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:50:25,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:50:25,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:50:25,189 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand 52 states. [2018-12-03 16:50:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:25,450 INFO L93 Difference]: Finished difference Result 138 states and 168 transitions. [2018-12-03 16:50:25,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:50:25,451 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 99 [2018-12-03 16:50:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:25,452 INFO L225 Difference]: With dead ends: 138 [2018-12-03 16:50:25,453 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:50:25,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:50:25,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:50:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-03 16:50:25,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:50:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-12-03 16:50:25,458 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 99 [2018-12-03 16:50:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:25,458 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-12-03 16:50:25,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:50:25,459 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-12-03 16:50:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:50:25,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:25,460 INFO L402 BasicCegarLoop]: trace histogram [50, 36, 14, 1, 1, 1] [2018-12-03 16:50:25,460 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:25,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1046536018, now seen corresponding path program 36 times [2018-12-03 16:50:25,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:25,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:25,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:25,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:26,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:50:26,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:26,055 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:26,055 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:26,055 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:26,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:26,055 INFO L192 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 [2018-12-03 16:50:26,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:26,064 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:26,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:26,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:26,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:50:26,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 999 proven. 1332 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:50:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:26,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 51 [2018-12-03 16:50:26,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:26,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:50:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:50:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:26,965 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 39 states. [2018-12-03 16:50:27,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:27,127 INFO L93 Difference]: Finished difference Result 141 states and 170 transitions. [2018-12-03 16:50:27,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:50:27,128 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 103 [2018-12-03 16:50:27,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:27,129 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:50:27,129 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 16:50:27,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 168 SyntacticMatches, 24 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:27,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 16:50:27,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 16:50:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:50:27,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 122 transitions. [2018-12-03 16:50:27,135 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 122 transitions. Word has length 103 [2018-12-03 16:50:27,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:27,136 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 122 transitions. [2018-12-03 16:50:27,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:50:27,136 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 122 transitions. [2018-12-03 16:50:27,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 16:50:27,137 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:27,137 INFO L402 BasicCegarLoop]: trace histogram [51, 37, 14, 1, 1, 1] [2018-12-03 16:50:27,137 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:27,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:27,137 INFO L82 PathProgramCache]: Analyzing trace with hash -3075627, now seen corresponding path program 37 times [2018-12-03 16:50:27,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:27,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:27,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:27,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:27,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:27,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:50:27,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:27,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:27,932 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:27,932 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:27,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:27,932 INFO L192 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 [2018-12-03 16:50:27,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:27,941 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:27,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:27,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:50:27,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 1026 proven. 1406 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:50:28,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:28,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 51 [2018-12-03 16:50:28,885 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:28,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:50:28,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:50:28,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:28,887 INFO L87 Difference]: Start difference. First operand 108 states and 122 transitions. Second operand 40 states. [2018-12-03 16:50:29,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:29,058 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2018-12-03 16:50:29,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:50:29,059 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 105 [2018-12-03 16:50:29,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:29,060 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:50:29,060 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 16:50:29,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 171 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:29,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 16:50:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 16:50:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 16:50:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 124 transitions. [2018-12-03 16:50:29,065 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 124 transitions. Word has length 105 [2018-12-03 16:50:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:29,066 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 124 transitions. [2018-12-03 16:50:29,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:50:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 124 transitions. [2018-12-03 16:50:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:50:29,067 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:29,067 INFO L402 BasicCegarLoop]: trace histogram [52, 38, 14, 1, 1, 1] [2018-12-03 16:50:29,067 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:29,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:29,067 INFO L82 PathProgramCache]: Analyzing trace with hash 637448088, now seen corresponding path program 38 times [2018-12-03 16:50:29,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:29,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:29,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:29,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:29,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:29,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1053 proven. 1482 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2018-12-03 16:50:29,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:29,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:29,873 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:29,873 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:29,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:29,873 INFO L192 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 [2018-12-03 16:50:29,884 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:29,884 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:29,911 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 16:50:29,911 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:29,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 16:50:30,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1102 proven. 196 refuted. 0 times theorem prover too weak. 1406 trivial. 0 not checked. [2018-12-03 16:50:31,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:31,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 17, 17] total 71 [2018-12-03 16:50:31,082 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:31,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:50:31,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:50:31,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:50:31,083 INFO L87 Difference]: Start difference. First operand 110 states and 124 transitions. Second operand 56 states. [2018-12-03 16:50:32,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:32,425 INFO L93 Difference]: Finished difference Result 148 states and 180 transitions. [2018-12-03 16:50:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:50:32,426 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 107 [2018-12-03 16:50:32,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:32,427 INFO L225 Difference]: With dead ends: 148 [2018-12-03 16:50:32,427 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 16:50:32,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:50:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 16:50:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-12-03 16:50:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:50:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 129 transitions. [2018-12-03 16:50:32,432 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 129 transitions. Word has length 107 [2018-12-03 16:50:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:32,432 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 129 transitions. [2018-12-03 16:50:32,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:50:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-12-03 16:50:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:50:32,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:32,433 INFO L402 BasicCegarLoop]: trace histogram [54, 39, 15, 1, 1, 1] [2018-12-03 16:50:32,434 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:32,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:32,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1746895520, now seen corresponding path program 39 times [2018-12-03 16:50:32,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:32,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:32,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:32,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:32,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:50:33,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:33,114 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:33,114 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:33,114 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:33,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:33,114 INFO L192 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 [2018-12-03 16:50:33,122 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:33,122 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:33,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:33,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:33,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:33,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:50:33,167 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:34,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1160 proven. 1560 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:50:34,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:34,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 51 [2018-12-03 16:50:34,434 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:34,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:50:34,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:50:34,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:34,435 INFO L87 Difference]: Start difference. First operand 114 states and 129 transitions. Second operand 42 states. [2018-12-03 16:50:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:34,638 INFO L93 Difference]: Finished difference Result 151 states and 182 transitions. [2018-12-03 16:50:34,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:50:34,646 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-12-03 16:50:34,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:34,647 INFO L225 Difference]: With dead ends: 151 [2018-12-03 16:50:34,647 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 16:50:34,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 181 SyntacticMatches, 30 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 735 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:34,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 16:50:34,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 16:50:34,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 16:50:34,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 131 transitions. [2018-12-03 16:50:34,652 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 131 transitions. Word has length 111 [2018-12-03 16:50:34,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:34,652 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 131 transitions. [2018-12-03 16:50:34,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:50:34,652 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 131 transitions. [2018-12-03 16:50:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:50:34,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:34,653 INFO L402 BasicCegarLoop]: trace histogram [55, 40, 15, 1, 1, 1] [2018-12-03 16:50:34,653 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:34,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash 637762787, now seen corresponding path program 40 times [2018-12-03 16:50:34,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:34,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:34,654 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:34,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:34,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:50:35,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:35,506 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:35,507 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:35,507 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:35,507 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:35,507 INFO L192 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 [2018-12-03 16:50:35,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:35,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:35,553 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:35,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:50:35,572 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:36,641 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 1189 proven. 1640 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:50:36,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:36,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 51 [2018-12-03 16:50:36,660 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:36,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:50:36,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:50:36,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:36,661 INFO L87 Difference]: Start difference. First operand 116 states and 131 transitions. Second operand 43 states. [2018-12-03 16:50:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:36,774 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2018-12-03 16:50:36,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:50:36,774 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-12-03 16:50:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:36,776 INFO L225 Difference]: With dead ends: 153 [2018-12-03 16:50:36,776 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 16:50:36,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 184 SyntacticMatches, 32 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 16:50:36,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 16:50:36,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 16:50:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 133 transitions. [2018-12-03 16:50:36,781 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 133 transitions. Word has length 113 [2018-12-03 16:50:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:36,781 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 133 transitions. [2018-12-03 16:50:36,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:50:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 133 transitions. [2018-12-03 16:50:36,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 16:50:36,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:36,782 INFO L402 BasicCegarLoop]: trace histogram [56, 41, 15, 1, 1, 1] [2018-12-03 16:50:36,782 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:36,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:36,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1218140250, now seen corresponding path program 41 times [2018-12-03 16:50:36,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:36,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:36,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:36,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:36,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:36,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:37,839 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1218 proven. 1722 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2018-12-03 16:50:37,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:37,840 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:37,840 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:37,840 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:37,840 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:37,840 INFO L192 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 [2018-12-03 16:50:37,849 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:37,849 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:37,880 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 16:50:37,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:37,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:38,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 16:50:38,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 1271 proven. 225 refuted. 0 times theorem prover too weak. 1640 trivial. 0 not checked. [2018-12-03 16:50:39,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:39,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 18, 18] total 76 [2018-12-03 16:50:39,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:39,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:50:39,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:50:39,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:50:39,142 INFO L87 Difference]: Start difference. First operand 118 states and 133 transitions. Second operand 60 states. [2018-12-03 16:50:39,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:39,728 INFO L93 Difference]: Finished difference Result 158 states and 192 transitions. [2018-12-03 16:50:39,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:50:39,728 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 115 [2018-12-03 16:50:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:39,730 INFO L225 Difference]: With dead ends: 158 [2018-12-03 16:50:39,730 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 16:50:39,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:50:39,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 16:50:39,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-12-03 16:50:39,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 16:50:39,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 138 transitions. [2018-12-03 16:50:39,736 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 138 transitions. Word has length 115 [2018-12-03 16:50:39,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:39,736 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 138 transitions. [2018-12-03 16:50:39,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:50:39,736 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 138 transitions. [2018-12-03 16:50:39,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 16:50:39,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:39,737 INFO L402 BasicCegarLoop]: trace histogram [58, 42, 16, 1, 1, 1] [2018-12-03 16:50:39,737 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:39,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:39,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1001539858, now seen corresponding path program 42 times [2018-12-03 16:50:39,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:39,738 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:39,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:39,738 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:40,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:50:40,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:40,885 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:40,885 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:40,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:40,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:40,886 INFO L192 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 [2018-12-03 16:50:40,895 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:40,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:40,930 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:40,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:40,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:50:40,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:41,896 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 1333 proven. 1806 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:50:41,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:41,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 51 [2018-12-03 16:50:41,915 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:41,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:50:41,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:50:41,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:41,916 INFO L87 Difference]: Start difference. First operand 122 states and 138 transitions. Second operand 45 states. [2018-12-03 16:50:42,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:42,036 INFO L93 Difference]: Finished difference Result 161 states and 194 transitions. [2018-12-03 16:50:42,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:50:42,036 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 119 [2018-12-03 16:50:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:42,037 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:50:42,037 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 16:50:42,038 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 194 SyntacticMatches, 36 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 882 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:42,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 16:50:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 16:50:42,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 16:50:42,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 140 transitions. [2018-12-03 16:50:42,043 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 140 transitions. Word has length 119 [2018-12-03 16:50:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:42,044 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 140 transitions. [2018-12-03 16:50:42,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:50:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 140 transitions. [2018-12-03 16:50:42,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 16:50:42,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:42,045 INFO L402 BasicCegarLoop]: trace histogram [59, 43, 16, 1, 1, 1] [2018-12-03 16:50:42,045 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:42,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:42,045 INFO L82 PathProgramCache]: Analyzing trace with hash 436634481, now seen corresponding path program 43 times [2018-12-03 16:50:42,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:42,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:42,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:42,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:42,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:50:42,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:42,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:42,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:42,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:42,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:42,845 INFO L192 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 [2018-12-03 16:50:42,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:42,853 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:42,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:42,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:50:42,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 1364 proven. 1892 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:50:43,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:43,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 51 [2018-12-03 16:50:43,875 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:43,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:50:43,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:50:43,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:43,876 INFO L87 Difference]: Start difference. First operand 124 states and 140 transitions. Second operand 46 states. [2018-12-03 16:50:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:44,118 INFO L93 Difference]: Finished difference Result 163 states and 196 transitions. [2018-12-03 16:50:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:50:44,119 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 121 [2018-12-03 16:50:44,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:44,120 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:50:44,120 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 16:50:44,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 197 SyntacticMatches, 38 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:44,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 16:50:44,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 16:50:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 16:50:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 142 transitions. [2018-12-03 16:50:44,126 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 142 transitions. Word has length 121 [2018-12-03 16:50:44,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:44,126 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 142 transitions. [2018-12-03 16:50:44,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:50:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 142 transitions. [2018-12-03 16:50:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 16:50:44,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:44,127 INFO L402 BasicCegarLoop]: trace histogram [60, 44, 16, 1, 1, 1] [2018-12-03 16:50:44,127 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:44,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:44,128 INFO L82 PathProgramCache]: Analyzing trace with hash -457295052, now seen corresponding path program 44 times [2018-12-03 16:50:44,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:44,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:44,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:44,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:44,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:45,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1395 proven. 1980 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2018-12-03 16:50:45,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:45,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:45,305 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:45,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:45,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:45,305 INFO L192 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 [2018-12-03 16:50:45,314 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:45,314 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:45,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:50:45,352 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:45,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:46,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 16:50:46,110 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 1452 proven. 256 refuted. 0 times theorem prover too weak. 1892 trivial. 0 not checked. [2018-12-03 16:50:46,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:46,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 19, 19] total 81 [2018-12-03 16:50:46,953 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:46,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:50:46,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:50:46,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:50:46,955 INFO L87 Difference]: Start difference. First operand 126 states and 142 transitions. Second operand 64 states. [2018-12-03 16:50:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:47,305 INFO L93 Difference]: Finished difference Result 168 states and 204 transitions. [2018-12-03 16:50:47,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:50:47,306 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 123 [2018-12-03 16:50:47,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:47,307 INFO L225 Difference]: With dead ends: 168 [2018-12-03 16:50:47,307 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 16:50:47,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-12-03 16:50:47,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 16:50:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-03 16:50:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 16:50:47,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 147 transitions. [2018-12-03 16:50:47,314 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 147 transitions. Word has length 123 [2018-12-03 16:50:47,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:47,314 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 147 transitions. [2018-12-03 16:50:47,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:50:47,314 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 147 transitions. [2018-12-03 16:50:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 16:50:47,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:47,315 INFO L402 BasicCegarLoop]: trace histogram [62, 45, 17, 1, 1, 1] [2018-12-03 16:50:47,315 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:47,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:47,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1658366972, now seen corresponding path program 45 times [2018-12-03 16:50:47,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:47,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:47,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:47,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:47,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:47,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:48,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:50:48,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:48,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:48,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:48,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:48,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:48,203 INFO L192 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 [2018-12-03 16:50:48,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:48,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:48,250 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:48,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:48,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:50:48,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:49,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 1518 proven. 2070 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:50:49,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:49,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 51 [2018-12-03 16:50:49,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:49,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:50:49,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:50:49,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:49,310 INFO L87 Difference]: Start difference. First operand 130 states and 147 transitions. Second operand 48 states. [2018-12-03 16:50:49,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:49,515 INFO L93 Difference]: Finished difference Result 171 states and 206 transitions. [2018-12-03 16:50:49,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:50:49,515 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-12-03 16:50:49,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:49,517 INFO L225 Difference]: With dead ends: 171 [2018-12-03 16:50:49,517 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 16:50:49,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 207 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:49,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 16:50:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 16:50:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 16:50:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2018-12-03 16:50:49,523 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 127 [2018-12-03 16:50:49,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:49,524 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2018-12-03 16:50:49,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:50:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2018-12-03 16:50:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 16:50:49,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:49,525 INFO L402 BasicCegarLoop]: trace histogram [63, 46, 17, 1, 1, 1] [2018-12-03 16:50:49,525 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:49,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:49,525 INFO L82 PathProgramCache]: Analyzing trace with hash -401980033, now seen corresponding path program 46 times [2018-12-03 16:50:49,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:49,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:49,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:49,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:49,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:50:50,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:50,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:50,572 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:50,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:50,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:50,573 INFO L192 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 [2018-12-03 16:50:50,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:50,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:50,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:50:50,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:51,576 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 1551 proven. 2162 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:50:51,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:51,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 51 [2018-12-03 16:50:51,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:51,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:50:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:50:51,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:51,596 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand 49 states. [2018-12-03 16:50:51,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:51,766 INFO L93 Difference]: Finished difference Result 173 states and 208 transitions. [2018-12-03 16:50:51,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:50:51,766 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 129 [2018-12-03 16:50:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:51,767 INFO L225 Difference]: With dead ends: 173 [2018-12-03 16:50:51,768 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 16:50:51,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 210 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:51,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 16:50:51,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 16:50:51,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 16:50:51,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 151 transitions. [2018-12-03 16:50:51,773 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 151 transitions. Word has length 129 [2018-12-03 16:50:51,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:51,774 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 151 transitions. [2018-12-03 16:50:51,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:50:51,774 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 151 transitions. [2018-12-03 16:50:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 16:50:51,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:51,775 INFO L402 BasicCegarLoop]: trace histogram [64, 47, 17, 1, 1, 1] [2018-12-03 16:50:51,775 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:51,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash -415528382, now seen corresponding path program 47 times [2018-12-03 16:50:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:51,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:51,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:51,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:51,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:51,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:53,237 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1584 proven. 2256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2018-12-03 16:50:53,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:53,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:53,238 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:53,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:53,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:53,238 INFO L192 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 [2018-12-03 16:50:53,247 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:53,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:53,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 16:50:53,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:53,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 16:50:53,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:55,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 1645 proven. 289 refuted. 0 times theorem prover too weak. 2162 trivial. 0 not checked. [2018-12-03 16:50:55,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:55,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 20, 20] total 86 [2018-12-03 16:50:55,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:55,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:50:55,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:50:55,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:50:55,305 INFO L87 Difference]: Start difference. First operand 134 states and 151 transitions. Second operand 68 states. [2018-12-03 16:50:55,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:55,676 INFO L93 Difference]: Finished difference Result 178 states and 216 transitions. [2018-12-03 16:50:55,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:50:55,676 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 131 [2018-12-03 16:50:55,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:55,678 INFO L225 Difference]: With dead ends: 178 [2018-12-03 16:50:55,678 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:50:55,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:50:55,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:50:55,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-12-03 16:50:55,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 16:50:55,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 156 transitions. [2018-12-03 16:50:55,683 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 156 transitions. Word has length 131 [2018-12-03 16:50:55,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:55,683 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 156 transitions. [2018-12-03 16:50:55,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:50:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 156 transitions. [2018-12-03 16:50:55,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 16:50:55,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:55,684 INFO L402 BasicCegarLoop]: trace histogram [66, 48, 18, 1, 1, 1] [2018-12-03 16:50:55,685 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:55,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:55,685 INFO L82 PathProgramCache]: Analyzing trace with hash -836141942, now seen corresponding path program 48 times [2018-12-03 16:50:55,685 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:55,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:55,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:55,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:55,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:55,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:50:56,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:56,820 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:56,821 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:56,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:50:56,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:56,821 INFO L192 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 [2018-12-03 16:50:56,830 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:56,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:56,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:56,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:56,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:50:56,889 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:57,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 1715 proven. 2352 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:50:57,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:57,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 51 [2018-12-03 16:50:57,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:57,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:50:57,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:50:57,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:57,836 INFO L87 Difference]: Start difference. First operand 138 states and 156 transitions. Second operand 51 states. [2018-12-03 16:50:58,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:58,770 INFO L93 Difference]: Finished difference Result 181 states and 218 transitions. [2018-12-03 16:50:58,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:50:58,770 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 135 [2018-12-03 16:50:58,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:58,772 INFO L225 Difference]: With dead ends: 181 [2018-12-03 16:50:58,772 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 16:50:58,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 220 SyntacticMatches, 48 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:50:58,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 16:50:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 16:50:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 16:50:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 158 transitions. [2018-12-03 16:50:58,776 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 158 transitions. Word has length 135 [2018-12-03 16:50:58,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:58,777 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 158 transitions. [2018-12-03 16:50:58,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:50:58,777 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 158 transitions. [2018-12-03 16:50:58,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 16:50:58,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:58,778 INFO L402 BasicCegarLoop]: trace histogram [67, 49, 18, 1, 1, 1] [2018-12-03 16:50:58,778 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:58,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:58,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1471603469, now seen corresponding path program 49 times [2018-12-03 16:50:58,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:58,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:58,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:58,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:58,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:51:00,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:00,334 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:00,334 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:00,334 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:00,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:00,335 INFO L192 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 [2018-12-03 16:51:00,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:00,347 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:00,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:00,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:00,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:51:00,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:01,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 1750 proven. 2450 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-12-03 16:51:01,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:01,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 16:51:01,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:01,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:51:01,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:51:01,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:51:01,943 INFO L87 Difference]: Start difference. First operand 140 states and 158 transitions. Second operand 52 states. [2018-12-03 16:51:02,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:02,118 INFO L93 Difference]: Finished difference Result 183 states and 220 transitions. [2018-12-03 16:51:02,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:51:02,119 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 137 [2018-12-03 16:51:02,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:02,120 INFO L225 Difference]: With dead ends: 183 [2018-12-03 16:51:02,120 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 16:51:02,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 223 SyntacticMatches, 50 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:51:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 16:51:02,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 16:51:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 16:51:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 160 transitions. [2018-12-03 16:51:02,125 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 160 transitions. Word has length 137 [2018-12-03 16:51:02,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:02,125 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 160 transitions. [2018-12-03 16:51:02,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:51:02,125 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 160 transitions. [2018-12-03 16:51:02,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 16:51:02,126 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:02,126 INFO L402 BasicCegarLoop]: trace histogram [68, 50, 18, 1, 1, 1] [2018-12-03 16:51:02,126 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:02,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:02,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1283148592, now seen corresponding path program 50 times [2018-12-03 16:51:02,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:02,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:02,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:02,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:02,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:03,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1968 proven. 400 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:51:03,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:03,411 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:03,412 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:03,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:03,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:03,412 INFO L192 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 [2018-12-03 16:51:03,421 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:03,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:03,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:51:03,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:03,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:51:03,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 1850 proven. 324 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:51:03,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:03,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 21] total 42 [2018-12-03 16:51:03,929 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:03,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:51:03,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:51:03,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:51:03,930 INFO L87 Difference]: Start difference. First operand 142 states and 160 transitions. Second operand 23 states. [2018-12-03 16:51:04,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:04,023 INFO L93 Difference]: Finished difference Result 153 states and 177 transitions. [2018-12-03 16:51:04,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:51:04,023 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 139 [2018-12-03 16:51:04,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:04,025 INFO L225 Difference]: With dead ends: 153 [2018-12-03 16:51:04,025 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 16:51:04,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:51:04,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 16:51:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-12-03 16:51:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 16:51:04,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 169 transitions. [2018-12-03 16:51:04,029 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 169 transitions. Word has length 139 [2018-12-03 16:51:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:04,030 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 169 transitions. [2018-12-03 16:51:04,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:51:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2018-12-03 16:51:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 16:51:04,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:04,031 INFO L402 BasicCegarLoop]: trace histogram [71, 50, 21, 1, 1, 1] [2018-12-03 16:51:04,032 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:04,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash -772821089, now seen corresponding path program 51 times [2018-12-03 16:51:04,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:04,033 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:04,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:04,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 2256 proven. 529 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:51:05,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:05,421 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:05,421 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:05,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:05,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:05,421 INFO L192 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 [2018-12-03 16:51:05,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:05,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:05,493 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:05,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:05,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:06,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:08,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:09,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:09,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 73, 73] total 102 [2018-12-03 16:51:09,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:09,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:51:09,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:51:09,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:09,011 INFO L87 Difference]: Start difference. First operand 148 states and 169 transitions. Second operand 76 states. [2018-12-03 16:51:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:09,436 INFO L93 Difference]: Finished difference Result 159 states and 186 transitions. [2018-12-03 16:51:09,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:51:09,436 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 145 [2018-12-03 16:51:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:09,437 INFO L225 Difference]: With dead ends: 159 [2018-12-03 16:51:09,437 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 16:51:09,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 168 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10537 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 16:51:09,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-12-03 16:51:09,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 16:51:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 178 transitions. [2018-12-03 16:51:09,442 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 178 transitions. Word has length 145 [2018-12-03 16:51:09,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:09,443 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 178 transitions. [2018-12-03 16:51:09,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:51:09,443 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 178 transitions. [2018-12-03 16:51:09,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 16:51:09,444 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:09,444 INFO L402 BasicCegarLoop]: trace histogram [74, 50, 24, 1, 1, 1] [2018-12-03 16:51:09,444 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:09,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:09,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1797188818, now seen corresponding path program 52 times [2018-12-03 16:51:09,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:09,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:09,445 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:09,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:09,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:09,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:10,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 2544 proven. 676 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:51:10,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:10,806 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:10,806 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:10,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:10,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:10,806 INFO L192 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 [2018-12-03 16:51:10,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:10,817 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:10,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:12,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:13,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:13,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 76, 76] total 102 [2018-12-03 16:51:13,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:13,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:51:13,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:51:13,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:13,686 INFO L87 Difference]: Start difference. First operand 154 states and 178 transitions. Second operand 79 states. [2018-12-03 16:51:14,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:14,165 INFO L93 Difference]: Finished difference Result 165 states and 195 transitions. [2018-12-03 16:51:14,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:51:14,166 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 151 [2018-12-03 16:51:14,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:14,167 INFO L225 Difference]: With dead ends: 165 [2018-12-03 16:51:14,167 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 16:51:14,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 177 SyntacticMatches, 52 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11272 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:14,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 16:51:14,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-12-03 16:51:14,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 16:51:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2018-12-03 16:51:14,174 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 151 [2018-12-03 16:51:14,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:14,174 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2018-12-03 16:51:14,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:51:14,175 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2018-12-03 16:51:14,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 16:51:14,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:14,176 INFO L402 BasicCegarLoop]: trace histogram [77, 50, 27, 1, 1, 1] [2018-12-03 16:51:14,176 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:14,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:14,176 INFO L82 PathProgramCache]: Analyzing trace with hash 882331517, now seen corresponding path program 53 times [2018-12-03 16:51:14,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:14,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:14,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:14,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:14,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2832 proven. 841 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:51:15,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:15,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:15,704 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:15,704 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:15,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:15,705 INFO L192 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 [2018-12-03 16:51:15,713 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:15,713 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:15,788 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 16:51:15,788 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:15,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:15,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:51:15,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:16,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 2750 proven. 729 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:51:16,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:16,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 52 [2018-12-03 16:51:16,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:16,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:51:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:51:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:51:16,579 INFO L87 Difference]: Start difference. First operand 160 states and 187 transitions. Second operand 32 states. [2018-12-03 16:51:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:16,734 INFO L93 Difference]: Finished difference Result 171 states and 204 transitions. [2018-12-03 16:51:16,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:51:16,735 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2018-12-03 16:51:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:16,736 INFO L225 Difference]: With dead ends: 171 [2018-12-03 16:51:16,736 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 16:51:16,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 286 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:51:16,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 16:51:16,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-12-03 16:51:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 16:51:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 196 transitions. [2018-12-03 16:51:16,741 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 196 transitions. Word has length 157 [2018-12-03 16:51:16,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:16,741 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 196 transitions. [2018-12-03 16:51:16,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:51:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 196 transitions. [2018-12-03 16:51:16,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 16:51:16,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:16,742 INFO L402 BasicCegarLoop]: trace histogram [80, 50, 30, 1, 1, 1] [2018-12-03 16:51:16,742 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:16,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:16,743 INFO L82 PathProgramCache]: Analyzing trace with hash -54733684, now seen corresponding path program 54 times [2018-12-03 16:51:16,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:16,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:16,743 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:16,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:16,743 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:18,738 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 3120 proven. 1024 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:51:18,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:18,738 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:18,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:18,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:18,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:18,739 INFO L192 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 [2018-12-03 16:51:18,747 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:18,748 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:18,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:18,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:18,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:19,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:19,954 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:21,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:21,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:21,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 82, 82] total 102 [2018-12-03 16:51:21,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:21,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 16:51:21,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 16:51:21,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:21,986 INFO L87 Difference]: Start difference. First operand 166 states and 196 transitions. Second operand 85 states. [2018-12-03 16:51:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:22,582 INFO L93 Difference]: Finished difference Result 177 states and 213 transitions. [2018-12-03 16:51:22,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:51:22,583 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 163 [2018-12-03 16:51:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:22,584 INFO L225 Difference]: With dead ends: 177 [2018-12-03 16:51:22,584 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 16:51:22,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 195 SyntacticMatches, 64 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12742 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:22,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 16:51:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-03 16:51:22,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 16:51:22,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 205 transitions. [2018-12-03 16:51:22,591 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 205 transitions. Word has length 163 [2018-12-03 16:51:22,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:22,591 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 205 transitions. [2018-12-03 16:51:22,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 16:51:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 205 transitions. [2018-12-03 16:51:22,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 16:51:22,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:22,593 INFO L402 BasicCegarLoop]: trace histogram [83, 50, 33, 1, 1, 1] [2018-12-03 16:51:22,593 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:22,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:22,593 INFO L82 PathProgramCache]: Analyzing trace with hash 191369819, now seen corresponding path program 55 times [2018-12-03 16:51:22,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:22,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:22,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:22,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:22,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:25,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 3408 proven. 1225 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:51:25,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:25,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:25,066 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:25,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:25,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:25,066 INFO L192 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 [2018-12-03 16:51:25,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:25,076 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:25,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:26,602 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:28,344 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:28,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:28,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 85, 85] total 102 [2018-12-03 16:51:28,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:28,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:51:28,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:51:28,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:28,364 INFO L87 Difference]: Start difference. First operand 172 states and 205 transitions. Second operand 88 states. [2018-12-03 16:51:29,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:29,018 INFO L93 Difference]: Finished difference Result 183 states and 222 transitions. [2018-12-03 16:51:29,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 16:51:29,018 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 169 [2018-12-03 16:51:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:29,019 INFO L225 Difference]: With dead ends: 183 [2018-12-03 16:51:29,019 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 16:51:29,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 204 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13477 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 16:51:29,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-12-03 16:51:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 16:51:29,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 214 transitions. [2018-12-03 16:51:29,025 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 214 transitions. Word has length 169 [2018-12-03 16:51:29,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:29,026 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 214 transitions. [2018-12-03 16:51:29,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:51:29,026 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 214 transitions. [2018-12-03 16:51:29,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 16:51:29,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:29,027 INFO L402 BasicCegarLoop]: trace histogram [86, 50, 36, 1, 1, 1] [2018-12-03 16:51:29,027 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:29,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:29,028 INFO L82 PathProgramCache]: Analyzing trace with hash -803505942, now seen corresponding path program 56 times [2018-12-03 16:51:29,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:29,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:29,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:29,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:29,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3696 proven. 1444 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:51:30,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:30,480 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:30,480 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:30,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:30,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:30,481 INFO L192 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 [2018-12-03 16:51:30,488 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:30,489 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:30,619 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 74 check-sat command(s) [2018-12-03 16:51:30,619 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:30,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:30,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:51:30,650 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:31,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 3650 proven. 1296 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:51:31,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:31,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 39, 39] total 52 [2018-12-03 16:51:31,814 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:31,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:51:31,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:51:31,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:51:31,815 INFO L87 Difference]: Start difference. First operand 178 states and 214 transitions. Second operand 41 states. [2018-12-03 16:51:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:32,021 INFO L93 Difference]: Finished difference Result 189 states and 231 transitions. [2018-12-03 16:51:32,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:51:32,021 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 175 [2018-12-03 16:51:32,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:32,022 INFO L225 Difference]: With dead ends: 189 [2018-12-03 16:51:32,022 INFO L226 Difference]: Without dead ends: 185 [2018-12-03 16:51:32,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 313 SyntacticMatches, 26 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 611 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:51:32,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-03 16:51:32,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-12-03 16:51:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 16:51:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 223 transitions. [2018-12-03 16:51:32,028 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 223 transitions. Word has length 175 [2018-12-03 16:51:32,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:32,028 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 223 transitions. [2018-12-03 16:51:32,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:51:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 223 transitions. [2018-12-03 16:51:32,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 16:51:32,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:32,030 INFO L402 BasicCegarLoop]: trace histogram [89, 50, 39, 1, 1, 1] [2018-12-03 16:51:32,030 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:32,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:32,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1254455353, now seen corresponding path program 57 times [2018-12-03 16:51:32,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:32,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:32,031 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:32,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:32,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:32,777 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 3984 proven. 1681 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:51:32,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:32,777 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:32,778 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:32,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:32,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:32,778 INFO L192 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 [2018-12-03 16:51:32,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:32,787 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:32,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:32,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:32,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:33,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:35,566 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:35,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:35,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 91, 91] total 102 [2018-12-03 16:51:35,585 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:35,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:51:35,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:51:35,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:35,586 INFO L87 Difference]: Start difference. First operand 184 states and 223 transitions. Second operand 94 states. [2018-12-03 16:51:36,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:36,346 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2018-12-03 16:51:36,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 16:51:36,347 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 181 [2018-12-03 16:51:36,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:36,348 INFO L225 Difference]: With dead ends: 195 [2018-12-03 16:51:36,348 INFO L226 Difference]: Without dead ends: 191 [2018-12-03 16:51:36,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 222 SyntacticMatches, 82 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14947 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:36,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-03 16:51:36,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2018-12-03 16:51:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 16:51:36,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 232 transitions. [2018-12-03 16:51:36,352 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 232 transitions. Word has length 181 [2018-12-03 16:51:36,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:36,352 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 232 transitions. [2018-12-03 16:51:36,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:51:36,352 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 232 transitions. [2018-12-03 16:51:36,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 16:51:36,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:36,353 INFO L402 BasicCegarLoop]: trace histogram [92, 50, 42, 1, 1, 1] [2018-12-03 16:51:36,353 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:36,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:36,353 INFO L82 PathProgramCache]: Analyzing trace with hash 180387912, now seen corresponding path program 58 times [2018-12-03 16:51:36,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:36,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:36,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:36,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:36,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 4272 proven. 1936 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:51:37,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:37,220 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:37,221 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:37,221 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:37,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:37,221 INFO L192 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 [2018-12-03 16:51:37,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:37,231 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:37,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:38,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:38,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:40,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:40,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 94, 94] total 102 [2018-12-03 16:51:40,033 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:40,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 16:51:40,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 16:51:40,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:40,035 INFO L87 Difference]: Start difference. First operand 190 states and 232 transitions. Second operand 97 states. [2018-12-03 16:51:40,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:40,920 INFO L93 Difference]: Finished difference Result 201 states and 249 transitions. [2018-12-03 16:51:40,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 16:51:40,920 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 187 [2018-12-03 16:51:40,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:40,921 INFO L225 Difference]: With dead ends: 201 [2018-12-03 16:51:40,922 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 16:51:40,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 231 SyntacticMatches, 88 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15682 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:40,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 16:51:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-12-03 16:51:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 16:51:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 241 transitions. [2018-12-03 16:51:40,927 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 241 transitions. Word has length 187 [2018-12-03 16:51:40,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:40,928 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 241 transitions. [2018-12-03 16:51:40,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 16:51:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 241 transitions. [2018-12-03 16:51:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 16:51:40,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:40,929 INFO L402 BasicCegarLoop]: trace histogram [95, 50, 45, 1, 1, 1] [2018-12-03 16:51:40,929 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:40,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:40,930 INFO L82 PathProgramCache]: Analyzing trace with hash -304938729, now seen corresponding path program 59 times [2018-12-03 16:51:40,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:40,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:40,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:40,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:40,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4560 proven. 2209 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2018-12-03 16:51:42,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:42,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:42,015 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:42,015 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:42,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:42,016 INFO L192 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 [2018-12-03 16:51:42,025 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:42,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:42,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 92 check-sat command(s) [2018-12-03 16:51:42,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:42,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:42,173 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:51:42,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 4550 proven. 2025 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:51:43,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:43,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 48, 48] total 52 [2018-12-03 16:51:43,110 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:43,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:51:43,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:51:43,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:51:43,111 INFO L87 Difference]: Start difference. First operand 196 states and 241 transitions. Second operand 50 states. [2018-12-03 16:51:43,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:43,413 INFO L93 Difference]: Finished difference Result 207 states and 258 transitions. [2018-12-03 16:51:43,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:51:43,414 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 193 [2018-12-03 16:51:43,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:43,415 INFO L225 Difference]: With dead ends: 207 [2018-12-03 16:51:43,415 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 16:51:43,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 434 GetRequests, 340 SyntacticMatches, 44 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:51:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 16:51:43,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-12-03 16:51:43,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-03 16:51:43,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 250 transitions. [2018-12-03 16:51:43,421 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 250 transitions. Word has length 193 [2018-12-03 16:51:43,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:43,421 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 250 transitions. [2018-12-03 16:51:43,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:51:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 250 transitions. [2018-12-03 16:51:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-12-03 16:51:43,422 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:43,423 INFO L402 BasicCegarLoop]: trace histogram [98, 50, 48, 1, 1, 1] [2018-12-03 16:51:43,423 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:43,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:43,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1624282458, now seen corresponding path program 60 times [2018-12-03 16:51:43,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:43,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:43,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:43,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:43,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:44,627 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 4850 proven. 2304 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:51:44,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:44,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:44,627 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:44,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:44,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:44,627 INFO L192 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 [2018-12-03 16:51:44,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:44,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:44,696 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:44,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:44,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:45,812 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:45,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:47,987 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:48,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:48,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 100, 100] total 102 [2018-12-03 16:51:48,006 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:48,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 16:51:48,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 16:51:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:48,007 INFO L87 Difference]: Start difference. First operand 202 states and 250 transitions. Second operand 101 states. [2018-12-03 16:51:48,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:48,821 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2018-12-03 16:51:48,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 16:51:48,822 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2018-12-03 16:51:48,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:48,823 INFO L225 Difference]: With dead ends: 209 [2018-12-03 16:51:48,823 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 16:51:48,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 249 SyntacticMatches, 98 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16953 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 16:51:48,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2018-12-03 16:51:48,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-12-03 16:51:48,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 253 transitions. [2018-12-03 16:51:48,829 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 253 transitions. Word has length 199 [2018-12-03 16:51:48,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:48,830 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 253 transitions. [2018-12-03 16:51:48,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 16:51:48,830 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 253 transitions. [2018-12-03 16:51:48,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-03 16:51:48,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:48,831 INFO L402 BasicCegarLoop]: trace histogram [99, 50, 49, 1, 1, 1] [2018-12-03 16:51:48,831 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:48,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:48,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1862555477, now seen corresponding path program 61 times [2018-12-03 16:51:48,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:48,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:48,832 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:48,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:48,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:49,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 4950 proven. 2401 refuted. 0 times theorem prover too weak. 2450 trivial. 0 not checked. [2018-12-03 16:51:49,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:49,825 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:49,825 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:49,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:49,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:49,826 INFO L192 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 [2018-12-03 16:51:49,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:49,835 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:49,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:49,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:51,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:53,800 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:53,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:53,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 101, 101] total 102 [2018-12-03 16:51:53,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:53,819 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:51:53,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:51:53,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:53,820 INFO L87 Difference]: Start difference. First operand 204 states and 253 transitions. Second operand 102 states. [2018-12-03 16:51:54,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:54,746 INFO L93 Difference]: Finished difference Result 210 states and 260 transitions. [2018-12-03 16:51:54,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 16:51:54,746 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2018-12-03 16:51:54,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:54,748 INFO L225 Difference]: With dead ends: 210 [2018-12-03 16:51:54,748 INFO L226 Difference]: Without dead ends: 206 [2018-12-03 16:51:54,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 252 SyntacticMatches, 100 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17200 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:51:54,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-03 16:51:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-12-03 16:51:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 16:51:54,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 256 transitions. [2018-12-03 16:51:54,754 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 256 transitions. Word has length 201 [2018-12-03 16:51:54,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:54,754 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 256 transitions. [2018-12-03 16:51:54,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:51:54,755 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2018-12-03 16:51:54,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-12-03 16:51:54,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:54,756 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1] [2018-12-03 16:51:54,756 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:54,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:54,756 INFO L82 PathProgramCache]: Analyzing trace with hash 1085307248, now seen corresponding path program 62 times [2018-12-03 16:51:54,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:54,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:54,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:54,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:54,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:54,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 7450 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 16:51:55,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:51:55,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2018-12-03 16:51:55,909 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:51:55,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:51:55,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:51:55,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:51:55,910 INFO L87 Difference]: Start difference. First operand 206 states and 256 transitions. Second operand 53 states. [2018-12-03 16:51:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:56,452 INFO L93 Difference]: Finished difference Result 2756 states and 4081 transitions. [2018-12-03 16:51:56,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:51:56,452 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 203 [2018-12-03 16:51:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:56,461 INFO L225 Difference]: With dead ends: 2756 [2018-12-03 16:51:56,462 INFO L226 Difference]: Without dead ends: 2755 [2018-12-03 16:51:56,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:51:56,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2018-12-03 16:51:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 205. [2018-12-03 16:51:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 16:51:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 255 transitions. [2018-12-03 16:51:56,515 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 255 transitions. Word has length 203 [2018-12-03 16:51:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:56,516 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 255 transitions. [2018-12-03 16:51:56,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:51:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 255 transitions. [2018-12-03 16:51:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 16:51:56,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:56,517 INFO L402 BasicCegarLoop]: trace histogram [100, 50, 50, 1, 1, 1, 1] [2018-12-03 16:51:56,517 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:56,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:56,518 INFO L82 PathProgramCache]: Analyzing trace with hash -715213634, now seen corresponding path program 1 times [2018-12-03 16:51:56,518 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:56,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:56,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:56,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:56,519 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:57,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 16:51:57,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:57,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:57,718 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 205 with the following transitions: [2018-12-03 16:51:57,718 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [9], [12], [14], [15] [2018-12-03 16:51:57,719 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:51:57,719 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:51:57,771 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:51:57,771 INFO L272 AbstractInterpreter]: Visited 7 different actions 35 times. Merged at 5 different actions 16 times. Widened at 1 different actions 2 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-12-03 16:51:57,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:57,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:51:57,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:57,790 INFO L192 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 [2018-12-03 16:51:57,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:57,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:57,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 16:51:57,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:58,873 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 16:51:58,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:58,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 51 [2018-12-03 16:51:58,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:58,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:51:58,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:51:58,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:51:58,894 INFO L87 Difference]: Start difference. First operand 205 states and 255 transitions. Second operand 53 states. [2018-12-03 16:51:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:59,926 INFO L93 Difference]: Finished difference Result 2859 states and 4234 transitions. [2018-12-03 16:51:59,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:51:59,931 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 204 [2018-12-03 16:51:59,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:59,944 INFO L225 Difference]: With dead ends: 2859 [2018-12-03 16:51:59,944 INFO L226 Difference]: Without dead ends: 2856 [2018-12-03 16:51:59,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 356 SyntacticMatches, 50 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:51:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2018-12-03 16:52:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 207. [2018-12-03 16:52:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-12-03 16:52:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 258 transitions. [2018-12-03 16:52:00,030 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 258 transitions. Word has length 204 [2018-12-03 16:52:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:00,030 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 258 transitions. [2018-12-03 16:52:00,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:52:00,031 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 258 transitions. [2018-12-03 16:52:00,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-12-03 16:52:00,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:00,032 INFO L402 BasicCegarLoop]: trace histogram [101, 51, 50, 1, 1, 1, 1] [2018-12-03 16:52:00,032 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT, mainErr1ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:00,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:00,033 INFO L82 PathProgramCache]: Analyzing trace with hash -133074471, now seen corresponding path program 2 times [2018-12-03 16:52:00,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:00,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:00,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:00,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:00,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 7651 proven. 0 refuted. 0 times theorem prover too weak. 2550 trivial. 0 not checked. [2018-12-03 16:52:01,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:52:01,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2018-12-03 16:52:01,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:52:01,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:52:01,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:52:01,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:52:01,100 INFO L87 Difference]: Start difference. First operand 207 states and 258 transitions. Second operand 52 states. [2018-12-03 16:52:01,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:01,873 INFO L93 Difference]: Finished difference Result 306 states and 406 transitions. [2018-12-03 16:52:01,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:52:01,874 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 206 [2018-12-03 16:52:01,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:01,875 INFO L225 Difference]: With dead ends: 306 [2018-12-03 16:52:01,875 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 16:52:01,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:52:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 16:52:01,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 16:52:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 16:52:01,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 16:52:01,877 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2018-12-03 16:52:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:01,878 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 16:52:01,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:52:01,878 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 16:52:01,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 16:52:01,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 16:52:19,743 WARN L180 SmtUtils]: Spent 17.84 s on a formula simplification. DAG size of input: 3207 DAG size of output: 3056 [2018-12-03 16:53:24,458 WARN L180 SmtUtils]: Spent 1.08 m on a formula simplification. DAG size of input: 3056 DAG size of output: 407 [2018-12-03 16:53:24,463 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 24) no Hoare annotation was computed. [2018-12-03 16:53:24,463 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 11 26) no Hoare annotation was computed. [2018-12-03 16:53:24,463 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-03 16:53:24,463 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 11 26) no Hoare annotation was computed. [2018-12-03 16:53:24,463 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-03 16:53:24,464 INFO L448 ceAbstractionStarter]: For program point L16(lines 16 21) no Hoare annotation was computed. [2018-12-03 16:53:24,465 INFO L444 ceAbstractionStarter]: At program point L16-2(lines 15 22) the Hoare annotation is: (or (and (<= 83 x) (and (<= y 83) (and (<= x 83) (<= 83 y)))) (and (and (and (<= x 71) (<= 71 y)) (<= y 71)) (<= 71 x)) (and (and (<= y 75) (and (<= x 75) (<= 75 y))) (<= 75 x)) (and (<= 68 x) (and (and (<= 68 y) (<= x 68)) (<= y 68))) (and (<= 82 x) (and (and (<= x 82) (<= 82 y)) (<= y 82))) (and (<= 92 x) (and (<= y 92) (and (<= 92 y) (<= x 92)))) (and (<= 88 x) (and (and (<= x 88) (<= 88 y)) (<= y 88))) (and (<= 57 x) (and (and (<= x 57) (<= 57 y)) (<= y 57))) (and (and (<= y 58) (and (<= 58 y) (<= x 58))) (<= 58 x)) (and (and (<= y 91) (and (<= 91 y) (<= x 91))) (<= 91 x)) (and (<= 74 x) (and (and (<= x 74) (<= 74 y)) (<= y 74))) (and (and (and (<= x 72) (<= 72 y)) (<= y 72)) (<= 72 x)) (and (<= 87 x) (and (<= y 87) (and (<= 87 y) (<= x 87)))) (and (and (and (<= 60 y) (<= x 60)) (<= y 60)) (<= 60 x)) (and (and (and (<= x 76) (<= 76 y)) (<= y 76)) (<= 76 x)) (and (<= 56 x) (and (and (<= x 56) (<= 56 y)) (<= y 56))) (and (<= 100 x) (and (<= 100 y) (<= y 100))) (and (<= 53 x) (and (and (<= 53 y) (<= x 53)) (<= y 53))) (and (<= 86 x) (and (<= y 86) (and (<= 86 y) (<= x 86)))) (and (and (<= y 79) (and (<= 79 y) (<= x 79))) (<= 79 x)) (and (and (and (<= 99 y) (<= x 99)) (<= y 99)) (<= 99 x)) (and (and (<= y 78) (and (<= 78 y) (<= x 78))) (<= 78 x)) (and (and (<= y 63) (and (<= 63 y) (<= x 63))) (<= 63 x)) (and (and (and (<= x 94) (<= 94 y)) (<= y 94)) (<= 94 x)) (and (and (<= y 55) (and (<= x 55) (<= 55 y))) (<= 55 x)) (and (<= 70 x) (and (and (<= 70 y) (<= x 70)) (<= y 70))) (and (<= 85 x) (and (<= y 85) (and (<= 85 y) (<= x 85)))) (and (<= 54 x) (and (and (<= x 54) (<= 54 y)) (<= y 54))) (and (and (and (<= x 89) (<= 89 y)) (<= y 89)) (<= 89 x)) (and (and (and (<= 69 y) (<= x 69)) (<= y 69)) (<= 69 x)) (and (<= 64 x) (and (<= y 64) (and (<= 64 y) (<= x 64)))) (and (and (and (<= x 59) (<= 59 y)) (<= y 59)) (<= 59 x)) (and (and (and (<= 97 y) (<= x 97)) (<= y 97)) (<= 97 x)) (and (<= 52 x) (and (and (<= 52 y) (<= x 52)) (<= y 52))) (and (<= 61 x) (and (<= y 61) (and (<= 61 y) (<= x 61)))) (and (<= 84 x) (and (and (<= x 84) (<= 84 y)) (<= y 84))) (and (<= 80 x) (and (<= y 80) (and (<= x 80) (<= 80 y)))) (and (<= 95 x) (and (<= y 95) (and (<= x 95) (<= 95 y)))) (and (and (<= y 65) (and (<= 65 y) (<= x 65))) (<= 65 x)) (and (and (<= y 77) (and (<= 77 y) (<= x 77))) (<= 77 x)) (and (and (<= y 90) (and (<= x 90) (<= 90 y))) (<= 90 x)) (and (<= 51 x) (and (and (<= x 51) (<= 51 y)) (<= y 51))) (and (<= 73 x) (and (<= y 73) (and (<= x 73) (<= 73 y)))) (and (and (and (<= x 93) (<= 93 y)) (<= y 93)) (<= 93 x)) (and (and (<= y 81) (and (<= x 81) (<= 81 y))) (<= 81 x)) (and (and (and (<= 67 y) (<= x 67)) (<= y 67)) (<= 67 x)) (and (<= 62 x) (and (<= y 62) (and (<= 62 y) (<= x 62)))) (and (<= 98 x) (and (<= y 98) (and (<= x 98) (<= 98 y)))) (and (<= y 50) (and (<= 50 y) (<= x 50))) (and (<= 96 x) (and (<= y 96) (and (<= 96 y) (<= x 96)))) (and (and (and (<= x 66) (<= 66 y)) (<= y 66)) (<= 66 x))) [2018-12-03 16:53:24,465 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 11 26) no Hoare annotation was computed. [2018-12-03 16:53:24,465 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONASSERT(line 25) no Hoare annotation was computed. [2018-12-03 16:53:24,487 INFO L202 PluginConnector]: Adding new model BeyerHenzingerMajumdarRybalchenko-PLDI2007-Figure4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:53:24 BoogieIcfgContainer [2018-12-03 16:53:24,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:53:24,489 INFO L168 Benchmark]: Toolchain (without parser) took 224928.50 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.5 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-12-03 16:53:24,489 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:53:24,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:53:24,490 INFO L168 Benchmark]: Boogie Preprocessor took 23.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:53:24,491 INFO L168 Benchmark]: RCFGBuilder took 319.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:53:24,491 INFO L168 Benchmark]: TraceAbstraction took 224549.65 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2018-12-03 16:53:24,493 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 32.83 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 319.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 224549.65 ms. Allocated memory was 1.5 GB in the beginning and 3.7 GB in the end (delta: 2.2 GB). Free memory was 1.4 GB in the beginning and 3.0 GB in the end (delta: -1.6 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 24]: assertion always holds For all program executions holds that assertion always holds at this location - PositiveResult [Line: 25]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((83 <= x && y <= 83 && x <= 83 && 83 <= y) || (((x <= 71 && 71 <= y) && y <= 71) && 71 <= x)) || ((y <= 75 && x <= 75 && 75 <= y) && 75 <= x)) || (68 <= x && (68 <= y && x <= 68) && y <= 68)) || (82 <= x && (x <= 82 && 82 <= y) && y <= 82)) || (92 <= x && y <= 92 && 92 <= y && x <= 92)) || (88 <= x && (x <= 88 && 88 <= y) && y <= 88)) || (57 <= x && (x <= 57 && 57 <= y) && y <= 57)) || ((y <= 58 && 58 <= y && x <= 58) && 58 <= x)) || ((y <= 91 && 91 <= y && x <= 91) && 91 <= x)) || (74 <= x && (x <= 74 && 74 <= y) && y <= 74)) || (((x <= 72 && 72 <= y) && y <= 72) && 72 <= x)) || (87 <= x && y <= 87 && 87 <= y && x <= 87)) || (((60 <= y && x <= 60) && y <= 60) && 60 <= x)) || (((x <= 76 && 76 <= y) && y <= 76) && 76 <= x)) || (56 <= x && (x <= 56 && 56 <= y) && y <= 56)) || (100 <= x && 100 <= y && y <= 100)) || (53 <= x && (53 <= y && x <= 53) && y <= 53)) || (86 <= x && y <= 86 && 86 <= y && x <= 86)) || ((y <= 79 && 79 <= y && x <= 79) && 79 <= x)) || (((99 <= y && x <= 99) && y <= 99) && 99 <= x)) || ((y <= 78 && 78 <= y && x <= 78) && 78 <= x)) || ((y <= 63 && 63 <= y && x <= 63) && 63 <= x)) || (((x <= 94 && 94 <= y) && y <= 94) && 94 <= x)) || ((y <= 55 && x <= 55 && 55 <= y) && 55 <= x)) || (70 <= x && (70 <= y && x <= 70) && y <= 70)) || (85 <= x && y <= 85 && 85 <= y && x <= 85)) || (54 <= x && (x <= 54 && 54 <= y) && y <= 54)) || (((x <= 89 && 89 <= y) && y <= 89) && 89 <= x)) || (((69 <= y && x <= 69) && y <= 69) && 69 <= x)) || (64 <= x && y <= 64 && 64 <= y && x <= 64)) || (((x <= 59 && 59 <= y) && y <= 59) && 59 <= x)) || (((97 <= y && x <= 97) && y <= 97) && 97 <= x)) || (52 <= x && (52 <= y && x <= 52) && y <= 52)) || (61 <= x && y <= 61 && 61 <= y && x <= 61)) || (84 <= x && (x <= 84 && 84 <= y) && y <= 84)) || (80 <= x && y <= 80 && x <= 80 && 80 <= y)) || (95 <= x && y <= 95 && x <= 95 && 95 <= y)) || ((y <= 65 && 65 <= y && x <= 65) && 65 <= x)) || ((y <= 77 && 77 <= y && x <= 77) && 77 <= x)) || ((y <= 90 && x <= 90 && 90 <= y) && 90 <= x)) || (51 <= x && (x <= 51 && 51 <= y) && y <= 51)) || (73 <= x && y <= 73 && x <= 73 && 73 <= y)) || (((x <= 93 && 93 <= y) && y <= 93) && 93 <= x)) || ((y <= 81 && x <= 81 && 81 <= y) && 81 <= x)) || (((67 <= y && x <= 67) && y <= 67) && 67 <= x)) || (62 <= x && y <= 62 && 62 <= y && x <= 62)) || (98 <= x && y <= 98 && x <= 98 && 98 <= y)) || (y <= 50 && 50 <= y && x <= 50)) || (96 <= x && y <= 96 && 96 <= y && x <= 96)) || (((x <= 66 && 66 <= y) && y <= 66) && 66 <= x) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 2 error locations. SAFE Result, 224.4s OverallTime, 66 OverallIterations, 101 TraceHistogramMax, 19.2s AutomataDifference, 0.0s DeadEndRemovalTime, 82.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 1688 SDslu, 3389 SDs, 0 SdLazy, 7221 SolverSat, 2416 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13508 GetRequests, 9157 SyntacticMatches, 1178 SemanticMatches, 3173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126943 ImplicationChecksByTransitivity, 112.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=207occurred in iteration=65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 3 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 66 MinimizatonAttempts, 5227 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 758 HoareAnnotationTreeSize, 1 FomulaSimplifications, 669 FormulaSimplificationTreeSizeReduction, 17.8s HoareSimplificationTime, 1 FomulaSimplificationsInter, 334056 FormulaSimplificationTreeSizeReductionInter, 64.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 115.8s InterpolantComputationTime, 12096 NumberOfCodeBlocks, 11506 NumberOfCodeBlocksAsserted, 723 NumberOfCheckSat, 17746 ConstructedInterpolants, 0 QuantifiedInterpolants, 5296220 SizeOfPredicates, 50 NumberOfNonLiveVariables, 12529 ConjunctsInSsa, 1994 ConjunctsInUnsatCore, 192 InterpolantComputations, 5 PerfectInterpolantSequences, 272906/542273 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...