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/HiddenEqualityWithBranches.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:50:28,710 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:50:28,712 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:50:28,724 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:50:28,724 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:50:28,725 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:50:28,727 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:50:28,728 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:50:28,730 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:50:28,731 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:50:28,732 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:50:28,732 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:50:28,733 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:50:28,734 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:50:28,735 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:50:28,736 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:50:28,737 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:50:28,739 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:50:28,741 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:50:28,742 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:50:28,743 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:50:28,744 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:50:28,747 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:50:28,747 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:50:28,747 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:50:28,748 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:50:28,749 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:50:28,750 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:50:28,750 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:50:28,751 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:50:28,752 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:50:28,752 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:50:28,752 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:50:28,753 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:50:28,753 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:50:28,754 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:50:28,754 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:50:28,766 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:50:28,767 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:50:28,767 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:50:28,768 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:50:28,768 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:50:28,768 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:50:28,768 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:50:28,769 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:50:28,769 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:50:28,769 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:50:28,769 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:50:28,769 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:50:28,770 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:50:28,770 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:50:28,770 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:50:28,771 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:50:28,771 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:50:28,771 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:50:28,771 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:50:28,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:50:28,772 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:50:28,772 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:50:28,772 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:50:28,772 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:50:28,773 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:50:28,773 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:50:28,773 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:50:28,773 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:50:28,773 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:50:28,774 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:50:28,774 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:50:28,774 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:50:28,774 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:50:28,774 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:50:28,775 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:50:28,775 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:50:28,775 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:50:28,775 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:50:28,775 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:50:28,775 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:50:28,776 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:50:28,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:50:28,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:50:28,825 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:50:28,827 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:50:28,827 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:50:28,828 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl [2018-12-03 16:50:28,829 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/HiddenEqualityWithBranches.bpl' [2018-12-03 16:50:28,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:50:28,864 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:50:28,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:50:28,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:50:28,865 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:50:28,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:50:28" (1/1) ... [2018-12-03 16:50:28,893 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:50:28" (1/1) ... [2018-12-03 16:50:28,898 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:50:28,899 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:50:28,899 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:50:28,901 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:50:28,902 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:50:28,902 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:50:28,902 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:50:28,914 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:50:28" (1/1) ... [2018-12-03 16:50:28,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:50:28" (1/1) ... [2018-12-03 16:50:28,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:50:28" (1/1) ... [2018-12-03 16:50:28,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:50:28" (1/1) ... [2018-12-03 16:50:28,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:50:28" (1/1) ... [2018-12-03 16:50:28,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:50:28" (1/1) ... [2018-12-03 16:50:28,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:50:28" (1/1) ... [2018-12-03 16:50:28,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:50:28,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:50:28,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:50:28,926 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:50:28,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:50:28" (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:50:29,000 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 16:50:29,000 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 16:50:29,000 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 16:50:29,257 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:50:29,257 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:50:29,257 INFO L202 PluginConnector]: Adding new model HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:50:29 BoogieIcfgContainer [2018-12-03 16:50:29,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:50:29,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:50:29,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:50:29,262 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:50:29,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:50:28" (1/2) ... [2018-12-03 16:50:29,264 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242fdc10 and model type HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:50:29, skipping insertion in model container [2018-12-03 16:50:29,264 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "HiddenEqualityWithBranches.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:50:29" (2/2) ... [2018-12-03 16:50:29,267 INFO L112 eAbstractionObserver]: Analyzing ICFG HiddenEqualityWithBranches.bpl [2018-12-03 16:50:29,279 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:50:29,288 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:50:29,309 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:50:29,355 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:50:29,356 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:50:29,356 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:50:29,356 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:50:29,356 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:50:29,356 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:50:29,357 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:50:29,357 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:50:29,375 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:50:29,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2018-12-03 16:50:29,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:29,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1] [2018-12-03 16:50:29,393 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:29,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:29,402 INFO L82 PathProgramCache]: Analyzing trace with hash 978, now seen corresponding path program 1 times [2018-12-03 16:50:29,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:29,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:29,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:29,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:29,456 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:29,559 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:50:29,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:50:29,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 16:50:29,561 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:50:29,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:50:29,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:50:29,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:50:29,583 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:50:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:29,678 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2018-12-03 16:50:29,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:50:29,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2018-12-03 16:50:29,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:29,701 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:50:29,702 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:50:29,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:50:29,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:50:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:50:29,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:50:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 7 transitions. [2018-12-03 16:50:29,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 7 transitions. Word has length 2 [2018-12-03 16:50:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:29,775 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 7 transitions. [2018-12-03 16:50:29,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:50:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 7 transitions. [2018-12-03 16:50:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:50:29,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:29,776 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:50:29,777 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:29,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:29,777 INFO L82 PathProgramCache]: Analyzing trace with hash 931598, now seen corresponding path program 1 times [2018-12-03 16:50:29,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:29,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:29,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:29,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:29,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:29,821 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:50:29,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:50:29,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:50:29,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:50:29,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:50:29,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:50:29,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:50:29,824 INFO L87 Difference]: Start difference. First operand 5 states and 7 transitions. Second operand 3 states. [2018-12-03 16:50:29,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:29,841 INFO L93 Difference]: Finished difference Result 9 states and 14 transitions. [2018-12-03 16:50:29,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:50:29,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-12-03 16:50:29,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:29,842 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:50:29,842 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:50:29,843 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:50:29,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:50:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:50:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:50:29,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 8 transitions. [2018-12-03 16:50:29,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 8 transitions. Word has length 4 [2018-12-03 16:50:29,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:29,846 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 8 transitions. [2018-12-03 16:50:29,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:50:29,846 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 8 transitions. [2018-12-03 16:50:29,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:50:29,847 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:29,847 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:50:29,847 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:29,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:29,848 INFO L82 PathProgramCache]: Analyzing trace with hash 931660, now seen corresponding path program 1 times [2018-12-03 16:50:29,848 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:29,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:29,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:29,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:29,849 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:29,892 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:50:29,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:29,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:29,893 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:50:29,895 INFO L205 CegarAbsIntRunner]: [0], [8], [14], [17] [2018-12-03 16:50:29,944 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:50:29,944 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:50:30,120 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:50:30,122 INFO L272 AbstractInterpreter]: Visited 4 different actions 13 times. Merged at 3 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:50:30,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:30,136 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:50:30,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:30,137 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:50:30,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:30,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:30,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:30,184 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:50:30,185 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:30,430 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:50:30,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:30,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2018-12-03 16:50:30,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:30,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:50:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:50:30,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:50:30,451 INFO L87 Difference]: Start difference. First operand 6 states and 8 transitions. Second operand 4 states. [2018-12-03 16:50:30,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:30,490 INFO L93 Difference]: Finished difference Result 10 states and 16 transitions. [2018-12-03 16:50:30,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:50:30,491 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 16:50:30,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:30,492 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:50:30,492 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:50:30,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:50:30,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:50:30,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:50:30,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:50:30,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 9 transitions. [2018-12-03 16:50:30,496 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 9 transitions. Word has length 4 [2018-12-03 16:50:30,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:30,496 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 9 transitions. [2018-12-03 16:50:30,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:50:30,497 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2018-12-03 16:50:30,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:50:30,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:30,497 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 16:50:30,498 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:30,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:30,498 INFO L82 PathProgramCache]: Analyzing trace with hash 895317000, now seen corresponding path program 1 times [2018-12-03 16:50:30,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:30,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:30,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:30,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:30,500 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:30,552 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:50:30,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:30,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:30,553 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-03 16:50:30,553 INFO L205 CegarAbsIntRunner]: [0], [8], [12], [14], [17] [2018-12-03 16:50:30,554 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:50:30,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:50:30,614 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:50:30,614 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 4 different actions 7 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:50:30,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:30,635 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:50:30,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:30,635 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:50:30,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:30,646 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:30,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:30,680 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:50:30,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:30,761 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:50:30,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:30,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:50:30,780 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:30,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:50:30,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:50:30,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:50:30,782 INFO L87 Difference]: Start difference. First operand 7 states and 9 transitions. Second operand 4 states. [2018-12-03 16:50:30,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:30,874 INFO L93 Difference]: Finished difference Result 11 states and 16 transitions. [2018-12-03 16:50:30,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:50:30,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 16:50:30,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:30,876 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:50:30,876 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:50:30,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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:50:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:50:30,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:50:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:50:30,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 10 transitions. [2018-12-03 16:50:30,882 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 10 transitions. Word has length 6 [2018-12-03 16:50:30,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:30,883 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 10 transitions. [2018-12-03 16:50:30,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:50:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 10 transitions. [2018-12-03 16:50:30,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:50:30,884 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:30,884 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1] [2018-12-03 16:50:30,884 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:30,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:30,884 INFO L82 PathProgramCache]: Analyzing trace with hash 895317062, now seen corresponding path program 2 times [2018-12-03 16:50:30,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:30,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:30,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:30,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:31,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:31,035 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:31,036 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:31,038 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:31,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:31,038 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:50:31,062 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:31,062 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:31,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:50:31,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:31,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:31,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:31,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:31,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:31,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:31,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2018-12-03 16:50:31,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:31,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:50:31,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:50:31,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:50:31,207 INFO L87 Difference]: Start difference. First operand 8 states and 10 transitions. Second operand 5 states. [2018-12-03 16:50:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:31,297 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2018-12-03 16:50:31,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:50:31,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2018-12-03 16:50:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:31,298 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:50:31,298 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:50:31,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:50:31,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:50:31,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:50:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:50:31,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-03 16:50:31,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 11 transitions. Word has length 6 [2018-12-03 16:50:31,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:31,303 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-03 16:50:31,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:50:31,303 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 11 transitions. [2018-12-03 16:50:31,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:50:31,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:31,304 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-12-03 16:50:31,304 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:31,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:31,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1406229122, now seen corresponding path program 2 times [2018-12-03 16:50:31,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:31,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:31,306 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:31,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:31,306 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:31,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:31,360 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:50:31,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:31,361 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:31,361 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:31,361 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:31,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:31,362 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:50:31,372 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:31,372 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:31,384 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:50:31,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:31,385 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:31,561 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:31,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:31,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:31,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-03 16:50:31,675 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:31,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:50:31,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:50:31,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-12-03 16:50:31,677 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. Second operand 9 states. [2018-12-03 16:50:31,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:31,900 INFO L93 Difference]: Finished difference Result 14 states and 21 transitions. [2018-12-03 16:50:31,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:50:31,901 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 8 [2018-12-03 16:50:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:31,902 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:50:31,902 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:50:31,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2018-12-03 16:50:31,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:50:31,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:50:31,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:50:31,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-12-03 16:50:31,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 13 transitions. Word has length 8 [2018-12-03 16:50:31,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:31,907 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-12-03 16:50:31,907 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:50:31,907 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 13 transitions. [2018-12-03 16:50:31,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:50:31,908 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:31,908 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-12-03 16:50:31,908 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:31,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:31,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1528460676, now seen corresponding path program 3 times [2018-12-03 16:50:31,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:31,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:31,910 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:31,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:31,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:32,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:32,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:32,219 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:32,219 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:32,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:32,219 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:50:32,228 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:32,229 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:32,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:32,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:32,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:32,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:32,339 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:32,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:32,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:50:32,359 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:32,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:50:32,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:50:32,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:50:32,361 INFO L87 Difference]: Start difference. First operand 11 states and 13 transitions. Second operand 6 states. [2018-12-03 16:50:32,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:32,404 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2018-12-03 16:50:32,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:50:32,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-12-03 16:50:32,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:32,406 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:50:32,406 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:50:32,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:50:32,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:50:32,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:50:32,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:50:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 16:50:32,410 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 10 [2018-12-03 16:50:32,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:32,411 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 16:50:32,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:50:32,411 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 16:50:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:50:32,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:32,412 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1] [2018-12-03 16:50:32,412 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:32,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:32,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1528460614, now seen corresponding path program 3 times [2018-12-03 16:50:32,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:32,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:32,413 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:32,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:32,414 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:32,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:32,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:32,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:32,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:32,497 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:32,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:32,498 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:50:32,510 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:32,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:32,526 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:32,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:32,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:32,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:32,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:32,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:32,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 16:50:32,657 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:32,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:50:32,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:50:32,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:50:32,659 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2018-12-03 16:50:32,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:32,676 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2018-12-03 16:50:32,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:50:32,679 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2018-12-03 16:50:32,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:32,680 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:50:32,680 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:50:32,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:50:32,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:50:32,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:50:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:50:32,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 15 transitions. [2018-12-03 16:50:32,684 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 15 transitions. Word has length 10 [2018-12-03 16:50:32,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:32,684 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 15 transitions. [2018-12-03 16:50:32,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:50:32,685 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 15 transitions. [2018-12-03 16:50:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:50:32,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:32,685 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-12-03 16:50:32,686 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:32,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash 28156918, now seen corresponding path program 4 times [2018-12-03 16:50:32,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:32,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:32,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:32,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:32,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:32,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:32,745 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:32,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:32,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:32,746 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:32,747 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:32,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:32,747 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:50:32,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:32,757 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:32,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:32,771 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:32,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:32,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:50:32,922 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:32,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:50:32,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:50:32,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:50:32,923 INFO L87 Difference]: Start difference. First operand 13 states and 15 transitions. Second operand 7 states. [2018-12-03 16:50:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:32,963 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2018-12-03 16:50:32,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:50:32,965 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-03 16:50:32,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:32,966 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:50:32,966 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:50:32,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:50:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:50:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:50:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:50:32,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 16:50:32,970 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 12 [2018-12-03 16:50:32,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:32,970 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 16:50:32,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:50:32,970 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 16:50:32,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:50:32,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:32,971 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1] [2018-12-03 16:50:32,971 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:32,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:32,971 INFO L82 PathProgramCache]: Analyzing trace with hash 28156980, now seen corresponding path program 4 times [2018-12-03 16:50:32,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:32,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:32,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:32,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:33,098 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:33,098 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:33,098 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:33,099 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,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:33,099 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:50:33,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:33,115 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:33,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:33,136 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:33,374 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:33,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:33,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2018-12-03 16:50:33,396 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:33,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:50:33,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:50:33,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:50:33,397 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2018-12-03 16:50:33,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:33,429 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2018-12-03 16:50:33,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:50:33,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 12 [2018-12-03 16:50:33,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:33,431 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:50:33,432 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:50:33,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:50:33,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:50:33,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:50:33,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:50:33,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2018-12-03 16:50:33,436 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2018-12-03 16:50:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:33,436 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2018-12-03 16:50:33,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:50:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2018-12-03 16:50:33,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:50:33,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:33,437 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-12-03 16:50:33,438 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:33,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:33,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1289045744, now seen corresponding path program 5 times [2018-12-03 16:50:33,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:33,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:33,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:33,566 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:33,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:33,567 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:33,567 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:33,568 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,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:33,568 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:50:33,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:33,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:33,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:50:33,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:33,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:33,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:33,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:33,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:50:33,747 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:33,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:50:33,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:50:33,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:50:33,749 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 8 states. [2018-12-03 16:50:33,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:33,783 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2018-12-03 16:50:33,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:50:33,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-03 16:50:33,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:33,784 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:50:33,785 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:50:33,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:50:33,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:50:33,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:50:33,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:50:33,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2018-12-03 16:50:33,790 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14 [2018-12-03 16:50:33,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:33,790 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2018-12-03 16:50:33,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:50:33,790 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2018-12-03 16:50:33,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:50:33,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:33,791 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1] [2018-12-03 16:50:33,791 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:33,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:33,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1289045806, now seen corresponding path program 5 times [2018-12-03 16:50:33,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:33,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:33,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:33,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:33,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:33,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:33,892 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:33,892 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:33,893 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,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:33,893 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:50:33,903 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:33,903 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:33,913 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:50:33,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:33,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:33,922 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:33,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:34,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:34,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2018-12-03 16:50:34,105 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:34,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:50:34,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:50:34,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:50:34,106 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 9 states. [2018-12-03 16:50:34,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:34,135 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2018-12-03 16:50:34,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:50:34,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 14 [2018-12-03 16:50:34,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:34,136 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:50:34,136 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:50:34,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:50:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:50:34,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:50:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:50:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-03 16:50:34,142 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 14 [2018-12-03 16:50:34,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:34,142 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-03 16:50:34,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:50:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-12-03 16:50:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:50:34,143 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:34,143 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-12-03 16:50:34,143 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:34,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:34,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1822430058, now seen corresponding path program 6 times [2018-12-03 16:50:34,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:34,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:34,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:34,145 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:34,251 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:34,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:34,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:34,252 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:34,252 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:34,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:34,252 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:50:34,261 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:34,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:34,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:34,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:34,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:34,280 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:34,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 7 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:34,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:34,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:50:34,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:34,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:50:34,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:50:34,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:50:34,636 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 9 states. [2018-12-03 16:50:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:34,703 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2018-12-03 16:50:34,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:50:34,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-12-03 16:50:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:34,703 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:50:34,703 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:50:34,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 24 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:50:34,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:50:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:50:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:50:34,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-12-03 16:50:34,708 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 16 [2018-12-03 16:50:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:34,708 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-12-03 16:50:34,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:50:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-12-03 16:50:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:50:34,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:34,709 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1] [2018-12-03 16:50:34,709 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:34,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:34,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1822430120, now seen corresponding path program 6 times [2018-12-03 16:50:34,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:34,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:34,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:34,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:34,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:34,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:34,834 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:34,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:34,834 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:34,834 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:34,834 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:34,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:34,835 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:50:34,844 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:34,844 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:34,861 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:34,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:34,862 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:34,870 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:34,871 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:35,045 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:35,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:35,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 16 [2018-12-03 16:50:35,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:35,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:50:35,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:50:35,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:50:35,068 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 10 states. [2018-12-03 16:50:35,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:35,096 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2018-12-03 16:50:35,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:50:35,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-12-03 16:50:35,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:35,097 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:50:35,097 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:50:35,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 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:50:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:50:35,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:50:35,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:50:35,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-12-03 16:50:35,102 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2018-12-03 16:50:35,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:35,102 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-12-03 16:50:35,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:50:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-12-03 16:50:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:50:35,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:35,103 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-12-03 16:50:35,103 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:35,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:35,104 INFO L82 PathProgramCache]: Analyzing trace with hash -991319708, now seen corresponding path program 7 times [2018-12-03 16:50:35,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:35,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:35,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:35,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:35,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:35,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:35,202 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:35,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:35,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:35,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:35,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:35,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:35,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 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:50:35,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:35,214 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:35,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:35,242 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:35,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:35,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:50:35,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:35,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:50:35,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:50:35,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:50:35,413 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 10 states. [2018-12-03 16:50:35,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:35,445 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2018-12-03 16:50:35,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:50:35,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-12-03 16:50:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:35,446 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:50:35,447 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:50:35,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 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:50:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:50:35,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:50:35,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:50:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-03 16:50:35,451 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 18 [2018-12-03 16:50:35,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:35,452 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-03 16:50:35,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:50:35,452 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-03 16:50:35,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:50:35,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:35,453 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1] [2018-12-03 16:50:35,453 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:35,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:35,454 INFO L82 PathProgramCache]: Analyzing trace with hash -991319646, now seen corresponding path program 7 times [2018-12-03 16:50:35,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:35,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:35,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:35,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:35,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:35,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:35,575 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:35,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:35,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:35,575 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:35,575 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,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:35,576 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:50:35,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:35,585 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:35,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:35,603 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:35,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:35,991 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:36,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:36,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2018-12-03 16:50:36,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:36,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:50:36,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:50:36,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:50:36,024 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 11 states. [2018-12-03 16:50:36,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:36,314 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2018-12-03 16:50:36,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:50:36,314 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2018-12-03 16:50:36,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:36,315 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:50:36,315 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:50:36,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:50:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:50:36,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:50:36,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:50:36,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-03 16:50:36,322 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 18 [2018-12-03 16:50:36,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:36,322 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-03 16:50:36,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:50:36,322 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-03 16:50:36,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:50:36,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:36,323 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-12-03 16:50:36,323 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:36,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:36,324 INFO L82 PathProgramCache]: Analyzing trace with hash 824551646, now seen corresponding path program 8 times [2018-12-03 16:50:36,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:36,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:36,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:36,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:36,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:36,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:36,499 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 9 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:36,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:36,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:36,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:36,500 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:36,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:36,500 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:50:36,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:36,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:36,521 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:50:36,522 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:36,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:36,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:36,922 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:36,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:36,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-03 16:50:36,942 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:36,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:50:36,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:50:36,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=645, Unknown=0, NotChecked=0, Total=930 [2018-12-03 16:50:36,943 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 21 states. [2018-12-03 16:50:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:37,500 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2018-12-03 16:50:37,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:50:37,501 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 20 [2018-12-03 16:50:37,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:37,502 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:50:37,502 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:50:37,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=843, Invalid=1509, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 16:50:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:50:37,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:50:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:50:37,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-12-03 16:50:37,508 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2018-12-03 16:50:37,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:37,508 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-12-03 16:50:37,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:50:37,509 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-12-03 16:50:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:50:37,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:37,509 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-12-03 16:50:37,510 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:37,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:37,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2120200664, now seen corresponding path program 9 times [2018-12-03 16:50:37,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:37,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:37,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:37,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:37,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:37,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:37,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:37,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:37,754 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:37,754 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,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:37,754 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:50:37,768 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:37,768 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:37,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:37,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:37,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:37,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:38,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:38,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:50:38,008 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:38,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:50:38,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:50:38,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:50:38,009 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 12 states. [2018-12-03 16:50:38,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:38,109 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2018-12-03 16:50:38,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:50:38,110 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-12-03 16:50:38,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:38,110 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:50:38,111 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:50:38,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:50:38,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:50:38,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:50:38,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:50:38,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 16:50:38,115 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 22 [2018-12-03 16:50:38,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:38,115 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 16:50:38,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:50:38,115 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 16:50:38,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:50:38,116 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:38,116 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1] [2018-12-03 16:50:38,116 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:38,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash 2120200726, now seen corresponding path program 8 times [2018-12-03 16:50:38,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:38,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:38,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:38,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:38,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:38,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:38,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:38,433 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:38,433 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:38,433 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:38,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:38,433 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:50:38,443 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:38,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:38,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 16:50:38,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:38,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:38,463 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:38,463 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:38,717 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:38,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:38,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2018-12-03 16:50:38,736 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:38,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:50:38,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:50:38,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:50:38,737 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 13 states. [2018-12-03 16:50:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:38,772 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-12-03 16:50:38,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:50:38,773 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 22 [2018-12-03 16:50:38,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:38,774 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:50:38,774 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:50:38,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 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:50:38,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:50:38,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:50:38,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:50:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-03 16:50:38,779 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 22 [2018-12-03 16:50:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:38,779 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-03 16:50:38,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:50:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-03 16:50:38,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:50:38,780 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:38,781 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-12-03 16:50:38,781 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:38,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:38,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1698391122, now seen corresponding path program 10 times [2018-12-03 16:50:38,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:38,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:38,782 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:38,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:38,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:39,229 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:39,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:39,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:39,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:39,230 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:39,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:39,230 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:50:39,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:39,239 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:39,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:39,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:39,745 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 11 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:39,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:39,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:50:39,765 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:39,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:50:39,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:50:39,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:50:39,766 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2018-12-03 16:50:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:39,796 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-12-03 16:50:39,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:50:39,797 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-12-03 16:50:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:39,798 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:50:39,798 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:50:39,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:50:39,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:50:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:50:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:50:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 16:50:39,803 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 24 [2018-12-03 16:50:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:39,803 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 16:50:39,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:50:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 16:50:39,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:50:39,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:39,804 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1] [2018-12-03 16:50:39,804 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:39,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:39,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1698391184, now seen corresponding path program 9 times [2018-12-03 16:50:39,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:39,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:39,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:39,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:39,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:39,966 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:39,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:39,967 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:39,967 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:39,968 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:39,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:39,968 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:50:39,977 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:39,977 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:39,988 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:39,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:39,992 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:39,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:40,429 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:40,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:40,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2018-12-03 16:50:40,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:40,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:50:40,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:50:40,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:50:40,450 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 14 states. [2018-12-03 16:50:40,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:40,487 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2018-12-03 16:50:40,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:50:40,488 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-12-03 16:50:40,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:40,489 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:50:40,489 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:50:40,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:50:40,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:50:40,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:50:40,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:50:40,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-12-03 16:50:40,494 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 24 [2018-12-03 16:50:40,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:40,495 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-12-03 16:50:40,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:50:40,495 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-12-03 16:50:40,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:50:40,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:40,496 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-12-03 16:50:40,496 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:40,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:40,496 INFO L82 PathProgramCache]: Analyzing trace with hash 66347084, now seen corresponding path program 11 times [2018-12-03 16:50:40,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:40,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:40,497 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:40,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:40,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:40,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:40,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:40,671 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:40,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:50:40,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:40,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 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:50:40,680 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:40,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:40,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:50:40,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:40,699 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:40,703 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:40,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:40,910 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 12 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:40,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:40,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 16:50:40,930 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:40,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:50:40,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:50:40,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:50:40,931 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 14 states. [2018-12-03 16:50:41,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:41,004 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-12-03 16:50:41,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:50:41,006 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-12-03 16:50:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:41,007 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:50:41,007 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:50:41,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 39 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:50:41,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:50:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:50:41,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:50:41,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-03 16:50:41,012 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 26 [2018-12-03 16:50:41,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:41,012 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-03 16:50:41,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:50:41,012 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-03 16:50:41,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:50:41,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:41,013 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1] [2018-12-03 16:50:41,013 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:41,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:41,014 INFO L82 PathProgramCache]: Analyzing trace with hash 66347146, now seen corresponding path program 10 times [2018-12-03 16:50:41,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:41,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:41,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:41,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:41,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:41,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:41,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:41,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:41,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:41,139 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:41,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:41,139 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:50:41,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:41,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:41,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:41,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:41,366 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:41,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:41,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 26 [2018-12-03 16:50:41,385 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:41,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:50:41,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:50:41,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:50:41,387 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 15 states. [2018-12-03 16:50:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:41,426 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-12-03 16:50:41,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:50:41,426 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2018-12-03 16:50:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:41,427 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:50:41,427 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:50:41,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:50:41,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:50:41,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 16:50:41,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:50:41,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-12-03 16:50:41,432 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 26 [2018-12-03 16:50:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:41,432 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-12-03 16:50:41,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:50:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-12-03 16:50:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:50:41,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:41,433 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-12-03 16:50:41,433 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:41,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:41,434 INFO L82 PathProgramCache]: Analyzing trace with hash -664910394, now seen corresponding path program 12 times [2018-12-03 16:50:41,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:41,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:41,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:41,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:41,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:41,627 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:41,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:41,627 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:41,628 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:41,628 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:41,628 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:41,628 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:50:41,637 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:41,637 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:41,648 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:41,649 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:41,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:41,656 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:41,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:42,191 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 13 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:42,210 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:42,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:50:42,210 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:42,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:50:42,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:50:42,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:50:42,211 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-12-03 16:50:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:42,238 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-03 16:50:42,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:50:42,239 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-12-03 16:50:42,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:42,239 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:50:42,239 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:50:42,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 42 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:50:42,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:50:42,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 16:50:42,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:50:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2018-12-03 16:50:42,246 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 28 [2018-12-03 16:50:42,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:42,247 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2018-12-03 16:50:42,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:50:42,247 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2018-12-03 16:50:42,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:50:42,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:42,248 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1] [2018-12-03 16:50:42,248 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:42,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:42,248 INFO L82 PathProgramCache]: Analyzing trace with hash -664910332, now seen corresponding path program 11 times [2018-12-03 16:50:42,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:42,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:42,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:42,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:42,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:42,431 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:42,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:42,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:42,432 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:42,432 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,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:42,432 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:50:42,441 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:42,441 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:42,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:50:42,463 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:42,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:42,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:43,236 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:43,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:43,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 28 [2018-12-03 16:50:43,256 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:43,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:50:43,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:50:43,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:50:43,257 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 16 states. [2018-12-03 16:50:43,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:43,283 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-12-03 16:50:43,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:50:43,284 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-12-03 16:50:43,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:43,284 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:50:43,284 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:50:43,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 40 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:50:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:50:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:50:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:50:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-03 16:50:43,290 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 28 [2018-12-03 16:50:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:43,290 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-03 16:50:43,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:50:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-03 16:50:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:50:43,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:43,291 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-12-03 16:50:43,291 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:43,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:43,291 INFO L82 PathProgramCache]: Analyzing trace with hash 971289792, now seen corresponding path program 13 times [2018-12-03 16:50:43,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:43,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:43,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:43,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:43,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:43,434 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:43,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:43,435 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:43,435 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:43,435 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:43,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:43,435 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:43,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:43,444 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:43,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:43,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 14 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:43,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:43,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:50:43,714 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:43,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:50:43,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:50:43,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:50:43,716 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 16 states. [2018-12-03 16:50:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:43,777 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-03 16:50:43,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:50:43,781 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-12-03 16:50:43,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:43,782 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:50:43,782 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:50:43,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:50:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:50:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 16:50:43,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:50:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-12-03 16:50:43,786 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 30 [2018-12-03 16:50:43,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:43,787 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-12-03 16:50:43,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:50:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-12-03 16:50:43,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:50:43,787 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:43,787 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1] [2018-12-03 16:50:43,788 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:43,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:43,788 INFO L82 PathProgramCache]: Analyzing trace with hash 971289854, now seen corresponding path program 12 times [2018-12-03 16:50:43,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:43,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:43,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:43,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:43,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:43,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:43,950 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:43,951 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:43,951 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:43,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:43,951 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:43,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:43,959 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:43,985 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:43,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:43,987 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:43,993 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:43,993 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:44,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:44,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2018-12-03 16:50:44,368 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:44,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:50:44,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:50:44,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:50:44,369 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 17 states. [2018-12-03 16:50:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:44,426 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2018-12-03 16:50:44,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:50:44,427 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-03 16:50:44,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:44,428 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:50:44,428 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:50:44,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:50:44,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:50:44,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:50:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:50:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-12-03 16:50:44,433 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2018-12-03 16:50:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:44,433 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-12-03 16:50:44,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:50:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-12-03 16:50:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:50:44,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:44,434 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-12-03 16:50:44,435 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:44,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:44,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1401638202, now seen corresponding path program 14 times [2018-12-03 16:50:44,435 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:44,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:44,436 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:44,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:44,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:44,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:44,751 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:44,751 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:44,751 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:44,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:44,752 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:44,760 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:44,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:44,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:50:44,797 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:44,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:44,804 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:44,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:45,290 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 15 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:45,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:45,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 16:50:45,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:45,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:50:45,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:50:45,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:50:45,310 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 17 states. [2018-12-03 16:50:45,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:45,348 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-12-03 16:50:45,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:50:45,348 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-12-03 16:50:45,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:45,349 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:50:45,349 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:50:45,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:50:45,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:50:45,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:50:45,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:50:45,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-12-03 16:50:45,356 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 32 [2018-12-03 16:50:45,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:45,356 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-12-03 16:50:45,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:50:45,358 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-12-03 16:50:45,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:50:45,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:45,358 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1] [2018-12-03 16:50:45,359 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:45,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1401638264, now seen corresponding path program 13 times [2018-12-03 16:50:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:45,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:45,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:45,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:45,597 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:45,597 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:45,597 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:45,597 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:45,598 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,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:45,598 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:45,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:45,608 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:45,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:45,631 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:45,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:46,281 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:46,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:46,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2018-12-03 16:50:46,300 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:46,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:50:46,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:50:46,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:50:46,301 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 18 states. [2018-12-03 16:50:46,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:46,332 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-12-03 16:50:46,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:50:46,333 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 32 [2018-12-03 16:50:46,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:46,333 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:50:46,334 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:50:46,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:50:46,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:50:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:50:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:50:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-12-03 16:50:46,338 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2018-12-03 16:50:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:46,338 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-12-03 16:50:46,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:50:46,339 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-12-03 16:50:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:50:46,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:46,339 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-12-03 16:50:46,339 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:46,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:46,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1645367500, now seen corresponding path program 15 times [2018-12-03 16:50:46,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:46,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:46,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:46,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:46,341 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:46,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:46,622 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:46,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:46,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:46,623 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:46,623 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:46,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:46,624 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:46,633 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:46,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:46,646 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:46,646 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:46,648 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:46,654 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:46,655 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 16 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:46,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:46,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:50:46,974 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:46,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:50:46,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:50:46,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:50:46,976 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 18 states. [2018-12-03 16:50:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:47,047 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-12-03 16:50:47,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:50:47,048 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-12-03 16:50:47,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:47,049 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:50:47,049 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:50:47,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:50:47,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:50:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:50:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:50:47,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-12-03 16:50:47,054 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 34 [2018-12-03 16:50:47,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:47,054 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-12-03 16:50:47,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:50:47,054 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-12-03 16:50:47,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:50:47,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:47,055 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1] [2018-12-03 16:50:47,055 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:47,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:47,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1645367438, now seen corresponding path program 14 times [2018-12-03 16:50:47,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:47,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:47,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:47,056 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:47,896 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:47,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:47,896 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:47,896 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:47,897 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:47,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:47,897 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:47,906 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:47,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:47,924 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 16:50:47,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:47,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:47,931 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:47,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:48,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:48,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2018-12-03 16:50:48,272 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:48,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:50:48,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:50:48,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:50:48,273 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 19 states. [2018-12-03 16:50:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:48,484 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-12-03 16:50:48,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:50:48,485 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 34 [2018-12-03 16:50:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:48,485 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:50:48,485 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:50:48,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:50:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:50:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:50:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:50:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-12-03 16:50:48,491 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2018-12-03 16:50:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:48,491 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-12-03 16:50:48,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:50:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-12-03 16:50:48,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:50:48,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:48,492 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-12-03 16:50:48,492 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:48,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:48,492 INFO L82 PathProgramCache]: Analyzing trace with hash -650151250, now seen corresponding path program 16 times [2018-12-03 16:50:48,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:48,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:48,493 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:48,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:48,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:48,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:48,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:48,828 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:48,829 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:48,829 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,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:48,829 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:48,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:48,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:48,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:48,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:48,860 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:48,860 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:49,171 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 17 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:49,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:49,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:50:49,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:49,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:50:49,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:50:49,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:50:49,191 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 19 states. [2018-12-03 16:50:49,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:49,272 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-12-03 16:50:49,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:50:49,273 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-12-03 16:50:49,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:49,273 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:50:49,273 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:50:49,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:50:49,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:50:49,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 16:50:49,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 16:50:49,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-03 16:50:49,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 36 [2018-12-03 16:50:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:49,279 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-03 16:50:49,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:50:49,279 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-03 16:50:49,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:50:49,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:49,280 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1] [2018-12-03 16:50:49,280 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:49,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:49,281 INFO L82 PathProgramCache]: Analyzing trace with hash -650151188, now seen corresponding path program 15 times [2018-12-03 16:50:49,281 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:49,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:49,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:49,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:49,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:49,476 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:49,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:49,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:49,476 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:49,476 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:49,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:49,477 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:49,485 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:49,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:49,502 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:49,502 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:49,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:49,507 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:49,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:50,217 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:50,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:50,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 36 [2018-12-03 16:50:50,235 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:50,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:50:50,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:50:50,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:50:50,236 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 20 states. [2018-12-03 16:50:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:50,275 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2018-12-03 16:50:50,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:50:50,275 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 36 [2018-12-03 16:50:50,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:50,276 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:50:50,276 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:50:50,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:50:50,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:50:50,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 16:50:50,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:50:50,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2018-12-03 16:50:50,281 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2018-12-03 16:50:50,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:50,281 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2018-12-03 16:50:50,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:50:50,281 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2018-12-03 16:50:50,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:50:50,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:50,282 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-12-03 16:50:50,282 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:50,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:50,282 INFO L82 PathProgramCache]: Analyzing trace with hash -2025042008, now seen corresponding path program 17 times [2018-12-03 16:50:50,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:50,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:50,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:50,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:50,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:50,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:50,745 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:50,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:50,746 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:50,746 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:50,746 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,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:50,746 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:50,755 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:50,755 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:50,773 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 16:50:50,774 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:50,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:50,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 18 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:51,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:51,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 16:50:51,193 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:51,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:50:51,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:50:51,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:50:51,194 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 20 states. [2018-12-03 16:50:51,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:51,240 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2018-12-03 16:50:51,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:50:51,241 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-12-03 16:50:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:51,242 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:50:51,242 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:50:51,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:50:51,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:50:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 16:50:51,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:50:51,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-12-03 16:50:51,247 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 38 [2018-12-03 16:50:51,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:51,248 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-12-03 16:50:51,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:50:51,248 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-12-03 16:50:51,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:50:51,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:51,249 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1] [2018-12-03 16:50:51,249 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:51,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:51,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2025041946, now seen corresponding path program 16 times [2018-12-03 16:50:51,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:51,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:51,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:51,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:51,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:51,791 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:51,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:51,792 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:51,792 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:51,792 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:51,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:51,792 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:51,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:51,801 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:51,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:51,827 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:52,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:52,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 38 [2018-12-03 16:50:52,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:52,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:50:52,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:50:52,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:50:52,388 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand 21 states. [2018-12-03 16:50:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:52,431 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-12-03 16:50:52,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:50:52,432 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 38 [2018-12-03 16:50:52,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:52,432 INFO L225 Difference]: With dead ends: 44 [2018-12-03 16:50:52,433 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:50:52,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:50:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:50:52,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 16:50:52,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 16:50:52,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-12-03 16:50:52,436 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2018-12-03 16:50:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:52,437 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-12-03 16:50:52,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:50:52,437 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-12-03 16:50:52,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 16:50:52,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:52,437 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-12-03 16:50:52,437 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:52,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:52,438 INFO L82 PathProgramCache]: Analyzing trace with hash -445133278, now seen corresponding path program 18 times [2018-12-03 16:50:52,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:52,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:52,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:52,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:52,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 19 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:52,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:52,710 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:52,711 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:52,712 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:52,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:52,712 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:52,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:52,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:52,743 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:52,743 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:52,745 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:52,751 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 19 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:52,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:53,606 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 19 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:53,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:53,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:50:53,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:53,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:50:53,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:50:53,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:50:53,626 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 21 states. [2018-12-03 16:50:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:53,649 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-12-03 16:50:53,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:50:53,650 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-12-03 16:50:53,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:53,651 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:50:53,651 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 16:50:53,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:50:53,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 16:50:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 16:50:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:50:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-12-03 16:50:53,654 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 40 [2018-12-03 16:50:53,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:53,655 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-12-03 16:50:53,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:50:53,655 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-12-03 16:50:53,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 16:50:53,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:53,655 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1] [2018-12-03 16:50:53,655 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:53,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:53,656 INFO L82 PathProgramCache]: Analyzing trace with hash -445133216, now seen corresponding path program 17 times [2018-12-03 16:50:53,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:53,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:53,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:53,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:53,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:53,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:53,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:53,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:53,854 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,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:53,854 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:53,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:53,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:53,887 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:50:53,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:53,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:53,895 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:53,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:54,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:54,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 40 [2018-12-03 16:50:54,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:54,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:50:54,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:50:54,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:50:54,378 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 22 states. [2018-12-03 16:50:54,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:54,561 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2018-12-03 16:50:54,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:50:54,561 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-12-03 16:50:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:54,562 INFO L225 Difference]: With dead ends: 46 [2018-12-03 16:50:54,562 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:50:54,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:50:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:50:54,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 16:50:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:50:54,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-12-03 16:50:54,566 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 40 [2018-12-03 16:50:54,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:54,567 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-12-03 16:50:54,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:50:54,567 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-12-03 16:50:54,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:50:54,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:54,568 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-12-03 16:50:54,568 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:54,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:54,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1723700764, now seen corresponding path program 19 times [2018-12-03 16:50:54,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:54,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:54,569 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:54,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:54,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:55,481 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:55,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:55,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:55,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:55,482 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:55,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:55,482 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:55,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:55,490 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:50:55,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:55,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:55,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:55,986 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:56,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:56,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:50:56,005 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:56,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:50:56,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:50:56,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:50:56,006 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 22 states. [2018-12-03 16:50:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:56,097 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-12-03 16:50:56,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:50:56,097 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-12-03 16:50:56,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:56,098 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:50:56,098 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:50:56,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:50:56,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:50:56,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 16:50:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:50:56,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-12-03 16:50:56,102 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 42 [2018-12-03 16:50:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:56,103 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-12-03 16:50:56,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:50:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-12-03 16:50:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:50:56,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:56,103 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1] [2018-12-03 16:50:56,104 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:56,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:56,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1723700826, now seen corresponding path program 18 times [2018-12-03 16:50:56,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:56,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:56,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:50:56,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:56,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:56,364 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:56,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:56,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:56,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:56,365 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,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:56,365 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:56,374 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:50:56,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:50:56,390 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:50:56,390 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:56,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:56,399 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:56,399 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:56,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:56,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 42 [2018-12-03 16:50:56,906 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:56,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:50:56,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:50:56,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:50:56,907 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 23 states. [2018-12-03 16:50:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:56,951 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-12-03 16:50:56,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:50:56,951 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-12-03 16:50:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:56,952 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:50:56,952 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 16:50:56,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:50:56,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 16:50:56,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 16:50:56,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:50:56,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-03 16:50:56,957 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 42 [2018-12-03 16:50:56,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:56,957 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-03 16:50:56,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:50:56,957 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-03 16:50:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:50:56,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:56,958 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-12-03 16:50:56,958 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:56,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:56,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1380890730, now seen corresponding path program 20 times [2018-12-03 16:50:56,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:56,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:56,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:56,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:56,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:50:57,265 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 21 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:57,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:57,265 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:50:57,265 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:50:57,266 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:57,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:50:57,266 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:57,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:50:57,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:50:57,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:50:57,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:50:57,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:50:57,660 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:57,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:50:58,380 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:50:58,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:50:58,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-03 16:50:58,399 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:50:58,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:50:58,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:50:58,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1287, Invalid=3135, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 16:50:58,401 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 45 states. [2018-12-03 16:50:59,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:50:59,565 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-12-03 16:50:59,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:50:59,566 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 44 [2018-12-03 16:50:59,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:50:59,567 INFO L225 Difference]: With dead ends: 50 [2018-12-03 16:50:59,567 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:50:59,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1741 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4101, Invalid=7671, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 16:50:59,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:50:59,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 16:50:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 16:50:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-12-03 16:50:59,573 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 44 [2018-12-03 16:50:59,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:50:59,573 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-12-03 16:50:59,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:50:59,573 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-12-03 16:50:59,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:50:59,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:50:59,574 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-12-03 16:50:59,574 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:50:59,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:50:59,574 INFO L82 PathProgramCache]: Analyzing trace with hash 108954256, now seen corresponding path program 21 times [2018-12-03 16:50:59,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:50:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:59,575 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:50:59,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:50:59,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:50:59,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 22 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:00,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:00,160 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:00,160 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:00,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:51:00,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:00,161 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:51:00,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:00,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:00,188 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:00,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:00,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 22 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:00,197 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:00,787 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 22 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:00,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:00,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:51:00,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:00,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:51:00,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:51:00,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:51:00,807 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 24 states. [2018-12-03 16:51:00,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:00,904 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2018-12-03 16:51:00,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:51:00,904 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-12-03 16:51:00,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:00,905 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:51:00,905 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 16:51:00,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 69 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:51:00,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 16:51:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 16:51:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:51:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2018-12-03 16:51:00,909 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 46 [2018-12-03 16:51:00,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:00,909 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2018-12-03 16:51:00,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:51:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2018-12-03 16:51:00,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:51:00,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:00,910 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1] [2018-12-03 16:51:00,911 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:00,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:00,911 INFO L82 PathProgramCache]: Analyzing trace with hash 108954318, now seen corresponding path program 19 times [2018-12-03 16:51:00,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:00,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:00,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:00,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:00,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:01,208 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:01,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:01,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:01,209 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:01,209 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:01,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:01,209 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:51:01,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:01,220 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:01,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:01,249 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:01,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:01,819 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:01,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:01,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2018-12-03 16:51:01,837 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:01,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:51:01,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:51:01,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:51:01,838 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand 25 states. [2018-12-03 16:51:01,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:01,896 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-12-03 16:51:01,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:51:01,896 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-12-03 16:51:01,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:01,897 INFO L225 Difference]: With dead ends: 52 [2018-12-03 16:51:01,897 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:51:01,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:51:01,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:51:01,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 16:51:01,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 16:51:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-12-03 16:51:01,901 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 46 [2018-12-03 16:51:01,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:01,901 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-12-03 16:51:01,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:51:01,901 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-12-03 16:51:01,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:51:01,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:01,902 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-12-03 16:51:01,902 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:01,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:01,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1625876234, now seen corresponding path program 22 times [2018-12-03 16:51:01,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:01,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:01,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:01,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:02,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:02,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:02,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:02,230 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:02,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:02,230 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:51:02,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:02,239 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:02,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:02,271 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 23 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:02,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:02,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:51:02,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:02,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:51:02,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:51:02,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:51:02,958 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 25 states. [2018-12-03 16:51:03,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:03,002 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2018-12-03 16:51:03,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:51:03,003 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-12-03 16:51:03,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:03,003 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:51:03,004 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 16:51:03,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 72 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:51:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 16:51:03,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 16:51:03,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 16:51:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2018-12-03 16:51:03,008 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 48 [2018-12-03 16:51:03,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:03,008 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2018-12-03 16:51:03,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:51:03,008 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2018-12-03 16:51:03,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:51:03,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:03,008 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1] [2018-12-03 16:51:03,009 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:03,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:03,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1625876296, now seen corresponding path program 20 times [2018-12-03 16:51:03,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:03,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:03,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:03,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:03,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:03,345 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:03,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:03,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:03,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:03,345 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,346 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:03,346 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:51:03,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:03,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:03,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 16:51:03,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:03,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:03,391 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:03,392 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:04,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:04,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2018-12-03 16:51:04,100 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:04,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:51:04,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:51:04,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:51:04,101 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 26 states. [2018-12-03 16:51:04,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:04,151 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-12-03 16:51:04,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:51:04,151 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 48 [2018-12-03 16:51:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:04,152 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:51:04,152 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:51:04,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:51:04,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:51:04,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 16:51:04,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:51:04,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2018-12-03 16:51:04,156 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 48 [2018-12-03 16:51:04,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:04,157 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2018-12-03 16:51:04,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:51:04,157 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2018-12-03 16:51:04,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:51:04,157 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:04,157 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-12-03 16:51:04,158 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:04,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:04,158 INFO L82 PathProgramCache]: Analyzing trace with hash -900983548, now seen corresponding path program 23 times [2018-12-03 16:51:04,158 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:04,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:04,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:04,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:04,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:04,636 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:04,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:04,637 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:04,637 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:04,637 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:04,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:04,637 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:51:04,645 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:04,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:04,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:51:04,672 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:04,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:04,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 24 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:05,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:05,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 16:51:05,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:05,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:51:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:51:05,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:51:05,575 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 26 states. [2018-12-03 16:51:05,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:05,629 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2018-12-03 16:51:05,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:51:05,630 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-12-03 16:51:05,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:05,631 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:51:05,631 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:51:05,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:51:05,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:51:05,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:51:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:51:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-03 16:51:05,634 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 50 [2018-12-03 16:51:05,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:05,634 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-03 16:51:05,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:51:05,635 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-03 16:51:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:51:05,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:05,635 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1] [2018-12-03 16:51:05,635 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:05,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:05,636 INFO L82 PathProgramCache]: Analyzing trace with hash -900983486, now seen corresponding path program 21 times [2018-12-03 16:51:05,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:05,636 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:05,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:05,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:06,040 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:06,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:06,040 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:06,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:06,041 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:06,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:06,041 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:51:06,050 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:06,050 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:06,070 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:06,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:06,072 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:06,078 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:06,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:06,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:06,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 50 [2018-12-03 16:51:06,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:06,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:51:06,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:51:06,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:51:06,788 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 27 states. [2018-12-03 16:51:06,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:06,832 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2018-12-03 16:51:06,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:51:06,833 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 50 [2018-12-03 16:51:06,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:06,834 INFO L225 Difference]: With dead ends: 56 [2018-12-03 16:51:06,834 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:51:06,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 73 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:51:06,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:51:06,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 16:51:06,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 16:51:06,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-12-03 16:51:06,838 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 50 [2018-12-03 16:51:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:06,838 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-12-03 16:51:06,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:51:06,838 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-12-03 16:51:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:51:06,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:06,839 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-12-03 16:51:06,839 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:06,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:06,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1738255486, now seen corresponding path program 24 times [2018-12-03 16:51:06,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:06,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:06,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:06,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:06,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:07,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:07,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:07,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:07,144 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:07,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:07,144 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:51:07,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:07,155 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:07,176 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:07,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:07,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:07,188 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:07,188 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:07,875 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 25 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:07,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:07,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:51:07,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:07,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:51:07,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:51:07,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:51:07,895 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 27 states. [2018-12-03 16:51:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:07,963 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2018-12-03 16:51:07,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:51:07,964 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-12-03 16:51:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:07,965 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:51:07,965 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 16:51:07,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 78 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:51:07,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 16:51:07,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 16:51:07,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:51:07,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2018-12-03 16:51:07,970 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 52 [2018-12-03 16:51:07,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:07,970 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2018-12-03 16:51:07,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:51:07,970 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-12-03 16:51:07,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:51:07,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:07,971 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1] [2018-12-03 16:51:07,971 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:07,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:07,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1738255548, now seen corresponding path program 22 times [2018-12-03 16:51:07,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:07,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:07,972 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:07,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:07,972 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:08,850 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:08,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:08,851 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:08,851 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:08,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:51:08,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:08,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 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:51:08,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:08,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:08,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:08,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:09,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:09,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 52 [2018-12-03 16:51:09,600 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:09,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:51:09,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:51:09,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:51:09,601 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand 28 states. [2018-12-03 16:51:09,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:09,654 INFO L93 Difference]: Finished difference Result 58 states and 64 transitions. [2018-12-03 16:51:09,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:51:09,655 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 52 [2018-12-03 16:51:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:09,656 INFO L225 Difference]: With dead ends: 58 [2018-12-03 16:51:09,656 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:51:09,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:51:09,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:51:09,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 16:51:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:51:09,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-12-03 16:51:09,661 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 52 [2018-12-03 16:51:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:09,662 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-12-03 16:51:09,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:51:09,662 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-12-03 16:51:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:51:09,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:09,662 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-12-03 16:51:09,663 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:09,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash -278704776, now seen corresponding path program 25 times [2018-12-03 16:51:09,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:09,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:09,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:10,428 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:10,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:10,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:10,429 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:10,429 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,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:10,429 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:51:10,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:10,438 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:10,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:10,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:10,468 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:10,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 26 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:11,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:11,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 16:51:11,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:11,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:51:11,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:51:11,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:51:11,233 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 28 states. [2018-12-03 16:51:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:11,291 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2018-12-03 16:51:11,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:51:11,292 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-12-03 16:51:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:11,293 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:51:11,293 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 16:51:11,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:51:11,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 16:51:11,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 16:51:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 16:51:11,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-03 16:51:11,297 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 54 [2018-12-03 16:51:11,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:11,297 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-03 16:51:11,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:51:11,297 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-03 16:51:11,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:51:11,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:11,298 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1] [2018-12-03 16:51:11,298 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:11,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:11,298 INFO L82 PathProgramCache]: Analyzing trace with hash -278704714, now seen corresponding path program 23 times [2018-12-03 16:51:11,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:11,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:11,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:11,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:11,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:11,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:11,653 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:11,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:11,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:11,654 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:11,654 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:11,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:11,654 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:51:11,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:11,665 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:11,696 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 16:51:11,696 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:11,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:11,705 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:11,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:12,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:12,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 54 [2018-12-03 16:51:12,732 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:12,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:51:12,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:51:12,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:51:12,733 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 29 states. [2018-12-03 16:51:12,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:12,774 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2018-12-03 16:51:12,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:51:12,774 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 54 [2018-12-03 16:51:12,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:12,775 INFO L225 Difference]: With dead ends: 60 [2018-12-03 16:51:12,775 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:51:12,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:51:12,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:51:12,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 16:51:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 16:51:12,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2018-12-03 16:51:12,781 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 54 [2018-12-03 16:51:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:12,781 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2018-12-03 16:51:12,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:51:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2018-12-03 16:51:12,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:51:12,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:12,782 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-12-03 16:51:12,782 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:12,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:12,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1547266062, now seen corresponding path program 26 times [2018-12-03 16:51:12,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:12,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:12,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:12,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:12,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:13,249 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 27 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:13,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:13,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:13,250 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:13,250 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:13,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:13,250 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:51:13,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:13,258 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:13,290 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:51:13,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:13,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:13,903 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:13,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:15,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:15,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-03 16:51:15,001 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:15,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:51:15,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:51:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2058, Invalid=5082, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 16:51:15,002 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 57 states. [2018-12-03 16:51:17,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:17,006 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-12-03 16:51:17,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:51:17,007 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 56 [2018-12-03 16:51:17,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:17,008 INFO L225 Difference]: With dead ends: 62 [2018-12-03 16:51:17,008 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:51:17,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2887 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=6648, Invalid=12534, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 16:51:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:51:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 16:51:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:51:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-12-03 16:51:17,013 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 56 [2018-12-03 16:51:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:17,013 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-12-03 16:51:17,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:51:17,013 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-12-03 16:51:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:51:17,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:17,014 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-12-03 16:51:17,014 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:17,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:17,014 INFO L82 PathProgramCache]: Analyzing trace with hash -863949844, now seen corresponding path program 27 times [2018-12-03 16:51:17,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:17,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:17,015 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:17,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:17,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:17,400 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:17,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:17,401 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:17,401 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:17,401 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:17,401 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:17,401 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:17,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:17,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:17,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:17,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:17,441 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:17,450 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:17,450 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:18,274 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 28 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:18,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:18,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 16:51:18,293 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:18,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:51:18,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:51:18,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:51:18,294 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 30 states. [2018-12-03 16:51:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:18,355 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-12-03 16:51:18,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:51:18,355 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-12-03 16:51:18,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:18,356 INFO L225 Difference]: With dead ends: 63 [2018-12-03 16:51:18,356 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 16:51:18,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:51:18,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 16:51:18,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 16:51:18,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:51:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2018-12-03 16:51:18,360 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 58 [2018-12-03 16:51:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:18,360 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2018-12-03 16:51:18,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:51:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2018-12-03 16:51:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:51:18,361 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:18,361 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1] [2018-12-03 16:51:18,361 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:18,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:18,362 INFO L82 PathProgramCache]: Analyzing trace with hash -863949782, now seen corresponding path program 24 times [2018-12-03 16:51:18,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:18,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:18,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:18,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:18,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:18,764 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:18,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:18,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:18,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:18,765 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,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:18,765 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:18,775 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:18,776 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:18,803 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:18,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:18,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:18,813 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:19,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:19,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 58 [2018-12-03 16:51:19,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:19,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:51:19,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:51:19,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:51:19,705 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 31 states. [2018-12-03 16:51:19,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:19,766 INFO L93 Difference]: Finished difference Result 64 states and 70 transitions. [2018-12-03 16:51:19,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:51:19,767 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 58 [2018-12-03 16:51:19,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:19,767 INFO L225 Difference]: With dead ends: 64 [2018-12-03 16:51:19,768 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:51:19,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:51:19,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:51:19,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 16:51:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 16:51:19,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-12-03 16:51:19,772 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 58 [2018-12-03 16:51:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:19,772 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-12-03 16:51:19,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:51:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-12-03 16:51:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 16:51:19,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:19,773 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-12-03 16:51:19,773 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:19,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:19,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1327060634, now seen corresponding path program 28 times [2018-12-03 16:51:19,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:19,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:19,774 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:19,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:19,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:20,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:20,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:20,190 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:20,190 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:20,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:20,190 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:20,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:20,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:20,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:20,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:20,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:21,393 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 29 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:21,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:21,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 16:51:21,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:21,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:51:21,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:51:21,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:51:21,413 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 31 states. [2018-12-03 16:51:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:21,486 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-12-03 16:51:21,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:51:21,487 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-12-03 16:51:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:21,488 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:51:21,488 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 16:51:21,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:51:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 16:51:21,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 16:51:21,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 16:51:21,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2018-12-03 16:51:21,493 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 60 [2018-12-03 16:51:21,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:21,493 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2018-12-03 16:51:21,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:51:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2018-12-03 16:51:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 16:51:21,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:21,494 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1] [2018-12-03 16:51:21,494 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:21,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:21,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1327060572, now seen corresponding path program 25 times [2018-12-03 16:51:21,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:21,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:21,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:21,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:21,496 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:21,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:21,919 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:21,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:21,919 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:21,919 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:21,919 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:21,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:21,919 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:21,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:21,928 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:21,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:21,960 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:21,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:22,900 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:22,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:22,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 60 [2018-12-03 16:51:22,929 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:22,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:51:22,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:51:22,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:51:22,930 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 32 states. [2018-12-03 16:51:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:23,062 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2018-12-03 16:51:23,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:51:23,063 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 60 [2018-12-03 16:51:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:23,063 INFO L225 Difference]: With dead ends: 66 [2018-12-03 16:51:23,064 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:51:23,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:51:23,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:51:23,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 16:51:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:51:23,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-12-03 16:51:23,069 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 60 [2018-12-03 16:51:23,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:23,069 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-12-03 16:51:23,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:51:23,070 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-12-03 16:51:23,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:51:23,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:23,070 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-12-03 16:51:23,070 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:23,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:23,071 INFO L82 PathProgramCache]: Analyzing trace with hash 300068960, now seen corresponding path program 29 times [2018-12-03 16:51:23,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:23,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:23,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:23,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:23,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 30 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:23,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:23,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:23,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:23,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:23,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:23,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 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:23,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:23,756 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:23,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:51:23,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:23,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 30 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:23,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:25,012 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 30 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:25,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:25,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 16:51:25,032 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:25,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:51:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:51:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:51:25,033 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 32 states. [2018-12-03 16:51:25,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:25,107 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2018-12-03 16:51:25,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:51:25,107 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-12-03 16:51:25,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:25,108 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:51:25,108 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 16:51:25,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:51:25,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 16:51:25,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 16:51:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:51:25,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2018-12-03 16:51:25,114 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 62 [2018-12-03 16:51:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:25,114 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2018-12-03 16:51:25,114 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:51:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-12-03 16:51:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:51:25,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:25,114 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1] [2018-12-03 16:51:25,115 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:25,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:25,115 INFO L82 PathProgramCache]: Analyzing trace with hash 300069022, now seen corresponding path program 26 times [2018-12-03 16:51:25,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:25,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:25,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:25,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:25,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:25,961 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:25,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:25,962 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:25,962 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:25,962 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,962 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:25,962 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:25,972 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:25,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:26,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:51:26,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:26,007 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:26,018 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:26,018 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:27,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:27,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 62 [2018-12-03 16:51:27,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:27,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:51:27,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:51:27,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:51:27,125 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 33 states. [2018-12-03 16:51:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:27,193 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2018-12-03 16:51:27,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:51:27,194 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 62 [2018-12-03 16:51:27,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:27,195 INFO L225 Difference]: With dead ends: 68 [2018-12-03 16:51:27,195 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:51:27,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:51:27,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:51:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 16:51:27,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 16:51:27,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2018-12-03 16:51:27,199 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 62 [2018-12-03 16:51:27,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:27,199 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2018-12-03 16:51:27,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:51:27,199 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2018-12-03 16:51:27,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 16:51:27,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:27,199 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-12-03 16:51:27,199 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:27,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:27,200 INFO L82 PathProgramCache]: Analyzing trace with hash 603513050, now seen corresponding path program 30 times [2018-12-03 16:51:27,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:27,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:27,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:27,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:27,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:27,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:27,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:27,672 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:27,672 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:27,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:27,672 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:27,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:27,682 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:27,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:27,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:27,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:27,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:28,770 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 31 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:28,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:28,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 16:51:28,788 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:28,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:51:28,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:51:28,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:51:28,789 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand 33 states. [2018-12-03 16:51:28,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:28,852 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2018-12-03 16:51:28,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:51:28,852 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-12-03 16:51:28,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:28,853 INFO L225 Difference]: With dead ends: 69 [2018-12-03 16:51:28,853 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 16:51:28,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:51:28,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 16:51:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 16:51:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:51:28,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-03 16:51:28,857 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 64 [2018-12-03 16:51:28,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:28,857 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-03 16:51:28,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:51:28,858 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-03 16:51:28,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 16:51:28,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:28,858 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1] [2018-12-03 16:51:28,858 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:28,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:28,859 INFO L82 PathProgramCache]: Analyzing trace with hash 603513112, now seen corresponding path program 27 times [2018-12-03 16:51:28,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:28,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:28,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:28,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:28,859 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:28,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:29,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:29,390 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:29,390 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:29,390 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:29,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:29,390 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:29,399 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:29,399 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:29,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:29,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:29,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:29,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:30,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:30,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 64 [2018-12-03 16:51:30,537 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:30,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:51:30,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:51:30,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:51:30,538 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 34 states. [2018-12-03 16:51:30,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:30,679 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2018-12-03 16:51:30,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:51:30,680 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 64 [2018-12-03 16:51:30,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:30,680 INFO L225 Difference]: With dead ends: 70 [2018-12-03 16:51:30,680 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:51:30,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:51:30,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:51:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 16:51:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:51:30,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2018-12-03 16:51:30,683 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 64 [2018-12-03 16:51:30,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:30,683 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2018-12-03 16:51:30,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:51:30,683 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2018-12-03 16:51:30,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:51:30,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:30,684 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-12-03 16:51:30,684 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:30,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:30,684 INFO L82 PathProgramCache]: Analyzing trace with hash 155507412, now seen corresponding path program 31 times [2018-12-03 16:51:30,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:30,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:30,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:30,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:30,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:31,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:31,256 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:31,256 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:31,256 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:31,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:31,257 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:31,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:31,268 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:31,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:31,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:31,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 32 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:32,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:32,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 16:51:32,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:32,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:51:32,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:51:32,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:51:32,415 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand 34 states. [2018-12-03 16:51:32,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:32,778 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2018-12-03 16:51:32,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:51:32,779 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-12-03 16:51:32,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:32,779 INFO L225 Difference]: With dead ends: 71 [2018-12-03 16:51:32,780 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 16:51:32,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:51:32,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 16:51:32,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 16:51:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 16:51:32,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2018-12-03 16:51:32,783 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 66 [2018-12-03 16:51:32,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:32,783 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2018-12-03 16:51:32,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:51:32,784 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2018-12-03 16:51:32,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:51:32,784 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:32,784 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1] [2018-12-03 16:51:32,784 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:32,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:32,784 INFO L82 PathProgramCache]: Analyzing trace with hash 155507474, now seen corresponding path program 28 times [2018-12-03 16:51:32,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:32,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:32,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:32,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:32,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:32,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:33,298 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:33,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:33,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:33,299 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:33,299 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:33,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:33,299 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:33,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:33,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:33,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:33,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:34,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:34,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:34,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 66 [2018-12-03 16:51:34,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:34,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:51:34,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:51:34,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:51:34,564 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 35 states. [2018-12-03 16:51:34,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:34,642 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-12-03 16:51:34,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:51:34,643 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 66 [2018-12-03 16:51:34,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:34,644 INFO L225 Difference]: With dead ends: 72 [2018-12-03 16:51:34,644 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:51:34,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:51:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:51:34,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 16:51:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:51:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2018-12-03 16:51:34,649 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 66 [2018-12-03 16:51:34,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:34,650 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2018-12-03 16:51:34,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:51:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2018-12-03 16:51:34,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:51:34,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:34,651 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-12-03 16:51:34,651 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:34,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:34,651 INFO L82 PathProgramCache]: Analyzing trace with hash -881181106, now seen corresponding path program 32 times [2018-12-03 16:51:34,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:34,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:34,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:34,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:34,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 33 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:35,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:35,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:35,205 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:35,205 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:35,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:35,205 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:35,213 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:35,214 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:35,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:51:35,253 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:35,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:36,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:38,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:38,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-03 16:51:38,077 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:38,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:51:38,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:51:38,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3009, Invalid=7497, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 16:51:38,079 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand 69 states. [2018-12-03 16:51:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:40,429 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2018-12-03 16:51:40,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:51:40,429 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 68 [2018-12-03 16:51:40,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:40,430 INFO L225 Difference]: With dead ends: 74 [2018-12-03 16:51:40,430 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 16:51:40,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4321 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=9807, Invalid=18585, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 16:51:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 16:51:40,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 16:51:40,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 16:51:40,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2018-12-03 16:51:40,436 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 68 [2018-12-03 16:51:40,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:40,436 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2018-12-03 16:51:40,436 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:51:40,436 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2018-12-03 16:51:40,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 16:51:40,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:40,437 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-12-03 16:51:40,437 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:40,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:40,437 INFO L82 PathProgramCache]: Analyzing trace with hash -706434232, now seen corresponding path program 33 times [2018-12-03 16:51:40,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:40,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:40,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:40,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:40,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 34 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:41,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:41,323 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:41,323 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:41,323 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:41,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:41,323 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:41,332 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:41,332 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:41,359 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:41,359 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:41,361 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:41,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 34 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:41,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:42,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 34 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:42,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:42,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 16:51:42,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:42,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:51:42,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:51:42,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:51:42,755 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 36 states. [2018-12-03 16:51:42,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:42,831 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2018-12-03 16:51:42,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:51:42,832 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-12-03 16:51:42,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:42,833 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:51:42,833 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 16:51:42,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:51:42,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 16:51:42,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 16:51:42,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 16:51:42,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2018-12-03 16:51:42,838 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 70 [2018-12-03 16:51:42,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:42,838 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2018-12-03 16:51:42,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:51:42,838 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2018-12-03 16:51:42,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 16:51:42,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:42,839 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1] [2018-12-03 16:51:42,839 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:42,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:42,839 INFO L82 PathProgramCache]: Analyzing trace with hash -706434170, now seen corresponding path program 29 times [2018-12-03 16:51:42,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:42,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:42,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:42,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:42,840 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:43,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:43,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:43,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:43,494 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:43,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:43,494 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:43,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:43,503 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:43,541 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 16:51:43,541 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:43,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:43,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:44,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:44,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:44,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 70 [2018-12-03 16:51:44,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:44,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:51:44,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:51:44,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:51:44,878 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 37 states. [2018-12-03 16:51:45,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:45,128 INFO L93 Difference]: Finished difference Result 76 states and 82 transitions. [2018-12-03 16:51:45,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:51:45,129 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2018-12-03 16:51:45,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:45,129 INFO L225 Difference]: With dead ends: 76 [2018-12-03 16:51:45,130 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:51:45,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:51:45,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:51:45,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 16:51:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 16:51:45,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-12-03 16:51:45,134 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 70 [2018-12-03 16:51:45,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:45,134 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-12-03 16:51:45,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:51:45,134 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-12-03 16:51:45,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 16:51:45,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:45,135 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-12-03 16:51:45,135 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:45,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:45,136 INFO L82 PathProgramCache]: Analyzing trace with hash -278412862, now seen corresponding path program 34 times [2018-12-03 16:51:45,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:45,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:45,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:45,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:45,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:45,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:45,714 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:45,714 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:45,714 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:45,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:45,715 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:45,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:45,724 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:45,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:45,762 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 35 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:47,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:47,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 16:51:47,570 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:47,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:51:47,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:51:47,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:51:47,571 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 37 states. [2018-12-03 16:51:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:47,692 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2018-12-03 16:51:47,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:51:47,693 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-12-03 16:51:47,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:47,694 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:51:47,694 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 16:51:47,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:51:47,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 16:51:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 16:51:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 16:51:47,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2018-12-03 16:51:47,696 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 72 [2018-12-03 16:51:47,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:47,697 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2018-12-03 16:51:47,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:51:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2018-12-03 16:51:47,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 16:51:47,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:47,697 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1] [2018-12-03 16:51:47,698 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:47,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:47,698 INFO L82 PathProgramCache]: Analyzing trace with hash -278412800, now seen corresponding path program 30 times [2018-12-03 16:51:47,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:47,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:47,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:47,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:47,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:48,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:48,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:48,186 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:48,186 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:48,186 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:48,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:48,186 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 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:51:48,196 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:48,196 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:48,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:48,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:48,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:48,235 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:49,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:49,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 72 [2018-12-03 16:51:49,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:49,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:51:49,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:51:49,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:51:49,618 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 38 states. [2018-12-03 16:51:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:49,680 INFO L93 Difference]: Finished difference Result 78 states and 84 transitions. [2018-12-03 16:51:49,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:51:49,680 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 72 [2018-12-03 16:51:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:49,681 INFO L225 Difference]: With dead ends: 78 [2018-12-03 16:51:49,681 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:51:49,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:51:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:51:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 16:51:49,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:51:49,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-12-03 16:51:49,686 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 72 [2018-12-03 16:51:49,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:49,687 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-12-03 16:51:49,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:51:49,687 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-12-03 16:51:49,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 16:51:49,687 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:49,687 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-12-03 16:51:49,688 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:49,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:49,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1266736708, now seen corresponding path program 35 times [2018-12-03 16:51:49,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:49,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:49,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:49,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:49,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:49,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:50,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:50,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:50,293 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:50,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:50,294 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:50,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:50,294 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 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:51:50,302 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:50,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:50,344 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:51:50,344 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:50,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:50,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 36 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:52,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:52,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 16:51:52,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:52,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:51:52,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:51:52,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:51:52,051 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 38 states. [2018-12-03 16:51:52,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:52,611 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-12-03 16:51:52,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:51:52,612 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-12-03 16:51:52,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:52,612 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:51:52,612 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:51:52,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:51:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:51:52,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:51:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:51:52,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2018-12-03 16:51:52,616 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 74 [2018-12-03 16:51:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:52,616 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2018-12-03 16:51:52,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:51:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-12-03 16:51:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 16:51:52,617 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:52,617 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1] [2018-12-03 16:51:52,617 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:52,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:52,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1266736646, now seen corresponding path program 31 times [2018-12-03 16:51:52,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:52,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:52,618 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:52,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:52,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:53,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:53,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:53,166 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:53,166 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:53,166 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:53,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:53,166 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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:51:53,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:53,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:53,206 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:53,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:53,215 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:54,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:54,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:54,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 74 [2018-12-03 16:51:54,938 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:54,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:51:54,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:51:54,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:51:54,942 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 39 states. [2018-12-03 16:51:55,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:55,026 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2018-12-03 16:51:55,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:51:55,027 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 74 [2018-12-03 16:51:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:55,028 INFO L225 Difference]: With dead ends: 80 [2018-12-03 16:51:55,028 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 16:51:55,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 109 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:51:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 16:51:55,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 16:51:55,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 16:51:55,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2018-12-03 16:51:55,033 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 74 [2018-12-03 16:51:55,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:55,033 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2018-12-03 16:51:55,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:51:55,034 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2018-12-03 16:51:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 16:51:55,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:55,034 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-12-03 16:51:55,034 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:55,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:55,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1858180298, now seen corresponding path program 36 times [2018-12-03 16:51:55,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:55,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:55,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:55,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:55,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 37 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:55,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:55,595 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:55,595 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:55,595 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:55,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:55,596 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 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:51:55,603 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:55,603 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:55,643 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:55,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:55,645 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:55,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 37 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:55,654 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 37 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:57,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:57,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 16:51:57,366 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:57,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:51:57,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:51:57,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:51:57,367 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand 39 states. [2018-12-03 16:51:57,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:57,452 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-12-03 16:51:57,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:51:57,452 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-12-03 16:51:57,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:57,453 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:51:57,453 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 16:51:57,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 114 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:51:57,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 16:51:57,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 16:51:57,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 16:51:57,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2018-12-03 16:51:57,460 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 76 [2018-12-03 16:51:57,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:57,461 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2018-12-03 16:51:57,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:51:57,461 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-12-03 16:51:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 16:51:57,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:57,462 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1] [2018-12-03 16:51:57,462 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:57,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1858180236, now seen corresponding path program 32 times [2018-12-03 16:51:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:57,463 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:57,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:58,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:58,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:58,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:58,181 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:58,181 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:58,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:58,181 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 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:51:58,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:58,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:58,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:51:58,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:58,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:58,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:58,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:59,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:59,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 76 [2018-12-03 16:51:59,980 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:59,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:51:59,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:51:59,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:51:59,982 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 40 states. [2018-12-03 16:52:00,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:00,155 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2018-12-03 16:52:00,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:52:00,156 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 76 [2018-12-03 16:52:00,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:00,157 INFO L225 Difference]: With dead ends: 82 [2018-12-03 16:52:00,157 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:52:00,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:52:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:52:00,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 16:52:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 16:52:00,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 81 transitions. [2018-12-03 16:52:00,162 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 81 transitions. Word has length 76 [2018-12-03 16:52:00,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:00,162 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 81 transitions. [2018-12-03 16:52:00,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:52:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 81 transitions. [2018-12-03 16:52:00,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:52:00,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:00,163 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-12-03 16:52:00,163 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:00,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:00,163 INFO L82 PathProgramCache]: Analyzing trace with hash 995180080, now seen corresponding path program 37 times [2018-12-03 16:52:00,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:00,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:00,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:00,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:00,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:01,758 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:01,758 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:01,758 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:01,758 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:01,759 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:52:01,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:01,759 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 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:01,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:01,767 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:01,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:01,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 38 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:03,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:03,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 16:52:03,353 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:03,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:52:03,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:52:03,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:52:03,355 INFO L87 Difference]: Start difference. First operand 79 states and 81 transitions. Second operand 40 states. [2018-12-03 16:52:03,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:03,439 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-12-03 16:52:03,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:52:03,439 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-12-03 16:52:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:03,440 INFO L225 Difference]: With dead ends: 83 [2018-12-03 16:52:03,441 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 16:52:03,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:52:03,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 16:52:03,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 16:52:03,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 16:52:03,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-03 16:52:03,445 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 78 [2018-12-03 16:52:03,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:03,445 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-03 16:52:03,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:52:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-03 16:52:03,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:52:03,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:03,446 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1] [2018-12-03 16:52:03,446 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:03,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:03,447 INFO L82 PathProgramCache]: Analyzing trace with hash 995180142, now seen corresponding path program 33 times [2018-12-03 16:52:03,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:03,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:03,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:03,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:03,448 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:03,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:04,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:04,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:04,075 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:04,075 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:04,075 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:52:04,075 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:04,076 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 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:04,083 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:04,084 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:04,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:04,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:04,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:04,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:04,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:05,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:05,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:05,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 78 [2018-12-03 16:52:05,796 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:05,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:52:05,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:52:05,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:52:05,797 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 41 states. [2018-12-03 16:52:05,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:05,881 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-12-03 16:52:05,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:52:05,882 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 78 [2018-12-03 16:52:05,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:05,883 INFO L225 Difference]: With dead ends: 84 [2018-12-03 16:52:05,883 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 16:52:05,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:52:05,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 16:52:05,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 16:52:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 16:52:05,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 83 transitions. [2018-12-03 16:52:05,887 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 83 transitions. Word has length 78 [2018-12-03 16:52:05,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:05,887 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 83 transitions. [2018-12-03 16:52:05,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:52:05,887 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 83 transitions. [2018-12-03 16:52:05,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 16:52:05,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:05,888 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-12-03 16:52:05,888 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:05,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:05,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1409598806, now seen corresponding path program 38 times [2018-12-03 16:52:05,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:05,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:05,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:05,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:05,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:07,103 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 39 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:07,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:07,104 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:07,104 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:07,104 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:52:07,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:07,104 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 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:07,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:07,113 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:07,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 16:52:07,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:07,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:08,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:08,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:10,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:10,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:10,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-03 16:52:10,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:10,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:52:10,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:52:10,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4140, Invalid=10380, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 16:52:10,508 INFO L87 Difference]: Start difference. First operand 81 states and 83 transitions. Second operand 81 states. [2018-12-03 16:52:13,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:13,787 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2018-12-03 16:52:13,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:52:13,788 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 80 [2018-12-03 16:52:13,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:13,788 INFO L225 Difference]: With dead ends: 86 [2018-12-03 16:52:13,789 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 16:52:13,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6043 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=13578, Invalid=25824, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 16:52:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 16:52:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 16:52:13,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 16:52:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 85 transitions. [2018-12-03 16:52:13,793 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 85 transitions. Word has length 80 [2018-12-03 16:52:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:13,794 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 85 transitions. [2018-12-03 16:52:13,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:52:13,794 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 85 transitions. [2018-12-03 16:52:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 16:52:13,794 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:13,794 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-12-03 16:52:13,794 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:13,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:13,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1709703004, now seen corresponding path program 39 times [2018-12-03 16:52:13,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:13,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:13,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:13,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:13,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:14,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 40 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:14,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:14,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:14,390 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:14,390 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:52:14,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:14,390 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 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:14,398 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:14,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:14,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:14,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:14,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 40 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:14,443 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 40 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:16,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:16,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 16:52:16,147 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:16,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:52:16,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:52:16,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:52:16,148 INFO L87 Difference]: Start difference. First operand 83 states and 85 transitions. Second operand 42 states. [2018-12-03 16:52:16,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:16,236 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2018-12-03 16:52:16,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:52:16,236 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-12-03 16:52:16,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:16,237 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:52:16,237 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:52:16,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:52:16,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:52:16,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 16:52:16,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:52:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-12-03 16:52:16,242 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 82 [2018-12-03 16:52:16,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:16,242 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-12-03 16:52:16,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:52:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-12-03 16:52:16,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 16:52:16,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:16,243 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1] [2018-12-03 16:52:16,243 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:16,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:16,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1709702942, now seen corresponding path program 34 times [2018-12-03 16:52:16,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:16,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:16,244 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:16,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:16,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:17,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:17,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:17,780 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:17,780 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:17,780 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:52:17,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:17,780 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 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:17,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:17,788 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:17,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:17,822 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:17,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:17,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:19,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:19,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 82 [2018-12-03 16:52:19,609 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:19,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:52:19,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:52:19,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:52:19,611 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 43 states. [2018-12-03 16:52:19,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:19,697 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2018-12-03 16:52:19,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:52:19,698 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 82 [2018-12-03 16:52:19,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:19,699 INFO L225 Difference]: With dead ends: 88 [2018-12-03 16:52:19,699 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 16:52:19,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:52:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 16:52:19,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 16:52:19,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 16:52:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 87 transitions. [2018-12-03 16:52:19,704 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 87 transitions. Word has length 82 [2018-12-03 16:52:19,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:19,705 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 87 transitions. [2018-12-03 16:52:19,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:52:19,705 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 87 transitions. [2018-12-03 16:52:19,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:52:19,706 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:19,706 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-12-03 16:52:19,706 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:19,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:19,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1947938846, now seen corresponding path program 40 times [2018-12-03 16:52:19,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:19,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:19,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:19,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:19,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:20,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 41 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:20,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:20,900 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:20,900 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:20,900 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:52:20,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:20,900 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 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:20,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:20,909 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:20,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:20,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 41 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:20,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 41 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:23,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:23,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 16:52:23,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:23,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:52:23,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:52:23,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:52:23,030 INFO L87 Difference]: Start difference. First operand 85 states and 87 transitions. Second operand 43 states. [2018-12-03 16:52:23,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:23,121 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2018-12-03 16:52:23,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:52:23,121 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-12-03 16:52:23,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:23,122 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:52:23,122 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 16:52:23,123 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:52:23,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 16:52:23,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 16:52:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 16:52:23,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2018-12-03 16:52:23,127 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 84 [2018-12-03 16:52:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:23,127 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2018-12-03 16:52:23,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:52:23,127 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2018-12-03 16:52:23,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 16:52:23,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:23,127 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1] [2018-12-03 16:52:23,128 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:23,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:23,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1947938908, now seen corresponding path program 35 times [2018-12-03 16:52:23,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:23,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:23,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:23,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:23,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:23,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:23,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:23,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:23,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:23,842 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:52:23,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:23,843 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 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:23,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:23,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:23,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 16:52:23,903 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:23,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:23,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:25,826 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:25,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:25,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 84 [2018-12-03 16:52:25,845 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:25,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:52:25,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:52:25,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:52:25,846 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand 44 states. [2018-12-03 16:52:25,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:25,936 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-12-03 16:52:25,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:52:25,937 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 84 [2018-12-03 16:52:25,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:25,938 INFO L225 Difference]: With dead ends: 90 [2018-12-03 16:52:25,938 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 16:52:25,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:52:25,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 16:52:25,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 16:52:25,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 16:52:25,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-12-03 16:52:25,943 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 84 [2018-12-03 16:52:25,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:25,943 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-12-03 16:52:25,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:52:25,943 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-12-03 16:52:25,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:52:25,944 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:25,944 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-12-03 16:52:25,944 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:25,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:25,945 INFO L82 PathProgramCache]: Analyzing trace with hash -636458728, now seen corresponding path program 41 times [2018-12-03 16:52:25,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:25,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:25,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:25,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:25,946 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:25,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:26,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 42 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:26,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:26,599 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:26,599 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:26,599 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:52:26,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:26,599 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 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:26,607 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:26,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:26,657 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 16:52:26,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:26,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:26,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 42 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:26,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:29,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 42 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:29,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:29,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 16:52:29,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:29,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:52:29,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:52:29,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:52:29,755 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 44 states. [2018-12-03 16:52:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:29,816 INFO L93 Difference]: Finished difference Result 91 states and 96 transitions. [2018-12-03 16:52:29,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:52:29,816 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-12-03 16:52:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:29,817 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:52:29,817 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 16:52:29,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:52:29,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 16:52:29,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 16:52:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:52:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 90 transitions. [2018-12-03 16:52:29,821 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 90 transitions. Word has length 86 [2018-12-03 16:52:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:29,821 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 90 transitions. [2018-12-03 16:52:29,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:52:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 90 transitions. [2018-12-03 16:52:29,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 16:52:29,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:29,822 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1] [2018-12-03 16:52:29,822 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:29,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:29,822 INFO L82 PathProgramCache]: Analyzing trace with hash -636458666, now seen corresponding path program 36 times [2018-12-03 16:52:29,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:29,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:29,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:29,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:29,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:29,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:30,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:30,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:30,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:30,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:30,519 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:52:30,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:30,519 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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:30,526 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:30,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:30,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:30,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:30,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:30,578 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:32,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:32,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 86 [2018-12-03 16:52:32,868 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:32,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:52:32,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:52:32,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:52:32,870 INFO L87 Difference]: Start difference. First operand 88 states and 90 transitions. Second operand 45 states. [2018-12-03 16:52:32,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:32,960 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-12-03 16:52:32,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:52:32,960 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 86 [2018-12-03 16:52:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:32,961 INFO L225 Difference]: With dead ends: 92 [2018-12-03 16:52:32,961 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 16:52:32,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:52:32,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 16:52:32,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 16:52:32,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 16:52:32,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 91 transitions. [2018-12-03 16:52:32,967 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 91 transitions. Word has length 86 [2018-12-03 16:52:32,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:32,967 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 91 transitions. [2018-12-03 16:52:32,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:52:32,967 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 91 transitions. [2018-12-03 16:52:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:52:32,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:32,968 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-12-03 16:52:32,968 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:32,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1751430254, now seen corresponding path program 42 times [2018-12-03 16:52:32,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:32,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:32,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:32,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 43 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:33,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:33,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:33,850 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:33,850 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:52:33,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:33,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 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:33,859 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:33,860 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:33,894 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:33,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:33,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:33,912 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 43 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:33,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 43 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:35,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:35,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 16:52:35,864 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:35,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:52:35,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:52:35,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:52:35,865 INFO L87 Difference]: Start difference. First operand 89 states and 91 transitions. Second operand 45 states. [2018-12-03 16:52:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:35,923 INFO L93 Difference]: Finished difference Result 93 states and 98 transitions. [2018-12-03 16:52:35,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:52:35,924 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-12-03 16:52:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:35,925 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:52:35,925 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 16:52:35,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:52:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 16:52:35,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 16:52:35,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:52:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2018-12-03 16:52:35,930 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 88 [2018-12-03 16:52:35,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:35,931 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2018-12-03 16:52:35,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:52:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2018-12-03 16:52:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 16:52:35,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:35,931 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1] [2018-12-03 16:52:35,932 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:35,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:35,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1751430192, now seen corresponding path program 37 times [2018-12-03 16:52:35,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:35,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:35,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:35,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:35,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:35,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:36,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:36,684 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:36,684 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:36,684 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:52:36,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:36,685 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 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:36,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:36,693 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:36,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:36,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:36,742 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:39,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:39,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 88 [2018-12-03 16:52:39,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:39,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:52:39,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:52:39,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:52:39,153 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 46 states. [2018-12-03 16:52:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:40,390 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2018-12-03 16:52:40,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:52:40,391 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 88 [2018-12-03 16:52:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:40,391 INFO L225 Difference]: With dead ends: 94 [2018-12-03 16:52:40,391 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 16:52:40,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:52:40,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 16:52:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 16:52:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 16:52:40,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-12-03 16:52:40,395 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 88 [2018-12-03 16:52:40,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:40,396 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-12-03 16:52:40,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:52:40,396 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-12-03 16:52:40,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:52:40,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:40,397 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-12-03 16:52:40,397 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:40,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:40,397 INFO L82 PathProgramCache]: Analyzing trace with hash 502757260, now seen corresponding path program 43 times [2018-12-03 16:52:40,397 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:40,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:40,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:40,398 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:41,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:41,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:41,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:41,139 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:52:41,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:41,140 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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:41,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:41,148 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:41,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:41,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:41,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:41,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:43,514 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:43,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:43,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 16:52:43,532 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:43,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:52:43,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:52:43,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:52:43,533 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 46 states. [2018-12-03 16:52:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:43,816 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-12-03 16:52:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:52:43,816 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-12-03 16:52:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:43,817 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:52:43,817 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 16:52:43,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:52:43,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 16:52:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 16:52:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:52:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2018-12-03 16:52:43,822 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 90 [2018-12-03 16:52:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:43,822 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2018-12-03 16:52:43,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:52:43,823 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2018-12-03 16:52:43,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 16:52:43,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:43,823 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1] [2018-12-03 16:52:43,823 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:43,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:43,824 INFO L82 PathProgramCache]: Analyzing trace with hash 502757322, now seen corresponding path program 38 times [2018-12-03 16:52:43,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:43,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:43,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:43,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:43,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:43,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:44,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:44,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:44,588 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:44,588 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:52:44,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:44,588 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 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:44,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:44,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:44,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 16:52:44,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:44,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:44,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:46,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:46,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:46,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 90 [2018-12-03 16:52:46,760 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:46,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:52:46,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:52:46,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:52:46,761 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand 47 states. [2018-12-03 16:52:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:46,856 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2018-12-03 16:52:46,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:52:46,857 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 90 [2018-12-03 16:52:46,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:46,858 INFO L225 Difference]: With dead ends: 96 [2018-12-03 16:52:46,858 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 16:52:46,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:52:46,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 16:52:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 16:52:46,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 16:52:46,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2018-12-03 16:52:46,861 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 90 [2018-12-03 16:52:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:46,861 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2018-12-03 16:52:46,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:52:46,861 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2018-12-03 16:52:46,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 16:52:46,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:46,862 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-12-03 16:52:46,862 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:46,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:46,862 INFO L82 PathProgramCache]: Analyzing trace with hash 2113441030, now seen corresponding path program 44 times [2018-12-03 16:52:46,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:46,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:46,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:46,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:46,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:47,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 45 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:47,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:47,861 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:47,861 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:47,861 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:52:47,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:47,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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:47,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:47,872 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:47,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 16:52:47,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:47,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:49,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:52,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:52,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:52,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-03 16:52:52,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:52,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 16:52:52,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 16:52:52,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5451, Invalid=13731, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 16:52:52,471 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand 93 states. [2018-12-03 16:52:57,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:57,033 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2018-12-03 16:52:57,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 16:52:57,034 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 92 [2018-12-03 16:52:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:57,034 INFO L225 Difference]: With dead ends: 98 [2018-12-03 16:52:57,035 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 16:52:57,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8053 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=17961, Invalid=34251, Unknown=0, NotChecked=0, Total=52212 [2018-12-03 16:52:57,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 16:52:57,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 16:52:57,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 16:52:57,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2018-12-03 16:52:57,041 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 92 [2018-12-03 16:52:57,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:57,041 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2018-12-03 16:52:57,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 16:52:57,041 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2018-12-03 16:52:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:52:57,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:57,042 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-12-03 16:52:57,042 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:57,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:57,042 INFO L82 PathProgramCache]: Analyzing trace with hash -502649856, now seen corresponding path program 45 times [2018-12-03 16:52:57,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:57,043 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:57,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:57,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:58,117 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:58,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:58,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:58,117 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:58,117 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:52:58,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:58,118 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 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:52:58,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:58,127 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:58,162 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:58,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:58,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:58,175 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:00,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 46 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:00,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:00,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 16:53:00,395 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:00,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:53:00,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:53:00,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:53:00,396 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand 48 states. [2018-12-03 16:53:00,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:00,457 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-12-03 16:53:00,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:53:00,458 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-12-03 16:53:00,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:00,458 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:53:00,459 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 16:53:00,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:53:00,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 16:53:00,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 16:53:00,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:53:00,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 98 transitions. [2018-12-03 16:53:00,464 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 98 transitions. Word has length 94 [2018-12-03 16:53:00,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:00,464 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 98 transitions. [2018-12-03 16:53:00,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:53:00,464 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 98 transitions. [2018-12-03 16:53:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 16:53:00,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:00,465 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1] [2018-12-03 16:53:00,465 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:00,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:00,466 INFO L82 PathProgramCache]: Analyzing trace with hash -502649794, now seen corresponding path program 39 times [2018-12-03 16:53:00,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:00,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:00,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:00,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:01,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:01,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:01,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:01,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:01,336 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:53:01,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:01,336 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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:01,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:01,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:01,379 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:01,380 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:01,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:01,393 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:01,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:04,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:04,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:04,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2018-12-03 16:53:04,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:04,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:53:04,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:53:04,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:53:04,061 INFO L87 Difference]: Start difference. First operand 96 states and 98 transitions. Second operand 49 states. [2018-12-03 16:53:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:04,164 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2018-12-03 16:53:04,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:53:04,164 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 94 [2018-12-03 16:53:04,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:04,165 INFO L225 Difference]: With dead ends: 100 [2018-12-03 16:53:04,165 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 16:53:04,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:53:04,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 16:53:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 16:53:04,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 16:53:04,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2018-12-03 16:53:04,170 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 94 [2018-12-03 16:53:04,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:04,171 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2018-12-03 16:53:04,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:53:04,171 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2018-12-03 16:53:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:53:04,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:04,172 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-12-03 16:53:04,172 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:04,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:04,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2010123142, now seen corresponding path program 46 times [2018-12-03 16:53:04,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:04,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:04,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:04,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:04,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:05,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:05,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:05,080 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:05,080 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:05,080 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:53:05,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:05,081 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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:05,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:05,092 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:05,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:05,136 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:05,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:07,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 47 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:07,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:07,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 16:53:07,449 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:07,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:53:07,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:53:07,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:53:07,451 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand 49 states. [2018-12-03 16:53:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:07,554 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2018-12-03 16:53:07,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:53:07,554 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-12-03 16:53:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:07,555 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:53:07,555 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 16:53:07,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:53:07,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 16:53:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 16:53:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:53:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-12-03 16:53:07,560 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 96 [2018-12-03 16:53:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:07,560 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-12-03 16:53:07,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:53:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-12-03 16:53:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 16:53:07,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:07,560 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1] [2018-12-03 16:53:07,561 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:07,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:07,561 INFO L82 PathProgramCache]: Analyzing trace with hash -2010123080, now seen corresponding path program 40 times [2018-12-03 16:53:07,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:07,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:07,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:07,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:07,562 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:08,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:08,751 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:08,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:08,752 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:08,752 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:53:08,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:08,752 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 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:08,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:08,761 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:08,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:08,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:08,824 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:11,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:11,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 96 [2018-12-03 16:53:11,355 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:11,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:53:11,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:53:11,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:53:11,356 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 50 states. [2018-12-03 16:53:11,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:11,459 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-12-03 16:53:11,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:53:11,460 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-12-03 16:53:11,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:11,461 INFO L225 Difference]: With dead ends: 102 [2018-12-03 16:53:11,461 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 16:53:11,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:53:11,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 16:53:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 16:53:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 16:53:11,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2018-12-03 16:53:11,464 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 96 [2018-12-03 16:53:11,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:11,464 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2018-12-03 16:53:11,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:53:11,464 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2018-12-03 16:53:11,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:53:11,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:11,465 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-12-03 16:53:11,465 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:11,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:11,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1006995060, now seen corresponding path program 47 times [2018-12-03 16:53:11,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:11,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:11,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:11,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:11,466 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:12,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 48 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:12,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:12,327 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:12,327 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:12,327 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:53:12,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:12,327 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 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:12,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:12,336 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:12,398 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 16:53:12,398 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:12,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 48 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:12,419 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:15,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 48 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:15,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:15,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 16:53:15,499 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:15,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:53:15,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:53:15,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:53:15,500 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand 50 states. [2018-12-03 16:53:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:15,614 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2018-12-03 16:53:15,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:53:15,615 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-12-03 16:53:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:15,615 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:53:15,615 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:53:15,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:53:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:53:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:53:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:53:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 102 transitions. [2018-12-03 16:53:15,619 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 102 transitions. Word has length 98 [2018-12-03 16:53:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:15,619 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 102 transitions. [2018-12-03 16:53:15,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:53:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 102 transitions. [2018-12-03 16:53:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 16:53:15,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:15,620 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1] [2018-12-03 16:53:15,620 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:15,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1006995122, now seen corresponding path program 41 times [2018-12-03 16:53:15,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:15,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:15,621 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:15,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:15,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:16,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:16,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:16,705 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:16,705 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:53:16,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:16,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 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:16,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:16,714 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:16,772 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 16:53:16,773 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:16,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:16,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:16,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:19,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:19,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 98 [2018-12-03 16:53:19,662 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:19,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:53:19,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:53:19,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:53:19,664 INFO L87 Difference]: Start difference. First operand 100 states and 102 transitions. Second operand 51 states. [2018-12-03 16:53:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:19,737 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-12-03 16:53:19,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:53:19,737 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 98 [2018-12-03 16:53:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:19,738 INFO L225 Difference]: With dead ends: 104 [2018-12-03 16:53:19,738 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 16:53:19,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:53:19,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 16:53:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 16:53:19,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 16:53:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-12-03 16:53:19,743 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 98 [2018-12-03 16:53:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:19,743 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-12-03 16:53:19,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:53:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-12-03 16:53:19,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:53:19,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:19,744 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-12-03 16:53:19,744 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:19,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:19,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1354662382, now seen corresponding path program 48 times [2018-12-03 16:53:19,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:19,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:19,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:19,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:19,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:20,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 49 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:20,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:20,672 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:20,672 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:20,672 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:53:20,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:20,672 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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:20,680 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:20,680 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:20,718 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:20,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:20,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 49 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:20,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 49 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:23,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:23,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 16:53:23,241 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:23,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:53:23,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:53:23,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:53:23,242 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 51 states. [2018-12-03 16:53:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:23,480 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-12-03 16:53:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:53:23,480 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-12-03 16:53:23,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:23,481 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:53:23,481 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 16:53:23,481 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:53:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 16:53:23,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 16:53:23,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:53:23,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2018-12-03 16:53:23,484 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 100 [2018-12-03 16:53:23,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:23,484 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2018-12-03 16:53:23,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:53:23,484 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2018-12-03 16:53:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 16:53:23,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:23,485 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1] [2018-12-03 16:53:23,485 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:23,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:23,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1354662444, now seen corresponding path program 42 times [2018-12-03 16:53:23,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:23,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:23,486 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:23,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:23,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:24,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:24,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:24,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:24,440 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:24,440 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:53:24,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:24,440 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 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:24,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:24,450 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:24,487 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:24,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:24,489 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:24,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:24,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:27,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:27,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:27,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 100 [2018-12-03 16:53:27,122 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:27,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:53:27,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:53:27,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:53:27,123 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 52 states. [2018-12-03 16:53:27,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:27,237 INFO L93 Difference]: Finished difference Result 106 states and 112 transitions. [2018-12-03 16:53:27,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:53:27,238 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 100 [2018-12-03 16:53:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:27,239 INFO L225 Difference]: With dead ends: 106 [2018-12-03 16:53:27,239 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 16:53:27,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:53:27,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 16:53:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 16:53:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 16:53:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-12-03 16:53:27,243 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 100 [2018-12-03 16:53:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:27,243 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-12-03 16:53:27,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:53:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-12-03 16:53:27,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:53:27,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:27,244 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-12-03 16:53:27,244 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:27,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:27,244 INFO L82 PathProgramCache]: Analyzing trace with hash 455509736, now seen corresponding path program 49 times [2018-12-03 16:53:27,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:27,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:27,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:27,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:27,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:28,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 50 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:28,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:28,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:28,201 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:28,201 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:53:28,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:28,201 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 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:28,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:28,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:28,248 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 50 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:28,263 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 50 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:31,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:31,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 16:53:31,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:31,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:53:31,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:53:31,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:53:31,224 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 52 states. [2018-12-03 16:53:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:31,334 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2018-12-03 16:53:31,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:53:31,334 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-12-03 16:53:31,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:31,335 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:53:31,335 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:53:31,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:53:31,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:53:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 16:53:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:53:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-12-03 16:53:31,351 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 102 [2018-12-03 16:53:31,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:31,351 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-12-03 16:53:31,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:53:31,351 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-12-03 16:53:31,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 16:53:31,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:31,352 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1] [2018-12-03 16:53:31,352 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:31,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:31,352 INFO L82 PathProgramCache]: Analyzing trace with hash 455509798, now seen corresponding path program 43 times [2018-12-03 16:53:31,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:31,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:31,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:31,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:31,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:31,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:32,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:32,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:32,296 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:32,296 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:53:32,296 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:32,296 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 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:32,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:32,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:32,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:32,357 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:32,357 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:35,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:35,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 100 [2018-12-03 16:53:35,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:35,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:53:35,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:53:35,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:53:35,738 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 53 states. [2018-12-03 16:53:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:35,855 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2018-12-03 16:53:35,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:53:35,855 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 102 [2018-12-03 16:53:35,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:35,856 INFO L225 Difference]: With dead ends: 108 [2018-12-03 16:53:35,856 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 16:53:35,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 151 SyntacticMatches, 2 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:53:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 16:53:35,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 16:53:35,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 16:53:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-12-03 16:53:35,861 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 102 [2018-12-03 16:53:35,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:35,861 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-12-03 16:53:35,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:53:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-12-03 16:53:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 16:53:35,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:35,862 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-12-03 16:53:35,862 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:35,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:35,862 INFO L82 PathProgramCache]: Analyzing trace with hash -341756574, now seen corresponding path program 50 times [2018-12-03 16:53:35,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:35,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:35,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:35,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:35,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:35,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 51 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:36,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:36,826 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:36,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:53:36,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:36,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 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:36,834 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:36,834 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:36,899 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 16:53:36,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:36,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:39,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:39,084 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:42,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:42,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:42,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2018-12-03 16:53:42,663 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:42,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 16:53:42,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 16:53:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6528, Invalid=16728, Unknown=0, NotChecked=0, Total=23256 [2018-12-03 16:53:42,665 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 105 states. [2018-12-03 16:53:47,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:47,794 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2018-12-03 16:53:47,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 16:53:47,794 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 104 [2018-12-03 16:53:47,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:47,795 INFO L225 Difference]: With dead ends: 110 [2018-12-03 16:53:47,796 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 16:53:47,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 103 SyntacticMatches, 4 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10549 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=22134, Invalid=42636, Unknown=0, NotChecked=0, Total=64770 [2018-12-03 16:53:47,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 16:53:47,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 16:53:47,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 16:53:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 109 transitions. [2018-12-03 16:53:47,802 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 109 transitions. Word has length 104 [2018-12-03 16:53:47,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:47,802 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 109 transitions. [2018-12-03 16:53:47,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 16:53:47,803 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 109 transitions. [2018-12-03 16:53:47,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:53:47,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:47,803 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-12-03 16:53:47,804 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:47,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:47,804 INFO L82 PathProgramCache]: Analyzing trace with hash -2010501796, now seen corresponding path program 51 times [2018-12-03 16:53:47,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:47,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:47,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:47,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:47,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 52 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:49,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:49,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:49,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:49,022 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:53:49,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:49,022 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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:49,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:49,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:49,072 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:49,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:49,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:49,088 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 52 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:49,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 52 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:51,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:51,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 16:53:51,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:51,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:53:51,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:53:51,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:53:51,936 INFO L87 Difference]: Start difference. First operand 107 states and 109 transitions. Second operand 54 states. [2018-12-03 16:53:52,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:52,052 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2018-12-03 16:53:52,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:53:52,052 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-12-03 16:53:52,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:52,053 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:53:52,054 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 16:53:52,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:53:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 16:53:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 16:53:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:53:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-12-03 16:53:52,058 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 106 [2018-12-03 16:53:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:52,059 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-12-03 16:53:52,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:53:52,059 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-12-03 16:53:52,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 16:53:52,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:52,060 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1] [2018-12-03 16:53:52,060 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:52,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:52,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2010501734, now seen corresponding path program 44 times [2018-12-03 16:53:52,060 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:52,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:52,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:52,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:52,061 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:52,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:53,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:53,132 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:53,132 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:53:53,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:53,132 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 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:53,141 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:53,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:53,207 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 16:53:53,207 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:53,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:53,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,224 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:56,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:56,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:56,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 100 [2018-12-03 16:53:56,159 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:56,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:53:56,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:53:56,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:53:56,160 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 55 states. [2018-12-03 16:53:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:56,229 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2018-12-03 16:53:56,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:53:56,229 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 106 [2018-12-03 16:53:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:56,230 INFO L225 Difference]: With dead ends: 112 [2018-12-03 16:53:56,231 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 16:53:56,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:53:56,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 16:53:56,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 16:53:56,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 16:53:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 111 transitions. [2018-12-03 16:53:56,235 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 111 transitions. Word has length 106 [2018-12-03 16:53:56,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:56,236 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 111 transitions. [2018-12-03 16:53:56,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:53:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 111 transitions. [2018-12-03 16:53:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:53:56,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:56,237 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-12-03 16:53:56,237 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:56,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:56,237 INFO L82 PathProgramCache]: Analyzing trace with hash 643108566, now seen corresponding path program 52 times [2018-12-03 16:53:56,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:56,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:56,238 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:56,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:56,238 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 53 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:57,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:57,268 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:57,269 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:53:57,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:57,269 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 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:53:57,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:57,278 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:57,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:57,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 53 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:57,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 53 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:00,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:00,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 16:54:00,567 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:00,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:54:00,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:54:00,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:54:00,568 INFO L87 Difference]: Start difference. First operand 109 states and 111 transitions. Second operand 55 states. [2018-12-03 16:54:00,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:00,668 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2018-12-03 16:54:00,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:54:00,668 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-12-03 16:54:00,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:00,670 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:54:00,670 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 16:54:00,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:54:00,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 16:54:00,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 16:54:00,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 16:54:00,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-12-03 16:54:00,675 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 108 [2018-12-03 16:54:00,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:00,675 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-12-03 16:54:00,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:54:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-12-03 16:54:00,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 16:54:00,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:00,676 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1] [2018-12-03 16:54:00,676 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:00,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:00,677 INFO L82 PathProgramCache]: Analyzing trace with hash 643108628, now seen corresponding path program 45 times [2018-12-03 16:54:00,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:00,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:00,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:00,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:00,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:01,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:01,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:01,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:01,736 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:54:01,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:01,736 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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:01,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:01,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:01,777 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:01,777 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:01,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:01,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:04,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:04,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 100 [2018-12-03 16:54:04,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:04,747 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:54:04,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:54:04,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:54:04,748 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 56 states. [2018-12-03 16:54:04,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:04,867 INFO L93 Difference]: Finished difference Result 114 states and 120 transitions. [2018-12-03 16:54:04,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:54:04,868 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 108 [2018-12-03 16:54:04,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:04,869 INFO L225 Difference]: With dead ends: 114 [2018-12-03 16:54:04,869 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 16:54:04,870 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 160 SyntacticMatches, 8 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:54:04,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 16:54:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 16:54:04,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 16:54:04,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 113 transitions. [2018-12-03 16:54:04,874 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 113 transitions. Word has length 108 [2018-12-03 16:54:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:04,874 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 113 transitions. [2018-12-03 16:54:04,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:54:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 113 transitions. [2018-12-03 16:54:04,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:54:04,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:04,875 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-12-03 16:54:04,875 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:04,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:04,876 INFO L82 PathProgramCache]: Analyzing trace with hash -447907376, now seen corresponding path program 53 times [2018-12-03 16:54:04,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:04,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:04,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:04,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:04,877 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:04,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 54 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:05,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:05,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:05,990 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:05,990 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:54:05,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:05,990 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 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:05,999 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:05,999 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:06,072 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 16:54:06,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:06,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:06,095 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 54 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:06,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:09,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 54 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:09,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:09,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 16:54:09,186 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:09,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:54:09,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:54:09,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:54:09,187 INFO L87 Difference]: Start difference. First operand 111 states and 113 transitions. Second operand 56 states. [2018-12-03 16:54:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:09,313 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2018-12-03 16:54:09,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:54:09,314 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-12-03 16:54:09,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:09,314 INFO L225 Difference]: With dead ends: 115 [2018-12-03 16:54:09,314 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 16:54:09,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:54:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 16:54:09,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 16:54:09,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:54:09,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-12-03 16:54:09,319 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 110 [2018-12-03 16:54:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:09,319 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-12-03 16:54:09,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:54:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-12-03 16:54:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 16:54:09,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:09,320 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1] [2018-12-03 16:54:09,320 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:09,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:09,320 INFO L82 PathProgramCache]: Analyzing trace with hash -447907314, now seen corresponding path program 46 times [2018-12-03 16:54:09,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:09,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:09,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:09,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:10,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:10,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:10,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:10,645 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:10,645 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:54:10,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:10,645 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 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:10,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:10,655 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:10,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:10,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:10,720 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:13,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:13,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:13,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 100 [2018-12-03 16:54:13,581 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:13,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:54:13,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:54:13,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:54:13,582 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 57 states. [2018-12-03 16:54:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:13,705 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2018-12-03 16:54:13,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:54:13,705 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 110 [2018-12-03 16:54:13,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:13,706 INFO L225 Difference]: With dead ends: 116 [2018-12-03 16:54:13,706 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 16:54:13,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 163 SyntacticMatches, 10 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:54:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 16:54:13,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 16:54:13,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 16:54:13,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 115 transitions. [2018-12-03 16:54:13,710 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 115 transitions. Word has length 110 [2018-12-03 16:54:13,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:13,711 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 115 transitions. [2018-12-03 16:54:13,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:54:13,711 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 115 transitions. [2018-12-03 16:54:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 16:54:13,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:13,712 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-12-03 16:54:13,712 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:13,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:13,712 INFO L82 PathProgramCache]: Analyzing trace with hash -942207414, now seen corresponding path program 54 times [2018-12-03 16:54:13,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:13,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:13,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:13,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:13,713 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:13,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:15,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 55 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:15,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:15,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:15,183 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:15,183 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:54:15,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:15,183 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 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:15,191 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:15,191 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:15,234 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:15,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:15,237 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 55 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:15,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 55 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:18,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:18,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 16:54:18,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:18,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:54:18,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:54:18,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:54:18,530 INFO L87 Difference]: Start difference. First operand 113 states and 115 transitions. Second operand 57 states. [2018-12-03 16:54:18,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:18,659 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-12-03 16:54:18,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:54:18,660 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-12-03 16:54:18,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:18,661 INFO L225 Difference]: With dead ends: 117 [2018-12-03 16:54:18,661 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 16:54:18,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:54:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 16:54:18,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 16:54:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:54:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2018-12-03 16:54:18,666 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 112 [2018-12-03 16:54:18,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:18,667 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2018-12-03 16:54:18,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:54:18,667 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2018-12-03 16:54:18,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 16:54:18,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:18,667 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 1, 1] [2018-12-03 16:54:18,668 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:18,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:18,668 INFO L82 PathProgramCache]: Analyzing trace with hash -942207352, now seen corresponding path program 47 times [2018-12-03 16:54:18,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:18,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:18,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:18,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:18,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:20,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:20,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:20,127 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:20,127 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:20,127 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:54:20,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:20,128 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:20,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:20,136 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:20,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 16:54:20,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:20,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:20,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:23,035 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:23,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:23,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 100 [2018-12-03 16:54:23,054 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:23,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:54:23,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:54:23,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:54:23,056 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 58 states. [2018-12-03 16:54:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:23,143 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2018-12-03 16:54:23,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:54:23,144 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-12-03 16:54:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:23,145 INFO L225 Difference]: With dead ends: 118 [2018-12-03 16:54:23,145 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 16:54:23,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 166 SyntacticMatches, 12 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 594 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:54:23,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 16:54:23,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 16:54:23,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 16:54:23,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-12-03 16:54:23,151 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 112 [2018-12-03 16:54:23,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:23,151 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-12-03 16:54:23,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:54:23,151 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-12-03 16:54:23,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 16:54:23,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:23,152 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-12-03 16:54:23,152 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:23,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:23,152 INFO L82 PathProgramCache]: Analyzing trace with hash 776825924, now seen corresponding path program 55 times [2018-12-03 16:54:23,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:23,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:23,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:23,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 56 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:24,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:24,284 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:24,285 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:24,285 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:54:24,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:24,285 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:24,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:24,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:24,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 56 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:24,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 56 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:27,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:27,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 16:54:27,893 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:27,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:54:27,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:54:27,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:54:27,894 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 58 states. [2018-12-03 16:54:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:28,024 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2018-12-03 16:54:28,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:54:28,024 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-12-03 16:54:28,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:28,025 INFO L225 Difference]: With dead ends: 119 [2018-12-03 16:54:28,025 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 16:54:28,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:54:28,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 16:54:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 16:54:28,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 16:54:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 118 transitions. [2018-12-03 16:54:28,028 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 118 transitions. Word has length 114 [2018-12-03 16:54:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:28,029 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 118 transitions. [2018-12-03 16:54:28,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:54:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 118 transitions. [2018-12-03 16:54:28,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 16:54:28,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:28,029 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 1, 1] [2018-12-03 16:54:28,030 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:28,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash 776825986, now seen corresponding path program 48 times [2018-12-03 16:54:28,030 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:28,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:28,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:28,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:28,031 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:28,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:29,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:29,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:29,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:29,194 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:29,194 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:54:29,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:29,195 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:29,202 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:29,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:29,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:29,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:29,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:29,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:29,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:32,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:32,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:32,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 100 [2018-12-03 16:54:32,378 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:32,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:54:32,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:54:32,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:54:32,379 INFO L87 Difference]: Start difference. First operand 116 states and 118 transitions. Second operand 59 states. [2018-12-03 16:54:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:32,513 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2018-12-03 16:54:32,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:54:32,514 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 114 [2018-12-03 16:54:32,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:32,514 INFO L225 Difference]: With dead ends: 120 [2018-12-03 16:54:32,515 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 16:54:32,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 169 SyntacticMatches, 14 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:54:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 16:54:32,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 16:54:32,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 16:54:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 119 transitions. [2018-12-03 16:54:32,518 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 119 transitions. Word has length 114 [2018-12-03 16:54:32,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:32,518 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 119 transitions. [2018-12-03 16:54:32,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:54:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 119 transitions. [2018-12-03 16:54:32,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 16:54:32,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:32,519 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-12-03 16:54:32,519 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:32,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:32,519 INFO L82 PathProgramCache]: Analyzing trace with hash -794545218, now seen corresponding path program 56 times [2018-12-03 16:54:32,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:32,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:32,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:32,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:32,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:33,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 57 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:33,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:33,720 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:33,720 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:33,720 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:54:33,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:33,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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:33,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:33,730 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:33,804 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 16:54:33,804 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:33,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:36,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:36,562 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:40,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:40,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:40,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2018-12-03 16:54:40,870 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:40,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-12-03 16:54:40,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-12-03 16:54:40,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6861, Invalid=18261, Unknown=0, NotChecked=0, Total=25122 [2018-12-03 16:54:40,872 INFO L87 Difference]: Start difference. First operand 117 states and 119 transitions. Second operand 117 states. [2018-12-03 16:54:47,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:47,167 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2018-12-03 16:54:47,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-12-03 16:54:47,168 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 116 [2018-12-03 16:54:47,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:47,168 INFO L225 Difference]: With dead ends: 122 [2018-12-03 16:54:47,168 INFO L226 Difference]: Without dead ends: 119 [2018-12-03 16:54:47,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 115 SyntacticMatches, 16 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13729 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=24987, Invalid=49269, Unknown=0, NotChecked=0, Total=74256 [2018-12-03 16:54:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-03 16:54:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-12-03 16:54:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 16:54:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-12-03 16:54:47,175 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 116 [2018-12-03 16:54:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:47,175 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-12-03 16:54:47,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-12-03 16:54:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-12-03 16:54:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 16:54:47,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:47,176 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-12-03 16:54:47,176 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:47,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash 946275512, now seen corresponding path program 57 times [2018-12-03 16:54:47,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:47,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:47,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:47,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:47,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 58 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:48,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:48,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:48,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:48,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:54:48,371 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:48,371 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 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:48,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:48,386 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:48,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:48,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:48,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 58 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:48,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 58 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:52,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:52,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 16:54:52,171 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:52,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:54:52,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:54:52,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:54:52,172 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 60 states. [2018-12-03 16:54:52,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:52,312 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2018-12-03 16:54:52,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:54:52,313 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-12-03 16:54:52,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:52,313 INFO L225 Difference]: With dead ends: 123 [2018-12-03 16:54:52,314 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 16:54:52,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:54:52,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 16:54:52,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-03 16:54:52,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 16:54:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 122 transitions. [2018-12-03 16:54:52,318 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 122 transitions. Word has length 118 [2018-12-03 16:54:52,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:52,318 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 122 transitions. [2018-12-03 16:54:52,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:54:52,318 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 122 transitions. [2018-12-03 16:54:52,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 16:54:52,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:52,319 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 1, 1] [2018-12-03 16:54:52,319 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:52,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:52,320 INFO L82 PathProgramCache]: Analyzing trace with hash 946275574, now seen corresponding path program 49 times [2018-12-03 16:54:52,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:52,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:52,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:52,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:52,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:53,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:53,620 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:53,620 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:53,620 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:54:53,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:53,621 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:53,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:53,631 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:53,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:53,677 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:53,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:53,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:56,847 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:56,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:56,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 100 [2018-12-03 16:54:56,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:56,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:54:56,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:54:56,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:54:56,867 INFO L87 Difference]: Start difference. First operand 120 states and 122 transitions. Second operand 61 states. [2018-12-03 16:54:56,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:56,947 INFO L93 Difference]: Finished difference Result 124 states and 130 transitions. [2018-12-03 16:54:56,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:54:56,948 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 118 [2018-12-03 16:54:56,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:56,949 INFO L225 Difference]: With dead ends: 124 [2018-12-03 16:54:56,949 INFO L226 Difference]: Without dead ends: 121 [2018-12-03 16:54:56,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 175 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 891 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:54:56,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-12-03 16:54:56,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-12-03 16:54:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 16:54:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 123 transitions. [2018-12-03 16:54:56,954 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 123 transitions. Word has length 118 [2018-12-03 16:54:56,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:56,954 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 123 transitions. [2018-12-03 16:54:56,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:54:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 123 transitions. [2018-12-03 16:54:56,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 16:54:56,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:56,955 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-12-03 16:54:56,955 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:56,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:56,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1162248398, now seen corresponding path program 58 times [2018-12-03 16:54:56,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:56,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:56,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:56,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:56,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:58,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 59 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:58,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:58,253 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:58,253 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:58,253 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:54:58,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:58,253 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:54:58,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:58,261 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:58,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:58,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 59 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:58,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 59 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:02,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:02,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 16:55:02,226 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:02,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:55:02,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:55:02,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:55:02,227 INFO L87 Difference]: Start difference. First operand 121 states and 123 transitions. Second operand 61 states. [2018-12-03 16:55:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:02,320 INFO L93 Difference]: Finished difference Result 125 states and 130 transitions. [2018-12-03 16:55:02,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:55:02,321 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-12-03 16:55:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:02,322 INFO L225 Difference]: With dead ends: 125 [2018-12-03 16:55:02,322 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 16:55:02,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:55:02,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 16:55:02,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 16:55:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 16:55:02,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-12-03 16:55:02,327 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 120 [2018-12-03 16:55:02,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:02,327 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-12-03 16:55:02,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:55:02,327 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-12-03 16:55:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 16:55:02,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:02,328 INFO L402 BasicCegarLoop]: trace histogram [59, 59, 1, 1] [2018-12-03 16:55:02,328 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:02,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1162248336, now seen corresponding path program 50 times [2018-12-03 16:55:02,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:02,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:02,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:02,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:02,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:03,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:03,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:03,661 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:03,662 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:03,662 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:55:03,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:03,662 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:03,670 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:03,670 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:03,751 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 16:55:03,751 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:03,753 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:03,770 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:07,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:07,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 100 [2018-12-03 16:55:07,066 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:07,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:55:07,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:55:07,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:55:07,067 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 62 states. [2018-12-03 16:55:07,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:07,175 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2018-12-03 16:55:07,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:55:07,176 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 120 [2018-12-03 16:55:07,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:07,176 INFO L225 Difference]: With dead ends: 126 [2018-12-03 16:55:07,176 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 16:55:07,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 178 SyntacticMatches, 20 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:55:07,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 16:55:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 16:55:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 16:55:07,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 125 transitions. [2018-12-03 16:55:07,182 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 125 transitions. Word has length 120 [2018-12-03 16:55:07,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:07,182 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 125 transitions. [2018-12-03 16:55:07,182 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:55:07,182 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 125 transitions. [2018-12-03 16:55:07,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 16:55:07,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:07,183 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-12-03 16:55:07,183 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:07,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:07,183 INFO L82 PathProgramCache]: Analyzing trace with hash -229162196, now seen corresponding path program 59 times [2018-12-03 16:55:07,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:07,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:07,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:07,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:07,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 60 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:08,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:08,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:08,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:08,474 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:55:08,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:08,474 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:08,483 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:08,483 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:08,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 61 check-sat command(s) [2018-12-03 16:55:08,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:08,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 60 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:08,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 60 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:12,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:12,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 16:55:12,768 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:12,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:55:12,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:55:12,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:55:12,769 INFO L87 Difference]: Start difference. First operand 123 states and 125 transitions. Second operand 62 states. [2018-12-03 16:55:12,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:12,883 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2018-12-03 16:55:12,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:55:12,883 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-12-03 16:55:12,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:12,884 INFO L225 Difference]: With dead ends: 127 [2018-12-03 16:55:12,884 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 16:55:12,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:55:12,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 16:55:12,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 16:55:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 16:55:12,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 126 transitions. [2018-12-03 16:55:12,889 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 126 transitions. Word has length 122 [2018-12-03 16:55:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:12,889 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 126 transitions. [2018-12-03 16:55:12,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:55:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 126 transitions. [2018-12-03 16:55:12,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 16:55:12,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:12,890 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 1, 1] [2018-12-03 16:55:12,891 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:12,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:12,891 INFO L82 PathProgramCache]: Analyzing trace with hash -229162134, now seen corresponding path program 51 times [2018-12-03 16:55:12,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:12,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:12,892 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:12,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:12,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:14,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:14,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:14,261 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:14,261 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:14,261 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:55:14,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:14,261 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:14,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:14,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:14,329 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:14,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:14,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:14,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:14,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:17,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:17,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 100 [2018-12-03 16:55:17,621 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:17,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:55:17,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:55:17,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:55:17,622 INFO L87 Difference]: Start difference. First operand 124 states and 126 transitions. Second operand 63 states. [2018-12-03 16:55:17,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:17,756 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-12-03 16:55:17,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:55:17,757 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 122 [2018-12-03 16:55:17,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:17,757 INFO L225 Difference]: With dead ends: 128 [2018-12-03 16:55:17,757 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 16:55:17,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 181 SyntacticMatches, 22 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1089 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:55:17,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 16:55:17,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-03 16:55:17,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 16:55:17,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 127 transitions. [2018-12-03 16:55:17,762 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 127 transitions. Word has length 122 [2018-12-03 16:55:17,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:17,762 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 127 transitions. [2018-12-03 16:55:17,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:55:17,762 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 127 transitions. [2018-12-03 16:55:17,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 16:55:17,763 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:17,763 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-12-03 16:55:17,763 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:17,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:17,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1181486938, now seen corresponding path program 60 times [2018-12-03 16:55:17,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:17,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:17,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:17,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:17,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:17,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:19,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 61 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:19,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:19,163 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:19,163 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:19,163 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:55:19,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:19,163 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 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:19,171 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:19,171 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:19,219 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:19,219 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:19,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 61 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:19,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:23,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 61 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:23,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:23,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 16:55:23,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:23,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:55:23,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:55:23,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:55:23,388 INFO L87 Difference]: Start difference. First operand 125 states and 127 transitions. Second operand 63 states. [2018-12-03 16:55:23,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:23,525 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2018-12-03 16:55:23,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:55:23,525 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-12-03 16:55:23,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:23,526 INFO L225 Difference]: With dead ends: 129 [2018-12-03 16:55:23,526 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 16:55:23,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:55:23,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 16:55:23,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 16:55:23,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 16:55:23,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-12-03 16:55:23,529 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 124 [2018-12-03 16:55:23,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:23,529 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-12-03 16:55:23,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:55:23,530 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-12-03 16:55:23,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 16:55:23,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:23,530 INFO L402 BasicCegarLoop]: trace histogram [61, 61, 1, 1] [2018-12-03 16:55:23,530 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:23,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:23,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1181486876, now seen corresponding path program 52 times [2018-12-03 16:55:23,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:23,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:23,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:23,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:23,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:24,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:24,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:24,913 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:24,913 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:24,913 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:55:24,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:24,913 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 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:24,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:24,923 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:24,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:24,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:24,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:28,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:28,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:28,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 100 [2018-12-03 16:55:28,200 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:28,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:55:28,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:55:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:55:28,201 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 64 states. [2018-12-03 16:55:28,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:28,328 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2018-12-03 16:55:28,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:55:28,329 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 124 [2018-12-03 16:55:28,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:28,329 INFO L225 Difference]: With dead ends: 130 [2018-12-03 16:55:28,329 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 16:55:28,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 184 SyntacticMatches, 24 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:55:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 16:55:28,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-12-03 16:55:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-03 16:55:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 129 transitions. [2018-12-03 16:55:28,333 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 129 transitions. Word has length 124 [2018-12-03 16:55:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:28,333 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 129 transitions. [2018-12-03 16:55:28,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:55:28,333 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 129 transitions. [2018-12-03 16:55:28,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 16:55:28,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:28,333 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-12-03 16:55:28,334 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:28,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:28,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1537529952, now seen corresponding path program 61 times [2018-12-03 16:55:28,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:28,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:28,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:28,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:28,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:29,721 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 62 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:29,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:29,722 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:29,722 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:29,722 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:55:29,722 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:29,722 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 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 114 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:29,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:29,731 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:29,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:29,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 62 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:29,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 62 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:34,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:34,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 16:55:34,043 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:34,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:55:34,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:55:34,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:55:34,045 INFO L87 Difference]: Start difference. First operand 127 states and 129 transitions. Second operand 64 states. [2018-12-03 16:55:34,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:34,141 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2018-12-03 16:55:34,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:55:34,141 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-12-03 16:55:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:34,142 INFO L225 Difference]: With dead ends: 131 [2018-12-03 16:55:34,142 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 16:55:34,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:55:34,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 16:55:34,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-03 16:55:34,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 16:55:34,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2018-12-03 16:55:34,145 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 126 [2018-12-03 16:55:34,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:34,146 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2018-12-03 16:55:34,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:55:34,146 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2018-12-03 16:55:34,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-03 16:55:34,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:34,146 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 1, 1] [2018-12-03 16:55:34,146 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:34,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:34,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1537529890, now seen corresponding path program 53 times [2018-12-03 16:55:34,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:34,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:34,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:34,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:34,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:35,600 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:35,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:35,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:35,601 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:35,601 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:55:35,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:35,601 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 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 115 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:35,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:35,609 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:35,694 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 16:55:35,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:35,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:35,714 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:35,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:38,977 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:38,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:38,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 100 [2018-12-03 16:55:38,996 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:38,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:55:38,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:55:38,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:55:38,997 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand 65 states. [2018-12-03 16:55:39,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:39,083 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2018-12-03 16:55:39,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:55:39,083 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 126 [2018-12-03 16:55:39,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:39,084 INFO L225 Difference]: With dead ends: 132 [2018-12-03 16:55:39,084 INFO L226 Difference]: Without dead ends: 129 [2018-12-03 16:55:39,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 187 SyntacticMatches, 26 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:55:39,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-03 16:55:39,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-12-03 16:55:39,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 16:55:39,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-12-03 16:55:39,089 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 126 [2018-12-03 16:55:39,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:39,089 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-12-03 16:55:39,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:55:39,090 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-12-03 16:55:39,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 16:55:39,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:39,090 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-12-03 16:55:39,090 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:39,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash -97482726, now seen corresponding path program 62 times [2018-12-03 16:55:39,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:39,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:39,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:39,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:39,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:40,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 63 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:40,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:40,545 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:40,545 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:40,546 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:55:40,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:40,546 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 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:40,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:40,556 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:40,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-12-03 16:55:40,643 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:40,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 63 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:40,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 63 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:45,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:45,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 16:55:45,120 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:45,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:55:45,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:55:45,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:55:45,121 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 65 states. [2018-12-03 16:55:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:45,248 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2018-12-03 16:55:45,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:55:45,248 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-12-03 16:55:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:45,249 INFO L225 Difference]: With dead ends: 133 [2018-12-03 16:55:45,249 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 16:55:45,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:55:45,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 16:55:45,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 16:55:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 16:55:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2018-12-03 16:55:45,253 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 128 [2018-12-03 16:55:45,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:45,253 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2018-12-03 16:55:45,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:55:45,253 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2018-12-03 16:55:45,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 16:55:45,254 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:45,254 INFO L402 BasicCegarLoop]: trace histogram [63, 63, 1, 1] [2018-12-03 16:55:45,254 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:45,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:45,254 INFO L82 PathProgramCache]: Analyzing trace with hash -97482664, now seen corresponding path program 54 times [2018-12-03 16:55:45,254 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:45,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:45,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:45,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:45,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:45,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:47,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:47,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:47,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:47,023 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:47,023 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:55:47,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:47,023 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 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 117 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:47,031 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:47,031 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:47,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:47,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:47,082 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:47,100 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:50,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:50,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 100 [2018-12-03 16:55:50,140 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:50,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:55:50,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:55:50,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:55:50,141 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 66 states. [2018-12-03 16:55:50,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:50,270 INFO L93 Difference]: Finished difference Result 134 states and 140 transitions. [2018-12-03 16:55:50,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:55:50,271 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 128 [2018-12-03 16:55:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:50,271 INFO L225 Difference]: With dead ends: 134 [2018-12-03 16:55:50,271 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 16:55:50,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 190 SyntacticMatches, 28 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:55:50,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 16:55:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 16:55:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 16:55:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2018-12-03 16:55:50,274 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 128 [2018-12-03 16:55:50,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:50,274 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2018-12-03 16:55:50,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:55:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2018-12-03 16:55:50,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 16:55:50,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:50,275 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-12-03 16:55:50,275 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:50,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:50,275 INFO L82 PathProgramCache]: Analyzing trace with hash 808432148, now seen corresponding path program 63 times [2018-12-03 16:55:50,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:50,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:50,276 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:50,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:50,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:50,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:52,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 64 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:52,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:52,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:52,096 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:52,096 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:55:52,096 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:52,096 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 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 118 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:52,105 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:52,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:52,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:52,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:52,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 64 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:52,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 64 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:56,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:56,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 16:55:56,467 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:56,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:55:56,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:55:56,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:55:56,468 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand 66 states. [2018-12-03 16:55:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:56,592 INFO L93 Difference]: Finished difference Result 135 states and 140 transitions. [2018-12-03 16:55:56,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:55:56,593 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-12-03 16:55:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:56,594 INFO L225 Difference]: With dead ends: 135 [2018-12-03 16:55:56,594 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 16:55:56,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:55:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 16:55:56,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 16:55:56,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 16:55:56,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 134 transitions. [2018-12-03 16:55:56,598 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 134 transitions. Word has length 130 [2018-12-03 16:55:56,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:56,598 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 134 transitions. [2018-12-03 16:55:56,598 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:55:56,599 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 134 transitions. [2018-12-03 16:55:56,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 16:55:56,599 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:56,599 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 1, 1] [2018-12-03 16:55:56,599 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:56,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:56,599 INFO L82 PathProgramCache]: Analyzing trace with hash 808432210, now seen corresponding path program 55 times [2018-12-03 16:55:56,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:56,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:56,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:56,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:56,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:58,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:58,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:58,438 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:58,438 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:58,439 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:55:58,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:58,439 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 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 119 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:58,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:58,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:58,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:58,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:58,515 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:01,637 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:01,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:01,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 100 [2018-12-03 16:56:01,656 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:01,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:56:01,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:56:01,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:56:01,657 INFO L87 Difference]: Start difference. First operand 132 states and 134 transitions. Second operand 67 states. [2018-12-03 16:56:01,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:01,794 INFO L93 Difference]: Finished difference Result 136 states and 142 transitions. [2018-12-03 16:56:01,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:56:01,795 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 130 [2018-12-03 16:56:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:01,795 INFO L225 Difference]: With dead ends: 136 [2018-12-03 16:56:01,795 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 16:56:01,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 193 SyntacticMatches, 30 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:56:01,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 16:56:01,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 16:56:01,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 16:56:01,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-12-03 16:56:01,800 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 130 [2018-12-03 16:56:01,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:01,800 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-12-03 16:56:01,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:56:01,800 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-12-03 16:56:01,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 16:56:01,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:01,800 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-12-03 16:56:01,801 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:01,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:01,801 INFO L82 PathProgramCache]: Analyzing trace with hash -485735026, now seen corresponding path program 64 times [2018-12-03 16:56:01,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:01,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:01,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:01,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:01,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:03,573 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 65 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:03,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:03,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:03,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:03,574 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:56:03,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:03,574 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 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 120 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:03,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:03,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:03,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 65 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:03,653 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:08,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 65 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:08,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:08,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 16:56:08,133 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:08,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:56:08,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:56:08,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:56:08,134 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 67 states. [2018-12-03 16:56:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:08,285 INFO L93 Difference]: Finished difference Result 137 states and 142 transitions. [2018-12-03 16:56:08,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:56:08,286 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-12-03 16:56:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:08,286 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:56:08,286 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 16:56:08,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:56:08,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 16:56:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 16:56:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 16:56:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2018-12-03 16:56:08,291 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 132 [2018-12-03 16:56:08,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:08,291 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2018-12-03 16:56:08,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:56:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2018-12-03 16:56:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 16:56:08,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:08,292 INFO L402 BasicCegarLoop]: trace histogram [65, 65, 1, 1] [2018-12-03 16:56:08,292 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:08,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash -485734964, now seen corresponding path program 56 times [2018-12-03 16:56:08,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:08,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:08,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:08,293 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:09,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:09,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:09,866 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:09,866 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:56:09,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:09,866 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 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 121 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:09,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:09,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:09,984 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 16:56:09,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:09,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:10,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:13,395 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:13,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:13,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 100 [2018-12-03 16:56:13,413 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:13,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:56:13,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:56:13,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:56:13,414 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 68 states. [2018-12-03 16:56:13,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:13,509 INFO L93 Difference]: Finished difference Result 138 states and 144 transitions. [2018-12-03 16:56:13,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:56:13,509 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-12-03 16:56:13,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:13,510 INFO L225 Difference]: With dead ends: 138 [2018-12-03 16:56:13,510 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 16:56:13,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 196 SyntacticMatches, 32 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1584 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:56:13,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 16:56:13,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-12-03 16:56:13,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-12-03 16:56:13,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 137 transitions. [2018-12-03 16:56:13,514 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 137 transitions. Word has length 132 [2018-12-03 16:56:13,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:13,514 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 137 transitions. [2018-12-03 16:56:13,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:56:13,514 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 137 transitions. [2018-12-03 16:56:13,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 16:56:13,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:13,515 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-12-03 16:56:13,515 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:13,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:13,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1360126600, now seen corresponding path program 65 times [2018-12-03 16:56:13,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:13,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:13,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:13,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:13,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:13,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 66 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:15,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:15,081 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:15,081 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:15,081 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:56:15,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:15,081 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 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 122 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:15,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:15,090 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:15,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 67 check-sat command(s) [2018-12-03 16:56:15,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:15,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 66 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:15,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:20,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 66 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:20,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:20,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 16:56:20,051 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:20,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:56:20,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:56:20,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:56:20,053 INFO L87 Difference]: Start difference. First operand 135 states and 137 transitions. Second operand 68 states. [2018-12-03 16:56:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:20,154 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-12-03 16:56:20,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:56:20,154 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-12-03 16:56:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:20,155 INFO L225 Difference]: With dead ends: 139 [2018-12-03 16:56:20,155 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 16:56:20,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:56:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 16:56:20,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 16:56:20,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 16:56:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-12-03 16:56:20,159 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 134 [2018-12-03 16:56:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:20,159 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-12-03 16:56:20,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:56:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-12-03 16:56:20,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-12-03 16:56:20,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:20,160 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 1, 1] [2018-12-03 16:56:20,160 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:20,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:20,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1360126662, now seen corresponding path program 57 times [2018-12-03 16:56:20,160 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:20,161 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:20,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:20,161 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:21,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:21,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:21,804 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:21,804 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:21,805 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:56:21,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:21,805 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 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 123 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:21,813 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:21,813 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:21,862 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:21,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:21,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:21,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:21,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:25,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:25,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2018-12-03 16:56:25,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:25,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:56:25,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:56:25,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:56:25,271 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 69 states. [2018-12-03 16:56:25,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:25,414 INFO L93 Difference]: Finished difference Result 140 states and 146 transitions. [2018-12-03 16:56:25,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:56:25,414 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 134 [2018-12-03 16:56:25,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:25,415 INFO L225 Difference]: With dead ends: 140 [2018-12-03 16:56:25,415 INFO L226 Difference]: Without dead ends: 137 [2018-12-03 16:56:25,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 199 SyntacticMatches, 34 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1683 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:56:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-03 16:56:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-12-03 16:56:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 16:56:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 139 transitions. [2018-12-03 16:56:25,420 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 139 transitions. Word has length 134 [2018-12-03 16:56:25,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:25,420 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 139 transitions. [2018-12-03 16:56:25,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:56:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 139 transitions. [2018-12-03 16:56:25,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 16:56:25,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:25,421 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-12-03 16:56:25,421 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:25,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:25,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1411655938, now seen corresponding path program 66 times [2018-12-03 16:56:25,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:25,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:25,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:25,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:27,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 67 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:27,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:27,078 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:27,078 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:27,078 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:56:27,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:27,078 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 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 124 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:27,089 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:27,089 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:27,140 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:27,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:27,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 67 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:27,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 67 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:32,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:32,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 16:56:32,104 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:32,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:56:32,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:56:32,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:56:32,106 INFO L87 Difference]: Start difference. First operand 137 states and 139 transitions. Second operand 69 states. [2018-12-03 16:56:32,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:32,217 INFO L93 Difference]: Finished difference Result 141 states and 146 transitions. [2018-12-03 16:56:32,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:56:32,217 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-12-03 16:56:32,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:32,217 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:56:32,218 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 16:56:32,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:56:32,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 16:56:32,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 16:56:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 16:56:32,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2018-12-03 16:56:32,222 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 136 [2018-12-03 16:56:32,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:32,223 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2018-12-03 16:56:32,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:56:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2018-12-03 16:56:32,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 16:56:32,223 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:32,224 INFO L402 BasicCegarLoop]: trace histogram [67, 67, 1, 1] [2018-12-03 16:56:32,224 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:32,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:32,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1411656000, now seen corresponding path program 58 times [2018-12-03 16:56:32,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:32,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:32,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:32,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:32,225 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:34,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:34,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:34,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:34,205 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:34,205 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:56:34,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:34,206 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 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 125 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:34,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:34,214 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:34,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:34,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:34,287 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:37,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:37,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:37,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 100 [2018-12-03 16:56:37,474 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:37,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:56:37,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:56:37,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:56:37,475 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand 70 states. [2018-12-03 16:56:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:37,633 INFO L93 Difference]: Finished difference Result 142 states and 148 transitions. [2018-12-03 16:56:37,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:56:37,633 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 136 [2018-12-03 16:56:37,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:37,634 INFO L225 Difference]: With dead ends: 142 [2018-12-03 16:56:37,634 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 16:56:37,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 202 SyntacticMatches, 36 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:56:37,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 16:56:37,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 16:56:37,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 16:56:37,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 141 transitions. [2018-12-03 16:56:37,638 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 141 transitions. Word has length 136 [2018-12-03 16:56:37,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:37,639 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 141 transitions. [2018-12-03 16:56:37,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:56:37,639 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 141 transitions. [2018-12-03 16:56:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 16:56:37,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:37,639 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-12-03 16:56:37,639 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:37,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:37,640 INFO L82 PathProgramCache]: Analyzing trace with hash -608257796, now seen corresponding path program 67 times [2018-12-03 16:56:37,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:37,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:37,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:37,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:37,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:37,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:39,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 68 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:39,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:39,608 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:39,608 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:39,608 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:56:39,608 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:39,608 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 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 126 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:39,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:39,616 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:39,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:39,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:39,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 68 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:39,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:44,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 68 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:44,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:44,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 16:56:44,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:44,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:56:44,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:56:44,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:56:44,937 INFO L87 Difference]: Start difference. First operand 139 states and 141 transitions. Second operand 70 states. [2018-12-03 16:56:45,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:45,033 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2018-12-03 16:56:45,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:56:45,033 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-12-03 16:56:45,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:45,034 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:56:45,034 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 16:56:45,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:56:45,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 16:56:45,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 16:56:45,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 16:56:45,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 142 transitions. [2018-12-03 16:56:45,039 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 142 transitions. Word has length 138 [2018-12-03 16:56:45,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:45,039 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 142 transitions. [2018-12-03 16:56:45,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:56:45,039 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 142 transitions. [2018-12-03 16:56:45,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 16:56:45,040 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:45,040 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 1, 1] [2018-12-03 16:56:45,040 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:45,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:45,041 INFO L82 PathProgramCache]: Analyzing trace with hash -608257734, now seen corresponding path program 59 times [2018-12-03 16:56:45,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:45,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:45,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:45,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:45,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:46,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:46,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:46,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:46,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:46,942 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:56:46,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:46,942 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 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 127 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:46,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:46,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:47,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-03 16:56:47,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:47,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:47,078 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:47,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:50,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:50,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 100 [2018-12-03 16:56:50,601 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:50,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:56:50,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:56:50,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:56:50,603 INFO L87 Difference]: Start difference. First operand 140 states and 142 transitions. Second operand 71 states. [2018-12-03 16:56:50,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:50,765 INFO L93 Difference]: Finished difference Result 144 states and 150 transitions. [2018-12-03 16:56:50,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:56:50,766 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 138 [2018-12-03 16:56:50,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:50,766 INFO L225 Difference]: With dead ends: 144 [2018-12-03 16:56:50,766 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 16:56:50,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 205 SyntacticMatches, 38 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:56:50,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 16:56:50,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 16:56:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 16:56:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 143 transitions. [2018-12-03 16:56:50,771 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 143 transitions. Word has length 138 [2018-12-03 16:56:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:50,771 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 143 transitions. [2018-12-03 16:56:50,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:56:50,771 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 143 transitions. [2018-12-03 16:56:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 16:56:50,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:50,772 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-12-03 16:56:50,772 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:50,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:50,772 INFO L82 PathProgramCache]: Analyzing trace with hash -420138378, now seen corresponding path program 68 times [2018-12-03 16:56:50,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:50,773 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:50,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:50,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:52,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 69 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:52,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:52,504 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:52,504 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:52,505 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:56:52,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:52,505 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 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 128 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:52,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:52,516 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:52,618 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-12-03 16:56:52,618 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:52,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:56,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:56,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:01,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:01,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:01,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2018-12-03 16:57:01,560 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:01,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-12-03 16:57:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-12-03 16:57:01,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7635, Invalid=21435, Unknown=0, NotChecked=0, Total=29070 [2018-12-03 16:57:01,562 INFO L87 Difference]: Start difference. First operand 141 states and 143 transitions. Second operand 141 states. [2018-12-03 16:57:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:10,501 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2018-12-03 16:57:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-12-03 16:57:10,501 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 140 [2018-12-03 16:57:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:10,502 INFO L225 Difference]: With dead ends: 146 [2018-12-03 16:57:10,502 INFO L226 Difference]: Without dead ends: 143 [2018-12-03 16:57:10,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 486 GetRequests, 139 SyntacticMatches, 40 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20953 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=31233, Invalid=63939, Unknown=0, NotChecked=0, Total=95172 [2018-12-03 16:57:10,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-03 16:57:10,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-12-03 16:57:10,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 16:57:10,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-12-03 16:57:10,509 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 140 [2018-12-03 16:57:10,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:10,509 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-12-03 16:57:10,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-12-03 16:57:10,509 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-12-03 16:57:10,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 16:57:10,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:10,510 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-12-03 16:57:10,510 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:10,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:10,510 INFO L82 PathProgramCache]: Analyzing trace with hash -26004112, now seen corresponding path program 69 times [2018-12-03 16:57:10,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:10,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:10,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:10,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:10,512 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 70 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:12,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:12,316 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:12,317 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:12,317 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:57:12,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:12,317 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 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 129 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:12,330 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:12,331 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:12,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:12,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:12,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:12,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 70 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:12,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 70 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:17,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:17,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 16:57:17,896 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:17,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:57:17,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:57:17,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:57:17,897 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 72 states. [2018-12-03 16:57:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:18,065 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2018-12-03 16:57:18,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:57:18,066 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-12-03 16:57:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:18,066 INFO L225 Difference]: With dead ends: 147 [2018-12-03 16:57:18,066 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 16:57:18,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:57:18,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 16:57:18,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-03 16:57:18,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 16:57:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 146 transitions. [2018-12-03 16:57:18,070 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 146 transitions. Word has length 142 [2018-12-03 16:57:18,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:18,070 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 146 transitions. [2018-12-03 16:57:18,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:57:18,070 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 146 transitions. [2018-12-03 16:57:18,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 16:57:18,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:18,070 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 1, 1] [2018-12-03 16:57:18,070 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:18,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:18,071 INFO L82 PathProgramCache]: Analyzing trace with hash -26004050, now seen corresponding path program 60 times [2018-12-03 16:57:18,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:18,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:18,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:20,199 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:20,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:20,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:20,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:20,200 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:57:20,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:20,200 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 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 130 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:20,208 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:20,209 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:20,261 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:20,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:20,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:20,285 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:20,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:23,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:23,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 100 [2018-12-03 16:57:23,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:23,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:57:23,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:57:23,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:57:23,506 INFO L87 Difference]: Start difference. First operand 144 states and 146 transitions. Second operand 73 states. [2018-12-03 16:57:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:23,679 INFO L93 Difference]: Finished difference Result 148 states and 154 transitions. [2018-12-03 16:57:23,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:57:23,679 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 142 [2018-12-03 16:57:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:23,680 INFO L225 Difference]: With dead ends: 148 [2018-12-03 16:57:23,680 INFO L226 Difference]: Without dead ends: 145 [2018-12-03 16:57:23,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 211 SyntacticMatches, 42 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2079 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:57:23,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-12-03 16:57:23,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-12-03 16:57:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 16:57:23,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 147 transitions. [2018-12-03 16:57:23,685 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 147 transitions. Word has length 142 [2018-12-03 16:57:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:23,685 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 147 transitions. [2018-12-03 16:57:23,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:57:23,685 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 147 transitions. [2018-12-03 16:57:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 16:57:23,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:23,686 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-12-03 16:57:23,686 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:23,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:23,687 INFO L82 PathProgramCache]: Analyzing trace with hash 779903466, now seen corresponding path program 70 times [2018-12-03 16:57:23,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:23,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:23,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:23,688 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 71 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:25,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:25,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:25,835 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:57:25,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,835 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 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 131 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:25,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:25,843 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:25,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 71 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:25,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 71 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:31,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:31,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 16:57:31,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:31,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:57:31,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:57:31,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:57:31,464 INFO L87 Difference]: Start difference. First operand 145 states and 147 transitions. Second operand 73 states. [2018-12-03 16:57:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:31,637 INFO L93 Difference]: Finished difference Result 149 states and 154 transitions. [2018-12-03 16:57:31,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:57:31,638 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-12-03 16:57:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:31,638 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:57:31,638 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 16:57:31,639 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:57:31,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 16:57:31,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 16:57:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 16:57:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2018-12-03 16:57:31,643 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 144 [2018-12-03 16:57:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:31,643 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2018-12-03 16:57:31,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:57:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2018-12-03 16:57:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 16:57:31,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:31,644 INFO L402 BasicCegarLoop]: trace histogram [71, 71, 1, 1] [2018-12-03 16:57:31,644 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:31,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:31,644 INFO L82 PathProgramCache]: Analyzing trace with hash 779903528, now seen corresponding path program 61 times [2018-12-03 16:57:31,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:31,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:31,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:31,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:31,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:33,508 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:57:33,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:33,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:33,509 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:33,509 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:57:33,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:33,509 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 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 132 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:33,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:33,517 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:33,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:33,597 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:57:33,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:37,032 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:57:37,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:37,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 100 [2018-12-03 16:57:37,051 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:37,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:57:37,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:57:37,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:57:37,052 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 74 states. [2018-12-03 16:57:37,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:37,172 INFO L93 Difference]: Finished difference Result 150 states and 156 transitions. [2018-12-03 16:57:37,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:57:37,173 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 144 [2018-12-03 16:57:37,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:37,174 INFO L225 Difference]: With dead ends: 150 [2018-12-03 16:57:37,174 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 16:57:37,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 214 SyntacticMatches, 44 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2178 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:57:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 16:57:37,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 16:57:37,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 16:57:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2018-12-03 16:57:37,179 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 144 [2018-12-03 16:57:37,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:37,179 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-12-03 16:57:37,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:57:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2018-12-03 16:57:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 16:57:37,179 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:37,180 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-12-03 16:57:37,180 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:37,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:37,180 INFO L82 PathProgramCache]: Analyzing trace with hash -2131994652, now seen corresponding path program 71 times [2018-12-03 16:57:37,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:37,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:37,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:37,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:37,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:39,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 72 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:39,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:39,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:39,068 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:39,068 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:57:39,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:39,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 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 133 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:39,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:39,077 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:39,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2018-12-03 16:57:39,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:39,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 72 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:39,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 72 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:45,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:45,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 16:57:45,150 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:45,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:57:45,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:57:45,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:57:45,152 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 74 states. [2018-12-03 16:57:45,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:45,283 INFO L93 Difference]: Finished difference Result 151 states and 156 transitions. [2018-12-03 16:57:45,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:57:45,284 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-12-03 16:57:45,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:45,284 INFO L225 Difference]: With dead ends: 151 [2018-12-03 16:57:45,284 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 16:57:45,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:57:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 16:57:45,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 16:57:45,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 16:57:45,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-12-03 16:57:45,288 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 146 [2018-12-03 16:57:45,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:45,289 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-12-03 16:57:45,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:57:45,289 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-12-03 16:57:45,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 16:57:45,289 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:45,289 INFO L402 BasicCegarLoop]: trace histogram [72, 72, 1, 1] [2018-12-03 16:57:45,289 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:45,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:45,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2131994590, now seen corresponding path program 62 times [2018-12-03 16:57:45,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:45,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:45,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:45,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:45,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:47,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:47,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:47,217 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:47,217 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:57:47,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:47,217 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 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 134 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:47,225 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:47,225 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:47,333 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 73 check-sat command(s) [2018-12-03 16:57:47,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:47,336 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:47,358 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:47,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:50,819 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:50,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:50,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 100 [2018-12-03 16:57:50,842 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:50,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:57:50,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:57:50,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:57:50,843 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 75 states. [2018-12-03 16:57:51,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:51,023 INFO L93 Difference]: Finished difference Result 152 states and 158 transitions. [2018-12-03 16:57:51,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:57:51,023 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 146 [2018-12-03 16:57:51,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:51,024 INFO L225 Difference]: With dead ends: 152 [2018-12-03 16:57:51,024 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 16:57:51,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 217 SyntacticMatches, 46 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2277 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:57:51,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 16:57:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-03 16:57:51,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 16:57:51,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 151 transitions. [2018-12-03 16:57:51,027 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 151 transitions. Word has length 146 [2018-12-03 16:57:51,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:51,027 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 151 transitions. [2018-12-03 16:57:51,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:57:51,027 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 151 transitions. [2018-12-03 16:57:51,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 16:57:51,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:51,028 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-12-03 16:57:51,028 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:51,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash -147409058, now seen corresponding path program 72 times [2018-12-03 16:57:51,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:51,029 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:51,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 73 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:52,957 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:52,958 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:52,958 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:52,958 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:57:52,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:52,958 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 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 135 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:52,981 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:52,981 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:53,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:53,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:53,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 73 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:53,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:58,810 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 73 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:58,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:58,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 16:57:58,829 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:58,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:57:58,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:57:58,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:57:58,830 INFO L87 Difference]: Start difference. First operand 149 states and 151 transitions. Second operand 75 states. [2018-12-03 16:57:59,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:59,026 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2018-12-03 16:57:59,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:57:59,026 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-12-03 16:57:59,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:59,027 INFO L225 Difference]: With dead ends: 153 [2018-12-03 16:57:59,027 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 16:57:59,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 222 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:57:59,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 16:57:59,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-03 16:57:59,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 16:57:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-12-03 16:57:59,030 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 148 [2018-12-03 16:57:59,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:59,031 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-12-03 16:57:59,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:57:59,031 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-12-03 16:57:59,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 16:57:59,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:59,031 INFO L402 BasicCegarLoop]: trace histogram [73, 73, 1, 1] [2018-12-03 16:57:59,031 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:59,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:59,032 INFO L82 PathProgramCache]: Analyzing trace with hash -147408996, now seen corresponding path program 63 times [2018-12-03 16:57:59,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:59,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:59,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:59,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:59,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:01,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:01,305 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:01,305 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:01,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:58:01,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:01,306 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 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 136 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:01,313 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:01,313 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:01,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:01,369 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:01,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:01,409 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:04,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:04,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:04,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 100 [2018-12-03 16:58:04,667 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:04,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:58:04,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:58:04,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:58:04,668 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 76 states. [2018-12-03 16:58:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:04,799 INFO L93 Difference]: Finished difference Result 154 states and 160 transitions. [2018-12-03 16:58:04,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:58:04,799 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 148 [2018-12-03 16:58:04,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:04,800 INFO L225 Difference]: With dead ends: 154 [2018-12-03 16:58:04,800 INFO L226 Difference]: Without dead ends: 151 [2018-12-03 16:58:04,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 220 SyntacticMatches, 48 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:58:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-03 16:58:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-12-03 16:58:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-03 16:58:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 153 transitions. [2018-12-03 16:58:04,803 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 153 transitions. Word has length 148 [2018-12-03 16:58:04,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:04,803 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 153 transitions. [2018-12-03 16:58:04,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:58:04,803 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 153 transitions. [2018-12-03 16:58:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 16:58:04,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:04,804 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-12-03 16:58:04,804 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:04,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:04,804 INFO L82 PathProgramCache]: Analyzing trace with hash 73867352, now seen corresponding path program 73 times [2018-12-03 16:58:04,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:04,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:04,805 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:04,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:04,805 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 74 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:06,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:06,980 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:06,980 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:06,980 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:58:06,980 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:06,980 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 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 137 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:06,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:06,989 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:07,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 74 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:07,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:13,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 74 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:13,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:13,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 16:58:13,026 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:13,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:58:13,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:58:13,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:58:13,027 INFO L87 Difference]: Start difference. First operand 151 states and 153 transitions. Second operand 76 states. [2018-12-03 16:58:13,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:13,182 INFO L93 Difference]: Finished difference Result 155 states and 160 transitions. [2018-12-03 16:58:13,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:58:13,182 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-12-03 16:58:13,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:13,183 INFO L225 Difference]: With dead ends: 155 [2018-12-03 16:58:13,183 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 16:58:13,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:58:13,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 16:58:13,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-03 16:58:13,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 16:58:13,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 154 transitions. [2018-12-03 16:58:13,186 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 154 transitions. Word has length 150 [2018-12-03 16:58:13,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:13,186 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 154 transitions. [2018-12-03 16:58:13,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:58:13,186 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 154 transitions. [2018-12-03 16:58:13,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-03 16:58:13,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:13,187 INFO L402 BasicCegarLoop]: trace histogram [74, 74, 1, 1] [2018-12-03 16:58:13,187 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:13,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash 73867414, now seen corresponding path program 64 times [2018-12-03 16:58:13,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:13,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:13,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:13,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:13,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:15,482 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:58:15,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:15,482 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:15,482 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:15,482 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:58:15,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:15,482 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 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 138 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:15,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:15,491 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:15,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:15,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:15,573 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:58:15,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:18,811 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:58:18,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:18,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 100 [2018-12-03 16:58:18,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:18,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:58:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:58:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:58:18,831 INFO L87 Difference]: Start difference. First operand 152 states and 154 transitions. Second operand 77 states. [2018-12-03 16:58:18,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:18,949 INFO L93 Difference]: Finished difference Result 156 states and 162 transitions. [2018-12-03 16:58:18,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:58:18,949 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 150 [2018-12-03 16:58:18,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:18,950 INFO L225 Difference]: With dead ends: 156 [2018-12-03 16:58:18,950 INFO L226 Difference]: Without dead ends: 153 [2018-12-03 16:58:18,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 223 SyntacticMatches, 50 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2475 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:58:18,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-12-03 16:58:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-12-03 16:58:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 16:58:18,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 155 transitions. [2018-12-03 16:58:18,953 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 155 transitions. Word has length 150 [2018-12-03 16:58:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:18,954 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 155 transitions. [2018-12-03 16:58:18,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:58:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 155 transitions. [2018-12-03 16:58:18,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 16:58:18,954 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:18,954 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-12-03 16:58:18,954 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:18,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:18,955 INFO L82 PathProgramCache]: Analyzing trace with hash -2027867438, now seen corresponding path program 74 times [2018-12-03 16:58:18,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:18,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:18,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:18,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:18,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 75 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:21,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:21,285 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:21,285 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:21,285 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:58:21,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:21,285 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 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 139 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:21,293 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:21,293 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:21,406 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 76 check-sat command(s) [2018-12-03 16:58:21,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:21,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:25,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:25,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:31,464 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:31,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:31,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2018-12-03 16:58:31,484 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:31,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-12-03 16:58:31,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-12-03 16:58:31,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8076, Invalid=23076, Unknown=0, NotChecked=0, Total=31152 [2018-12-03 16:58:31,485 INFO L87 Difference]: Start difference. First operand 153 states and 155 transitions. Second operand 153 states. [2018-12-03 16:58:41,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:41,986 INFO L93 Difference]: Finished difference Result 158 states and 165 transitions. [2018-12-03 16:58:41,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-12-03 16:58:41,987 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 152 [2018-12-03 16:58:41,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:41,988 INFO L225 Difference]: With dead ends: 158 [2018-12-03 16:58:41,988 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 16:58:41,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 528 GetRequests, 151 SyntacticMatches, 52 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24997 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=34626, Invalid=71976, Unknown=0, NotChecked=0, Total=106602 [2018-12-03 16:58:41,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 16:58:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 16:58:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 16:58:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 157 transitions. [2018-12-03 16:58:41,994 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 157 transitions. Word has length 152 [2018-12-03 16:58:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:41,995 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 157 transitions. [2018-12-03 16:58:41,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-12-03 16:58:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 157 transitions. [2018-12-03 16:58:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 16:58:41,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:41,995 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-12-03 16:58:41,995 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:41,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:41,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1134595788, now seen corresponding path program 75 times [2018-12-03 16:58:41,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:41,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:41,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:41,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:41,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 76 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:44,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:44,092 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:44,092 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:44,092 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:58:44,092 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:44,092 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 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 140 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:44,101 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:44,101 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:44,160 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:44,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:44,163 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:44,187 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 76 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:44,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:50,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 76 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:50,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:50,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 16:58:50,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:50,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:58:50,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:58:50,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:58:50,457 INFO L87 Difference]: Start difference. First operand 155 states and 157 transitions. Second operand 78 states. [2018-12-03 16:58:50,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:50,609 INFO L93 Difference]: Finished difference Result 159 states and 164 transitions. [2018-12-03 16:58:50,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:58:50,609 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-12-03 16:58:50,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:50,610 INFO L225 Difference]: With dead ends: 159 [2018-12-03 16:58:50,610 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 16:58:50,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 16:58:50,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 16:58:50,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 16:58:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 16:58:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 158 transitions. [2018-12-03 16:58:50,613 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 158 transitions. Word has length 154 [2018-12-03 16:58:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:50,613 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 158 transitions. [2018-12-03 16:58:50,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:58:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 158 transitions. [2018-12-03 16:58:50,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 16:58:50,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:50,614 INFO L402 BasicCegarLoop]: trace histogram [76, 76, 1, 1] [2018-12-03 16:58:50,614 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:50,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:50,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1134595850, now seen corresponding path program 65 times [2018-12-03 16:58:50,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:50,615 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:50,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:50,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:50,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:53,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:53,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:53,005 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:53,005 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:53,005 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:58:53,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:53,005 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 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 141 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:53,013 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:53,013 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:53,130 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 77 check-sat command(s) [2018-12-03 16:58:53,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:53,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:53,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:53,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:56,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:56,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 100 [2018-12-03 16:58:56,720 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:56,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:58:56,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:58:56,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:58:56,721 INFO L87 Difference]: Start difference. First operand 156 states and 158 transitions. Second operand 79 states. [2018-12-03 16:58:56,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:56,872 INFO L93 Difference]: Finished difference Result 160 states and 166 transitions. [2018-12-03 16:58:56,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:58:56,873 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 154 [2018-12-03 16:58:56,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:56,874 INFO L225 Difference]: With dead ends: 160 [2018-12-03 16:58:56,874 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 16:58:56,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 229 SyntacticMatches, 54 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2673 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:58:56,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 16:58:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 16:58:56,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 16:58:56,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2018-12-03 16:58:56,879 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 154 [2018-12-03 16:58:56,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:56,879 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2018-12-03 16:58:56,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:58:56,879 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2018-12-03 16:58:56,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 16:58:56,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:56,880 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-12-03 16:58:56,880 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:56,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:56,880 INFO L82 PathProgramCache]: Analyzing trace with hash -575089594, now seen corresponding path program 76 times [2018-12-03 16:58:56,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:56,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:56,880 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:56,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:56,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 77 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:59,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:59,023 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:59,023 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:59,023 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:58:59,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:59,023 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 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 142 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:59,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:59,033 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:59,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:59,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:59,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 77 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:59,117 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 77 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:05,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:05,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 16:59:05,492 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:05,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 16:59:05,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 16:59:05,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:59:05,494 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 79 states. [2018-12-03 16:59:05,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:05,710 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2018-12-03 16:59:05,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:59:05,710 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-12-03 16:59:05,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:05,710 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:59:05,711 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 16:59:05,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 16:59:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 16:59:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-12-03 16:59:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 16:59:05,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 160 transitions. [2018-12-03 16:59:05,716 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 160 transitions. Word has length 156 [2018-12-03 16:59:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:05,716 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 160 transitions. [2018-12-03 16:59:05,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 16:59:05,717 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 160 transitions. [2018-12-03 16:59:05,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 16:59:05,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:05,717 INFO L402 BasicCegarLoop]: trace histogram [77, 77, 1, 1] [2018-12-03 16:59:05,717 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:05,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:05,718 INFO L82 PathProgramCache]: Analyzing trace with hash -575089532, now seen corresponding path program 66 times [2018-12-03 16:59:05,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:05,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:05,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:05,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:05,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:08,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:08,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:08,268 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:08,268 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:08,268 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:59:08,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:08,268 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 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 143 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:08,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:08,276 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:08,338 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:08,338 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:08,341 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:08,363 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:12,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:12,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:12,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 100 [2018-12-03 16:59:12,054 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:12,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:59:12,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:59:12,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:59:12,055 INFO L87 Difference]: Start difference. First operand 158 states and 160 transitions. Second operand 80 states. [2018-12-03 16:59:12,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:12,285 INFO L93 Difference]: Finished difference Result 162 states and 168 transitions. [2018-12-03 16:59:12,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:59:12,286 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 156 [2018-12-03 16:59:12,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:12,286 INFO L225 Difference]: With dead ends: 162 [2018-12-03 16:59:12,286 INFO L226 Difference]: Without dead ends: 159 [2018-12-03 16:59:12,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 232 SyntacticMatches, 56 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2772 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:59:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-12-03 16:59:12,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-12-03 16:59:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-03 16:59:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 161 transitions. [2018-12-03 16:59:12,290 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 161 transitions. Word has length 156 [2018-12-03 16:59:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:12,290 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 161 transitions. [2018-12-03 16:59:12,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:59:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 161 transitions. [2018-12-03 16:59:12,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 16:59:12,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:12,291 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-12-03 16:59:12,291 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:12,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:12,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1389732672, now seen corresponding path program 77 times [2018-12-03 16:59:12,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:12,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:12,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:12,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:12,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:14,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 78 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:14,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:14,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:14,544 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:14,544 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:59:14,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:14,544 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 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 144 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:14,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:14,552 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:14,677 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 79 check-sat command(s) [2018-12-03 16:59:14,677 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:14,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 78 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:14,706 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 78 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:21,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:21,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 16:59:21,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:21,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:59:21,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:59:21,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:59:21,324 INFO L87 Difference]: Start difference. First operand 159 states and 161 transitions. Second operand 80 states. [2018-12-03 16:59:21,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:21,551 INFO L93 Difference]: Finished difference Result 163 states and 168 transitions. [2018-12-03 16:59:21,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:59:21,552 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-12-03 16:59:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:21,553 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:59:21,553 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 16:59:21,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:59:21,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 16:59:21,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 16:59:21,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 16:59:21,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 162 transitions. [2018-12-03 16:59:21,556 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 162 transitions. Word has length 158 [2018-12-03 16:59:21,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:21,557 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 162 transitions. [2018-12-03 16:59:21,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:59:21,557 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 162 transitions. [2018-12-03 16:59:21,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-03 16:59:21,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:21,557 INFO L402 BasicCegarLoop]: trace histogram [78, 78, 1, 1] [2018-12-03 16:59:21,557 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:21,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:21,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1389732734, now seen corresponding path program 67 times [2018-12-03 16:59:21,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:21,558 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:21,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:21,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:24,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:24,109 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:24,110 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:24,110 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:59:24,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:24,110 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 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 145 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:24,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:24,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:24,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:24,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:27,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:27,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:27,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 100 [2018-12-03 16:59:27,935 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:27,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:59:27,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:59:27,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:59:27,936 INFO L87 Difference]: Start difference. First operand 160 states and 162 transitions. Second operand 81 states. [2018-12-03 16:59:28,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:28,089 INFO L93 Difference]: Finished difference Result 164 states and 170 transitions. [2018-12-03 16:59:28,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:59:28,090 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 158 [2018-12-03 16:59:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:28,091 INFO L225 Difference]: With dead ends: 164 [2018-12-03 16:59:28,091 INFO L226 Difference]: Without dead ends: 161 [2018-12-03 16:59:28,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 235 SyntacticMatches, 58 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:59:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-03 16:59:28,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-12-03 16:59:28,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 16:59:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-12-03 16:59:28,095 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 158 [2018-12-03 16:59:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:28,095 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-12-03 16:59:28,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:59:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-12-03 16:59:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 16:59:28,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:28,096 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-12-03 16:59:28,096 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:28,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:28,096 INFO L82 PathProgramCache]: Analyzing trace with hash -201679942, now seen corresponding path program 78 times [2018-12-03 16:59:28,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:28,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:28,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:28,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:30,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 79 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:30,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:30,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:30,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:30,369 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:59:30,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:30,369 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 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 146 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:30,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:30,378 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:30,441 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:30,441 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:30,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:30,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 79 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:30,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:37,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 79 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:37,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:37,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 16:59:37,526 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:37,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 16:59:37,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 16:59:37,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:59:37,528 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 81 states. [2018-12-03 16:59:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:37,678 INFO L93 Difference]: Finished difference Result 165 states and 170 transitions. [2018-12-03 16:59:37,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:59:37,679 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-12-03 16:59:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:37,679 INFO L225 Difference]: With dead ends: 165 [2018-12-03 16:59:37,680 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 16:59:37,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 16:59:37,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 16:59:37,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-03 16:59:37,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 16:59:37,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 164 transitions. [2018-12-03 16:59:37,685 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 164 transitions. Word has length 160 [2018-12-03 16:59:37,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:37,685 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 164 transitions. [2018-12-03 16:59:37,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 16:59:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 164 transitions. [2018-12-03 16:59:37,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 16:59:37,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:37,685 INFO L402 BasicCegarLoop]: trace histogram [79, 79, 1, 1] [2018-12-03 16:59:37,686 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:37,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:37,686 INFO L82 PathProgramCache]: Analyzing trace with hash -201679880, now seen corresponding path program 68 times [2018-12-03 16:59:37,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:37,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:37,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:37,686 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:40,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:40,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:40,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:40,063 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:59:40,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:40,063 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 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 147 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:40,071 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:40,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:40,197 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 80 check-sat command(s) [2018-12-03 16:59:40,197 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:40,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:40,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:43,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:43,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:43,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 100 [2018-12-03 16:59:43,924 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:43,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:59:43,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:59:43,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:59:43,926 INFO L87 Difference]: Start difference. First operand 162 states and 164 transitions. Second operand 82 states. [2018-12-03 16:59:44,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:44,168 INFO L93 Difference]: Finished difference Result 166 states and 172 transitions. [2018-12-03 16:59:44,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:59:44,168 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 160 [2018-12-03 16:59:44,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:44,168 INFO L225 Difference]: With dead ends: 166 [2018-12-03 16:59:44,169 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 16:59:44,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 238 SyntacticMatches, 60 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:59:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 16:59:44,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 16:59:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 16:59:44,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2018-12-03 16:59:44,172 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 160 [2018-12-03 16:59:44,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:44,172 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2018-12-03 16:59:44,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:59:44,172 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2018-12-03 16:59:44,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 16:59:44,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:44,173 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-12-03 16:59:44,173 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:44,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:44,173 INFO L82 PathProgramCache]: Analyzing trace with hash -540844620, now seen corresponding path program 79 times [2018-12-03 16:59:44,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:44,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:44,174 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:44,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:44,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:44,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:46,483 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 80 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:46,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:46,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:46,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:46,483 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:59:46,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:46,484 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 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 148 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:46,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:46,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:46,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:46,581 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 80 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:46,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:53,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 80 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:53,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 16:59:53,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:53,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:59:53,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:59:53,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:59:53,875 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand 82 states. [2018-12-03 16:59:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:54,123 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2018-12-03 16:59:54,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:59:54,123 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-12-03 16:59:54,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:54,124 INFO L225 Difference]: With dead ends: 167 [2018-12-03 16:59:54,124 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 16:59:54,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 16:59:54,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 16:59:54,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 16:59:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 16:59:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-12-03 16:59:54,128 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 162 [2018-12-03 16:59:54,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:54,128 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-12-03 16:59:54,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:59:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-12-03 16:59:54,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 16:59:54,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:54,128 INFO L402 BasicCegarLoop]: trace histogram [80, 80, 1, 1] [2018-12-03 16:59:54,129 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:54,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:54,129 INFO L82 PathProgramCache]: Analyzing trace with hash -540844558, now seen corresponding path program 69 times [2018-12-03 16:59:54,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:54,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:54,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:54,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:54,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:56,466 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:59:56,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:56,466 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:56,466 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:56,467 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:59:56,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:56,467 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 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 149 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:56,474 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:56,475 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:56,538 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:56,538 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:56,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:56,569 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:59:56,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:00,288 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 17:00:00,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:00,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 100 [2018-12-03 17:00:00,307 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:00,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 17:00:00,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 17:00:00,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:00:00,308 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 83 states. [2018-12-03 17:00:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:00,493 INFO L93 Difference]: Finished difference Result 168 states and 174 transitions. [2018-12-03 17:00:00,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 17:00:00,494 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 162 [2018-12-03 17:00:00,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:00,494 INFO L225 Difference]: With dead ends: 168 [2018-12-03 17:00:00,494 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 17:00:00,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 241 SyntacticMatches, 62 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3069 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:00:00,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 17:00:00,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-03 17:00:00,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 17:00:00,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 167 transitions. [2018-12-03 17:00:00,497 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 167 transitions. Word has length 162 [2018-12-03 17:00:00,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:00,498 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 167 transitions. [2018-12-03 17:00:00,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 17:00:00,498 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 167 transitions. [2018-12-03 17:00:00,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 17:00:00,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:00,498 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-12-03 17:00:00,499 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:00,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:00,499 INFO L82 PathProgramCache]: Analyzing trace with hash -60585682, now seen corresponding path program 80 times [2018-12-03 17:00:00,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:00,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:00,499 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:00,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:00,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:03,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 81 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:03,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:03,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:03,227 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:03,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:03,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:03,228 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 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 150 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:03,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:03,238 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:03,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 82 check-sat command(s) [2018-12-03 17:00:03,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:03,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:08,358 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:14,396 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:14,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:14,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2018-12-03 17:00:14,415 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:14,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-12-03 17:00:14,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-12-03 17:00:14,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8553, Invalid=24753, Unknown=0, NotChecked=0, Total=33306 [2018-12-03 17:00:14,417 INFO L87 Difference]: Start difference. First operand 165 states and 167 transitions. Second operand 165 states. [2018-12-03 17:00:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:26,630 INFO L93 Difference]: Finished difference Result 170 states and 177 transitions. [2018-12-03 17:00:26,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-12-03 17:00:26,630 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 164 [2018-12-03 17:00:26,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:26,631 INFO L225 Difference]: With dead ends: 170 [2018-12-03 17:00:26,631 INFO L226 Difference]: Without dead ends: 167 [2018-12-03 17:00:26,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 163 SyntacticMatches, 64 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29329 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=38199, Invalid=80481, Unknown=0, NotChecked=0, Total=118680 [2018-12-03 17:00:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-03 17:00:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-03 17:00:26,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-03 17:00:26,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 169 transitions. [2018-12-03 17:00:26,638 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 169 transitions. Word has length 164 [2018-12-03 17:00:26,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:26,638 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 169 transitions. [2018-12-03 17:00:26,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-12-03 17:00:26,639 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 169 transitions. [2018-12-03 17:00:26,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 17:00:26,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:26,639 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-12-03 17:00:26,639 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:26,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:26,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1906753064, now seen corresponding path program 81 times [2018-12-03 17:00:26,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:26,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:26,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:26,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:26,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 82 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:29,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:29,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:29,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:29,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:29,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:29,295 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 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 151 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:29,304 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:29,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:29,369 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:29,370 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:29,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:29,401 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 82 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:29,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:36,849 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 82 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:36,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:36,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 17:00:36,869 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:36,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 17:00:36,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 17:00:36,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:00:36,871 INFO L87 Difference]: Start difference. First operand 167 states and 169 transitions. Second operand 84 states. [2018-12-03 17:00:37,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:37,025 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2018-12-03 17:00:37,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 17:00:37,026 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-12-03 17:00:37,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:37,027 INFO L225 Difference]: With dead ends: 171 [2018-12-03 17:00:37,027 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 17:00:37,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:00:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 17:00:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-03 17:00:37,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 17:00:37,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-12-03 17:00:37,032 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 166 [2018-12-03 17:00:37,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:37,032 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-12-03 17:00:37,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 17:00:37,032 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-12-03 17:00:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-12-03 17:00:37,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:37,033 INFO L402 BasicCegarLoop]: trace histogram [82, 82, 1, 1] [2018-12-03 17:00:37,033 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:37,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1906753126, now seen corresponding path program 70 times [2018-12-03 17:00:37,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:37,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:37,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:37,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:37,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:39,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:39,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:39,856 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:39,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:39,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:39,856 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 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 152 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:39,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:39,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:39,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:39,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:39,960 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:39,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:43,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:43,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 100 [2018-12-03 17:00:43,377 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:43,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:00:43,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:00:43,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:00:43,378 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 85 states. [2018-12-03 17:00:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:43,548 INFO L93 Difference]: Finished difference Result 172 states and 178 transitions. [2018-12-03 17:00:43,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:00:43,549 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 166 [2018-12-03 17:00:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:43,549 INFO L225 Difference]: With dead ends: 172 [2018-12-03 17:00:43,549 INFO L226 Difference]: Without dead ends: 169 [2018-12-03 17:00:43,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 247 SyntacticMatches, 66 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3267 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:00:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-12-03 17:00:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-12-03 17:00:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 17:00:43,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2018-12-03 17:00:43,553 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 166 [2018-12-03 17:00:43,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:43,553 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2018-12-03 17:00:43,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:00:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2018-12-03 17:00:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 17:00:43,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:43,554 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-12-03 17:00:43,554 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:43,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:43,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1561289566, now seen corresponding path program 82 times [2018-12-03 17:00:43,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:43,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:43,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:43,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:43,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:43,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:46,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 83 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:46,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:46,167 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:46,167 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:46,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:46,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:46,167 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 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 153 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:46,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:46,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:46,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:46,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:46,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 83 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:46,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:53,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 83 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:53,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:53,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 17:00:53,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:53,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:00:53,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:00:53,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:00:53,617 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand 85 states. [2018-12-03 17:00:53,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:53,915 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2018-12-03 17:00:53,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:00:53,916 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-12-03 17:00:53,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:53,917 INFO L225 Difference]: With dead ends: 173 [2018-12-03 17:00:53,917 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 17:00:53,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:00:53,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 17:00:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-12-03 17:00:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 17:00:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2018-12-03 17:00:53,922 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 168 [2018-12-03 17:00:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:53,922 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2018-12-03 17:00:53,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:00:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2018-12-03 17:00:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 17:00:53,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:53,923 INFO L402 BasicCegarLoop]: trace histogram [83, 83, 1, 1] [2018-12-03 17:00:53,923 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:53,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:53,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1561289504, now seen corresponding path program 71 times [2018-12-03 17:00:53,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:53,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:53,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:53,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:56,495 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 17:00:56,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:56,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:56,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:56,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:56,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:56,496 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 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 154 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:56,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:56,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:56,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-03 17:00:56,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:56,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:56,802 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 17:00:56,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:00,457 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 17:01:00,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:00,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 100 [2018-12-03 17:01:00,476 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:00,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 17:01:00,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 17:01:00,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:01:00,477 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 86 states. [2018-12-03 17:01:00,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:00,742 INFO L93 Difference]: Finished difference Result 174 states and 180 transitions. [2018-12-03 17:01:00,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:01:00,743 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 168 [2018-12-03 17:01:00,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:00,744 INFO L225 Difference]: With dead ends: 174 [2018-12-03 17:01:00,744 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 17:01:00,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 250 SyntacticMatches, 68 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3366 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:01:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 17:01:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-03 17:01:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 17:01:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2018-12-03 17:01:00,747 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 168 [2018-12-03 17:01:00,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:00,747 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2018-12-03 17:01:00,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 17:01:00,747 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2018-12-03 17:01:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 17:01:00,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:00,748 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-12-03 17:01:00,748 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:00,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1455635300, now seen corresponding path program 83 times [2018-12-03 17:01:00,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:00,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:00,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:00,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:00,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:03,250 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 84 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:03,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:03,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:03,251 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:03,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:03,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:03,251 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 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 155 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:03,259 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:03,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:03,399 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 85 check-sat command(s) [2018-12-03 17:01:03,400 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:03,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 84 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:03,432 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 84 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:11,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:11,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 17:01:11,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:11,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 17:01:11,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 17:01:11,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:01:11,185 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 86 states. [2018-12-03 17:01:11,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:11,396 INFO L93 Difference]: Finished difference Result 175 states and 180 transitions. [2018-12-03 17:01:11,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:01:11,396 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-12-03 17:01:11,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:11,397 INFO L225 Difference]: With dead ends: 175 [2018-12-03 17:01:11,397 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 17:01:11,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:01:11,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 17:01:11,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 17:01:11,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 17:01:11,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 174 transitions. [2018-12-03 17:01:11,401 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 174 transitions. Word has length 170 [2018-12-03 17:01:11,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:11,401 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 174 transitions. [2018-12-03 17:01:11,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 17:01:11,401 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 174 transitions. [2018-12-03 17:01:11,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 17:01:11,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:11,402 INFO L402 BasicCegarLoop]: trace histogram [84, 84, 1, 1] [2018-12-03 17:01:11,402 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:11,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:11,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1455635238, now seen corresponding path program 72 times [2018-12-03 17:01:11,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:11,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:11,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:11,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:11,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:11,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:14,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:14,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:14,003 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:14,004 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:14,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:14,004 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 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 156 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:14,011 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:14,012 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:14,074 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:14,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:14,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:14,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:17,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:17,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 100 [2018-12-03 17:01:17,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:17,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 17:01:17,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 17:01:17,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:01:17,840 INFO L87 Difference]: Start difference. First operand 172 states and 174 transitions. Second operand 87 states. [2018-12-03 17:01:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:18,120 INFO L93 Difference]: Finished difference Result 176 states and 182 transitions. [2018-12-03 17:01:18,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:01:18,120 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 170 [2018-12-03 17:01:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:18,121 INFO L225 Difference]: With dead ends: 176 [2018-12-03 17:01:18,121 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 17:01:18,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 253 SyntacticMatches, 70 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3465 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:01:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 17:01:18,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-03 17:01:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 17:01:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 175 transitions. [2018-12-03 17:01:18,124 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 175 transitions. Word has length 170 [2018-12-03 17:01:18,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:18,124 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 175 transitions. [2018-12-03 17:01:18,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 17:01:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 175 transitions. [2018-12-03 17:01:18,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 17:01:18,125 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:18,125 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-12-03 17:01:18,125 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:18,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:18,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1293866518, now seen corresponding path program 84 times [2018-12-03 17:01:18,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:18,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:18,126 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:18,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:18,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:18,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 85 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:21,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:21,044 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:21,044 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:21,045 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:21,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:21,045 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 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 157 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:21,054 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:21,054 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:21,117 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:21,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:21,121 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:21,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 85 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:21,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:28,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 85 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:28,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:28,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 17:01:28,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:28,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 17:01:28,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 17:01:28,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:01:28,836 INFO L87 Difference]: Start difference. First operand 173 states and 175 transitions. Second operand 87 states. [2018-12-03 17:01:29,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:29,096 INFO L93 Difference]: Finished difference Result 177 states and 182 transitions. [2018-12-03 17:01:29,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:01:29,097 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-12-03 17:01:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:29,097 INFO L225 Difference]: With dead ends: 177 [2018-12-03 17:01:29,097 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 17:01:29,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:01:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 17:01:29,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-12-03 17:01:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 17:01:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2018-12-03 17:01:29,103 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 172 [2018-12-03 17:01:29,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:29,103 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 176 transitions. [2018-12-03 17:01:29,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 17:01:29,104 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2018-12-03 17:01:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 17:01:29,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:29,104 INFO L402 BasicCegarLoop]: trace histogram [85, 85, 1, 1] [2018-12-03 17:01:29,104 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:29,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:29,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1293866580, now seen corresponding path program 73 times [2018-12-03 17:01:29,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:29,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:29,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:29,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:29,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:32,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:32,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:32,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:32,111 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:32,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:32,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:32,111 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 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 158 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:32,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:32,119 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:32,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:32,217 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:35,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:35,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 100 [2018-12-03 17:01:35,867 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:35,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 17:01:35,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 17:01:35,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:01:35,868 INFO L87 Difference]: Start difference. First operand 174 states and 176 transitions. Second operand 88 states. [2018-12-03 17:01:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:36,070 INFO L93 Difference]: Finished difference Result 178 states and 184 transitions. [2018-12-03 17:01:36,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:01:36,071 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 172 [2018-12-03 17:01:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:36,071 INFO L225 Difference]: With dead ends: 178 [2018-12-03 17:01:36,072 INFO L226 Difference]: Without dead ends: 175 [2018-12-03 17:01:36,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 256 SyntacticMatches, 72 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3564 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:01:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-12-03 17:01:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-12-03 17:01:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 17:01:36,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2018-12-03 17:01:36,078 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 172 [2018-12-03 17:01:36,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:36,078 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2018-12-03 17:01:36,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 17:01:36,079 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2018-12-03 17:01:36,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 17:01:36,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:36,079 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-12-03 17:01:36,080 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:36,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:36,080 INFO L82 PathProgramCache]: Analyzing trace with hash -2134740720, now seen corresponding path program 85 times [2018-12-03 17:01:36,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:36,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:36,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:36,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:36,081 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:38,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 86 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:38,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:38,811 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:38,811 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:38,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:38,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:38,812 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 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 159 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:38,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:38,820 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:38,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:38,914 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 86 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:38,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 86 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:46,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:46,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 17:01:46,989 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:46,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 17:01:46,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 17:01:46,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:01:46,991 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 88 states. [2018-12-03 17:01:47,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:47,277 INFO L93 Difference]: Finished difference Result 179 states and 184 transitions. [2018-12-03 17:01:47,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:01:47,277 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-12-03 17:01:47,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:47,278 INFO L225 Difference]: With dead ends: 179 [2018-12-03 17:01:47,278 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 17:01:47,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:01:47,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 17:01:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-12-03 17:01:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 17:01:47,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 178 transitions. [2018-12-03 17:01:47,282 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 178 transitions. Word has length 174 [2018-12-03 17:01:47,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:47,282 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 178 transitions. [2018-12-03 17:01:47,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 17:01:47,282 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 178 transitions. [2018-12-03 17:01:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 17:01:47,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:47,282 INFO L402 BasicCegarLoop]: trace histogram [86, 86, 1, 1] [2018-12-03 17:01:47,283 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:47,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:47,283 INFO L82 PathProgramCache]: Analyzing trace with hash -2134740658, now seen corresponding path program 74 times [2018-12-03 17:01:47,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:47,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:47,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:47,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:47,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:50,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:50,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:50,027 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:50,027 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:50,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:50,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:50,027 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 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 160 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:50,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:50,037 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:50,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-03 17:01:50,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:50,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:50,228 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:50,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:53,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:53,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 100 [2018-12-03 17:01:53,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:53,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 17:01:53,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 17:01:53,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:01:53,788 INFO L87 Difference]: Start difference. First operand 176 states and 178 transitions. Second operand 89 states. [2018-12-03 17:01:54,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:54,051 INFO L93 Difference]: Finished difference Result 180 states and 186 transitions. [2018-12-03 17:01:54,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:01:54,051 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 174 [2018-12-03 17:01:54,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:54,051 INFO L225 Difference]: With dead ends: 180 [2018-12-03 17:01:54,051 INFO L226 Difference]: Without dead ends: 177 [2018-12-03 17:01:54,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 259 SyntacticMatches, 74 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3663 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:01:54,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-12-03 17:01:54,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-12-03 17:01:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 17:01:54,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 179 transitions. [2018-12-03 17:01:54,055 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 179 transitions. Word has length 174 [2018-12-03 17:01:54,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:54,055 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 179 transitions. [2018-12-03 17:01:54,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 17:01:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 179 transitions. [2018-12-03 17:01:54,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 17:01:54,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:54,056 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-12-03 17:01:54,056 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:54,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:54,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1508586890, now seen corresponding path program 86 times [2018-12-03 17:01:54,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:54,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:54,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:54,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:54,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 87 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:57,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:57,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:57,011 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:57,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:57,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:57,012 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 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 161 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:57,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:57,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:57,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 88 check-sat command(s) [2018-12-03 17:01:57,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:57,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:02,880 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:02,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:09,392 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:09,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:09,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2018-12-03 17:02:09,412 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:09,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-12-03 17:02:09,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-12-03 17:02:09,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9066, Invalid=26466, Unknown=0, NotChecked=0, Total=35532 [2018-12-03 17:02:09,413 INFO L87 Difference]: Start difference. First operand 177 states and 179 transitions. Second operand 177 states. [2018-12-03 17:02:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:23,630 INFO L93 Difference]: Finished difference Result 182 states and 189 transitions. [2018-12-03 17:02:23,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-12-03 17:02:23,630 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 176 [2018-12-03 17:02:23,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:23,631 INFO L225 Difference]: With dead ends: 182 [2018-12-03 17:02:23,631 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 17:02:23,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 612 GetRequests, 175 SyntacticMatches, 76 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33949 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=41952, Invalid=89454, Unknown=0, NotChecked=0, Total=131406 [2018-12-03 17:02:23,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 17:02:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-03 17:02:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-03 17:02:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 181 transitions. [2018-12-03 17:02:23,638 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 181 transitions. Word has length 176 [2018-12-03 17:02:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:23,638 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 181 transitions. [2018-12-03 17:02:23,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-12-03 17:02:23,638 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 181 transitions. [2018-12-03 17:02:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 17:02:23,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:23,639 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-12-03 17:02:23,639 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:23,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:23,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1946893436, now seen corresponding path program 87 times [2018-12-03 17:02:23,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:23,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:23,640 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:23,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:23,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:23,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:26,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 88 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:26,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:26,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:26,737 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:26,737 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:26,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:26,737 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 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 162 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:26,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:26,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:26,812 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:26,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:26,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 88 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:26,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:35,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 88 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:35,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:35,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 17:02:35,158 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:35,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 17:02:35,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 17:02:35,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:02:35,160 INFO L87 Difference]: Start difference. First operand 179 states and 181 transitions. Second operand 90 states. [2018-12-03 17:02:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:35,322 INFO L93 Difference]: Finished difference Result 183 states and 188 transitions. [2018-12-03 17:02:35,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:02:35,322 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-12-03 17:02:35,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:35,323 INFO L225 Difference]: With dead ends: 183 [2018-12-03 17:02:35,323 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 17:02:35,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:02:35,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 17:02:35,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-12-03 17:02:35,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 17:02:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 182 transitions. [2018-12-03 17:02:35,327 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 182 transitions. Word has length 178 [2018-12-03 17:02:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:35,327 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 182 transitions. [2018-12-03 17:02:35,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 17:02:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 182 transitions. [2018-12-03 17:02:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 17:02:35,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:35,328 INFO L402 BasicCegarLoop]: trace histogram [88, 88, 1, 1] [2018-12-03 17:02:35,328 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:35,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1946893374, now seen corresponding path program 75 times [2018-12-03 17:02:35,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:35,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:35,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:35,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:35,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:38,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:38,543 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:38,543 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:38,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:38,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:38,543 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 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 163 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:38,551 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:38,551 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:38,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:38,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:38,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:38,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:42,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:42,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 100 [2018-12-03 17:02:42,428 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:42,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 17:02:42,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 17:02:42,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:02:42,429 INFO L87 Difference]: Start difference. First operand 180 states and 182 transitions. Second operand 91 states. [2018-12-03 17:02:42,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:42,585 INFO L93 Difference]: Finished difference Result 184 states and 190 transitions. [2018-12-03 17:02:42,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:02:42,585 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 178 [2018-12-03 17:02:42,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:42,586 INFO L225 Difference]: With dead ends: 184 [2018-12-03 17:02:42,586 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 17:02:42,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 265 SyntacticMatches, 78 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3861 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:02:42,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 17:02:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 17:02:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 17:02:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 183 transitions. [2018-12-03 17:02:42,590 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 183 transitions. Word has length 178 [2018-12-03 17:02:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:42,590 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 183 transitions. [2018-12-03 17:02:42,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 17:02:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 183 transitions. [2018-12-03 17:02:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 17:02:42,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:42,591 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-12-03 17:02:42,591 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:42,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:42,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1641200382, now seen corresponding path program 88 times [2018-12-03 17:02:42,591 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:42,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:42,592 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:42,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:42,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:45,440 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 89 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:45,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:45,440 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:45,441 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:45,441 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:45,441 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:45,441 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 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 164 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:45,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:45,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:45,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 89 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:45,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:54,206 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 89 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:54,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:54,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 17:02:54,224 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:54,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 17:02:54,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 17:02:54,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:02:54,226 INFO L87 Difference]: Start difference. First operand 181 states and 183 transitions. Second operand 91 states. [2018-12-03 17:02:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:54,499 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-12-03 17:02:54,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:02:54,499 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-12-03 17:02:54,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:54,500 INFO L225 Difference]: With dead ends: 185 [2018-12-03 17:02:54,500 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 17:02:54,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:02:54,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 17:02:54,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 17:02:54,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 17:02:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2018-12-03 17:02:54,504 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 180 [2018-12-03 17:02:54,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:54,504 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2018-12-03 17:02:54,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 17:02:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2018-12-03 17:02:54,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 17:02:54,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:54,505 INFO L402 BasicCegarLoop]: trace histogram [89, 89, 1, 1] [2018-12-03 17:02:54,505 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:54,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:54,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1641200444, now seen corresponding path program 76 times [2018-12-03 17:02:54,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:54,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:54,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:54,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:54,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:54,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:57,695 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 17:02:57,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:57,695 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:57,696 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:57,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:57,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:57,696 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 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 165 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:57,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:57,704 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:57,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:57,803 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 17:02:57,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:01,223 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 17:03:01,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:01,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 100 [2018-12-03 17:03:01,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:01,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 17:03:01,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 17:03:01,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:03:01,243 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 92 states. [2018-12-03 17:03:01,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:01,558 INFO L93 Difference]: Finished difference Result 186 states and 192 transitions. [2018-12-03 17:03:01,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 17:03:01,559 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 180 [2018-12-03 17:03:01,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:01,559 INFO L225 Difference]: With dead ends: 186 [2018-12-03 17:03:01,559 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 17:03:01,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 268 SyntacticMatches, 80 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3960 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:03:01,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 17:03:01,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-12-03 17:03:01,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-12-03 17:03:01,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 185 transitions. [2018-12-03 17:03:01,563 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 185 transitions. Word has length 180 [2018-12-03 17:03:01,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:01,563 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 185 transitions. [2018-12-03 17:03:01,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 17:03:01,563 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 185 transitions. [2018-12-03 17:03:01,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-12-03 17:03:01,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:01,564 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-12-03 17:03:01,564 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:01,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:01,565 INFO L82 PathProgramCache]: Analyzing trace with hash 940620792, now seen corresponding path program 89 times [2018-12-03 17:03:01,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:01,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:01,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:01,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:01,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat