java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:46:45,740 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:46:45,742 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:46:45,754 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:46:45,754 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:46:45,755 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:46:45,756 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:46:45,758 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:46:45,760 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:46:45,760 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:46:45,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:46:45,762 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:46:45,762 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:46:45,763 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:46:45,764 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:46:45,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:46:45,766 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:46:45,768 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:46:45,770 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:46:45,771 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:46:45,772 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:46:45,773 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:46:45,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:46:45,776 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:46:45,776 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:46:45,777 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:46:45,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:46:45,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:46:45,780 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:46:45,781 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:46:45,781 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:46:45,782 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:46:45,782 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:46:45,782 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:46:45,783 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:46:45,784 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:46:45,784 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 15:46:45,796 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:46:45,797 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:46:45,797 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:46:45,797 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:46:45,798 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:46:45,798 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:46:45,798 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:46:45,798 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:46:45,798 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:46:45,799 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:46:45,799 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:46:45,799 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:46:45,799 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:46:45,799 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:46:45,800 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:46:45,800 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:46:45,800 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:46:45,801 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:46:45,801 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:46:45,801 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:46:45,801 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:46:45,802 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:46:45,802 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:46:45,802 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:46:45,802 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:46:45,803 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:46:45,803 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:46:45,803 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:46:45,803 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:46:45,803 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:46:45,804 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:46:45,804 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:46:45,804 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:46:45,804 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:46:45,805 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:46:45,805 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:46:45,805 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:46:45,805 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:46:45,805 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:46:45,806 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:46:45,806 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:46:45,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:46:45,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:46:45,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:46:45,852 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:46:45,853 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:46:45,854 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl [2018-12-03 15:46:45,854 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/ArrayInit02.bpl' [2018-12-03 15:46:45,888 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:46:45,890 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:46:45,891 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:46:45,891 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:46:45,891 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:46:45,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:45" (1/1) ... [2018-12-03 15:46:45,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:45" (1/1) ... [2018-12-03 15:46:45,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:46:45,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:46:45,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:46:45,926 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:46:45,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:45" (1/1) ... [2018-12-03 15:46:45,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:45" (1/1) ... [2018-12-03 15:46:45,939 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:45" (1/1) ... [2018-12-03 15:46:45,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:45" (1/1) ... [2018-12-03 15:46:45,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:45" (1/1) ... [2018-12-03 15:46:45,947 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:45" (1/1) ... [2018-12-03 15:46:45,948 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:45" (1/1) ... [2018-12-03 15:46:45,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:46:45,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:46:45,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:46:45,950 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:46:45,951 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:45" (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 15:46:46,021 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:46:46,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:46:46,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:46:46,386 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:46:46,387 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:46:46,387 INFO L202 PluginConnector]: Adding new model ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:46:46 BoogieIcfgContainer [2018-12-03 15:46:46,387 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:46:46,388 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:46:46,388 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:46:46,391 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:46:46,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:46:45" (1/2) ... [2018-12-03 15:46:46,393 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73509a27 and model type ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:46:46, skipping insertion in model container [2018-12-03 15:46:46,393 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArrayInit02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:46:46" (2/2) ... [2018-12-03 15:46:46,394 INFO L112 eAbstractionObserver]: Analyzing ICFG ArrayInit02.bpl [2018-12-03 15:46:46,402 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:46:46,408 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:46:46,424 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:46:46,452 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:46:46,452 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:46:46,452 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:46:46,453 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:46:46,453 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:46:46,453 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:46:46,453 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:46:46,453 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:46:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2018-12-03 15:46:46,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:46:46,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:46,473 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 15:46:46,476 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:46,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:46,482 INFO L82 PathProgramCache]: Analyzing trace with hash 900035954, now seen corresponding path program 1 times [2018-12-03 15:46:46,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:46,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:46,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:46,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:46,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:46,725 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 15:46:46,727 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:46:46,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:46:46,728 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:46:46,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:46:46,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:46:46,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:46:46,753 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 4 states. [2018-12-03 15:46:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:46,968 INFO L93 Difference]: Finished difference Result 26 states and 34 transitions. [2018-12-03 15:46:46,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:46:46,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 15:46:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:46,982 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:46:46,982 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:46:46,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:46:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:46:47,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2018-12-03 15:46:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:46:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 14 transitions. [2018-12-03 15:46:47,026 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 14 transitions. Word has length 6 [2018-12-03 15:46:47,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:47,026 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 14 transitions. [2018-12-03 15:46:47,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:46:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 14 transitions. [2018-12-03 15:46:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:46:47,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:47,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:46:47,028 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:47,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:47,029 INFO L82 PathProgramCache]: Analyzing trace with hash 429804648, now seen corresponding path program 1 times [2018-12-03 15:46:47,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:47,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:47,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:47,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:47,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:47,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:47,371 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 5 [2018-12-03 15:46:47,373 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 15:46:47,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:46:47,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 15:46:47,374 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:46:47,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:46:47,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:46:47,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 15:46:47,377 INFO L87 Difference]: Start difference. First operand 11 states and 14 transitions. Second operand 4 states. [2018-12-03 15:46:47,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:47,468 INFO L93 Difference]: Finished difference Result 25 states and 31 transitions. [2018-12-03 15:46:47,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:46:47,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2018-12-03 15:46:47,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:47,471 INFO L225 Difference]: With dead ends: 25 [2018-12-03 15:46:47,471 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 15:46:47,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 15:46:47,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 15:46:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2018-12-03 15:46:47,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 15:46:47,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2018-12-03 15:46:47,479 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 26 transitions. Word has length 9 [2018-12-03 15:46:47,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:47,479 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 26 transitions. [2018-12-03 15:46:47,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:46:47,480 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 26 transitions. [2018-12-03 15:46:47,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:46:47,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:47,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:46:47,482 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:47,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:47,482 INFO L82 PathProgramCache]: Analyzing trace with hash 429806570, now seen corresponding path program 1 times [2018-12-03 15:46:47,482 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:47,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:47,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:47,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:47,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:47,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 15:46:47,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:46:47,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 15:46:47,529 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:46:47,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:46:47,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:46:47,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:46:47,530 INFO L87 Difference]: Start difference. First operand 19 states and 26 transitions. Second operand 3 states. [2018-12-03 15:46:47,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:47,582 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-12-03 15:46:47,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:46:47,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 15:46:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:47,583 INFO L225 Difference]: With dead ends: 24 [2018-12-03 15:46:47,584 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 15:46:47,584 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:46:47,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 15:46:47,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2018-12-03 15:46:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:46:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-12-03 15:46:47,588 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 14 transitions. Word has length 9 [2018-12-03 15:46:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:47,588 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-12-03 15:46:47,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:46:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 14 transitions. [2018-12-03 15:46:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:46:47,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:47,589 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:46:47,590 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:47,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:47,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2090155286, now seen corresponding path program 1 times [2018-12-03 15:46:47,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:47,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:47,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:47,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:47,592 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:47,975 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2018-12-03 15:46:48,041 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 15:46:48,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:48,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:48,043 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 10 with the following transitions: [2018-12-03 15:46:48,045 INFO L205 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [26], [27] [2018-12-03 15:46:48,091 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:46:48,092 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:46:48,261 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:46:48,262 INFO L272 AbstractInterpreter]: Visited 9 different actions 23 times. Merged at 8 different actions 13 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 15:46:48,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:48,274 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:46:48,274 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:48,274 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 15:46:48,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:48,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:48,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:48,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:48,425 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 15:46:48,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:48,507 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 15:46:48,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:48,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2018-12-03 15:46:48,528 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:48,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:46:48,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:46:48,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 15:46:48,529 INFO L87 Difference]: Start difference. First operand 12 states and 14 transitions. Second operand 7 states. [2018-12-03 15:46:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:48,769 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-12-03 15:46:48,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:46:48,772 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2018-12-03 15:46:48,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:48,773 INFO L225 Difference]: With dead ends: 26 [2018-12-03 15:46:48,773 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:46:48,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-03 15:46:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:46:48,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2018-12-03 15:46:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 15:46:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2018-12-03 15:46:48,781 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 9 [2018-12-03 15:46:48,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:48,781 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-12-03 15:46:48,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:46:48,781 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2018-12-03 15:46:48,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 15:46:48,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:48,782 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:46:48,782 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:48,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:48,782 INFO L82 PathProgramCache]: Analyzing trace with hash -368470767, now seen corresponding path program 1 times [2018-12-03 15:46:48,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:48,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:48,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:48,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:48,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:48,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:48,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:48,878 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 15:46:48,879 INFO L205 CegarAbsIntRunner]: [0], [4], [9], [11], [13], [17], [20], [22], [26], [27], [30], [32] [2018-12-03 15:46:48,880 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:46:48,880 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:46:49,026 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:46:49,026 INFO L272 AbstractInterpreter]: Visited 12 different actions 50 times. Merged at 11 different actions 29 times. Widened at 1 different actions 1 times. Found 12 fixpoints after 6 different actions. Largest state had 0 variables. [2018-12-03 15:46:49,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:49,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:46:49,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:49,040 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 15:46:49,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:49,049 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:49,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:49,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:49,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:49,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:49,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2018-12-03 15:46:49,223 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:49,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:46:49,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:46:49,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:46:49,224 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 8 states. [2018-12-03 15:46:49,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:49,626 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-12-03 15:46:49,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:46:49,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-12-03 15:46:49,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:49,627 INFO L225 Difference]: With dead ends: 31 [2018-12-03 15:46:49,627 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 15:46:49,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:46:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 15:46:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2018-12-03 15:46:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 15:46:49,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2018-12-03 15:46:49,632 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2018-12-03 15:46:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:49,633 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2018-12-03 15:46:49,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:46:49,633 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2018-12-03 15:46:49,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 15:46:49,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:49,634 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:46:49,634 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:49,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:49,635 INFO L82 PathProgramCache]: Analyzing trace with hash -256855911, now seen corresponding path program 2 times [2018-12-03 15:46:49,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:49,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:49,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:49,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:49,636 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:49,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:49,921 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:49,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:49,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:49,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:49,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:49,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:49,922 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 15:46:49,932 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:49,933 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:49,946 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 15:46:49,946 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:49,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:50,060 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:50,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:50,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2018-12-03 15:46:50,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:50,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:46:50,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:46:50,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:46:50,142 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 11 states. [2018-12-03 15:46:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:50,443 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-12-03 15:46:50,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 15:46:50,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2018-12-03 15:46:50,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:50,445 INFO L225 Difference]: With dead ends: 35 [2018-12-03 15:46:50,446 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 15:46:50,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-12-03 15:46:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 15:46:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2018-12-03 15:46:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 15:46:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-03 15:46:50,453 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2018-12-03 15:46:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:50,454 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-03 15:46:50,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:46:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-03 15:46:50,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 15:46:50,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:50,455 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:46:50,455 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:50,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:50,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1110643520, now seen corresponding path program 3 times [2018-12-03 15:46:50,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:50,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:50,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:50,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:50,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:50,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:50,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:50,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:50,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:50,573 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:50,573 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:50,573 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:50,573 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:46:50,581 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:50,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:50,591 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:50,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:50,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:50,641 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:50,689 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:50,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:50,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2018-12-03 15:46:50,708 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:50,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 15:46:50,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 15:46:50,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-12-03 15:46:50,709 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 11 states. [2018-12-03 15:46:50,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:50,910 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2018-12-03 15:46:50,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:46:50,911 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-12-03 15:46:50,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:50,912 INFO L225 Difference]: With dead ends: 45 [2018-12-03 15:46:50,912 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 15:46:50,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:46:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 15:46:50,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-12-03 15:46:50,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 15:46:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-12-03 15:46:50,918 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 20 [2018-12-03 15:46:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:50,918 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-12-03 15:46:50,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 15:46:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-12-03 15:46:50,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:46:50,919 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:50,919 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-03 15:46:50,919 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:50,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:50,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1324912968, now seen corresponding path program 4 times [2018-12-03 15:46:50,920 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:50,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:50,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:50,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:50,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:51,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:51,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:51,259 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:51,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:51,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:51,259 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 15:46:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:51,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:51,280 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:51,369 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:51,369 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:51,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:51,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 13 [2018-12-03 15:46:51,431 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:51,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:46:51,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:46:51,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:46:51,433 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 14 states. [2018-12-03 15:46:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:51,799 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-12-03 15:46:51,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 15:46:51,800 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 23 [2018-12-03 15:46:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:51,800 INFO L225 Difference]: With dead ends: 49 [2018-12-03 15:46:51,800 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 15:46:51,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-12-03 15:46:51,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 15:46:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2018-12-03 15:46:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 15:46:51,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-12-03 15:46:51,808 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 23 [2018-12-03 15:46:51,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:51,808 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-12-03 15:46:51,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:46:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-12-03 15:46:51,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 15:46:51,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:51,810 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:46:51,810 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:51,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:51,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1588570591, now seen corresponding path program 5 times [2018-12-03 15:46:51,811 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:51,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:51,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:51,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:51,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:51,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:51,907 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:51,907 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:51,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:51,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:51,908 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 15:46:51,919 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:51,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:51,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:46:51,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:51,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:52,007 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:52,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:52,054 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:52,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:52,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2018-12-03 15:46:52,081 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:52,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 15:46:52,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 15:46:52,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2018-12-03 15:46:52,083 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 14 states. [2018-12-03 15:46:52,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:52,352 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2018-12-03 15:46:52,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:46:52,353 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2018-12-03 15:46:52,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:52,354 INFO L225 Difference]: With dead ends: 60 [2018-12-03 15:46:52,354 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 15:46:52,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 42 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2018-12-03 15:46:52,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 15:46:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-12-03 15:46:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 15:46:52,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2018-12-03 15:46:52,361 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 27 [2018-12-03 15:46:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:52,361 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2018-12-03 15:46:52,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 15:46:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-12-03 15:46:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:46:52,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:52,362 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1] [2018-12-03 15:46:52,362 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:52,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:52,362 INFO L82 PathProgramCache]: Analyzing trace with hash 366737255, now seen corresponding path program 6 times [2018-12-03 15:46:52,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:52,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:52,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:52,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:52,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:52,571 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:52,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:52,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:52,572 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:52,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:52,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:52,572 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 15:46:52,580 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:52,581 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:52,587 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:52,587 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:52,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:52,717 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:52,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:52,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 16 [2018-12-03 15:46:52,786 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:52,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:46:52,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:46:52,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:46:52,788 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 17 states. [2018-12-03 15:46:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:53,979 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-12-03 15:46:53,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 15:46:53,979 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 30 [2018-12-03 15:46:53,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:53,980 INFO L225 Difference]: With dead ends: 64 [2018-12-03 15:46:53,980 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:46:53,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=505, Unknown=0, NotChecked=0, Total=600 [2018-12-03 15:46:53,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:46:53,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-12-03 15:46:53,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 15:46:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-12-03 15:46:53,988 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 30 [2018-12-03 15:46:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:53,988 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-12-03 15:46:53,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:46:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-12-03 15:46:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 15:46:53,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:53,989 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2018-12-03 15:46:53,989 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:53,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:53,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1079885042, now seen corresponding path program 7 times [2018-12-03 15:46:53,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:53,991 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:53,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:53,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:54,129 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:54,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:54,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:54,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:54,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:54,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:54,130 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 15:46:54,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:54,142 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:46:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:54,152 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:54,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 36 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:54,403 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:54,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 16 [2018-12-03 15:46:54,405 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:54,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 15:46:54,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 15:46:54,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-12-03 15:46:54,407 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 17 states. [2018-12-03 15:46:54,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:54,772 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-12-03 15:46:54,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 15:46:54,772 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-12-03 15:46:54,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:54,773 INFO L225 Difference]: With dead ends: 75 [2018-12-03 15:46:54,773 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 15:46:54,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2018-12-03 15:46:54,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 15:46:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2018-12-03 15:46:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 15:46:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-12-03 15:46:54,780 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 34 [2018-12-03 15:46:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:54,780 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-12-03 15:46:54,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 15:46:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-12-03 15:46:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 15:46:54,782 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:54,782 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2018-12-03 15:46:54,782 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:54,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:54,782 INFO L82 PathProgramCache]: Analyzing trace with hash -921359226, now seen corresponding path program 8 times [2018-12-03 15:46:54,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:54,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:54,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:46:54,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:54,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:54,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 4 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:55,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:55,130 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:55,130 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:55,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:55,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:55,131 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 15:46:55,140 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:46:55,140 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:46:55,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 15:46:55,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:55,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 32 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:55,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:56,408 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 28 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:56,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:56,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 33 [2018-12-03 15:46:56,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:56,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 15:46:56,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 15:46:56,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:46:56,429 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 27 states. [2018-12-03 15:46:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:46:58,552 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2018-12-03 15:46:58,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 15:46:58,552 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 37 [2018-12-03 15:46:58,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:46:58,554 INFO L225 Difference]: With dead ends: 97 [2018-12-03 15:46:58,554 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 15:46:58,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=499, Invalid=3533, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 15:46:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 15:46:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 45. [2018-12-03 15:46:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 15:46:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2018-12-03 15:46:58,564 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 37 [2018-12-03 15:46:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:46:58,564 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2018-12-03 15:46:58,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 15:46:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-12-03 15:46:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:46:58,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:46:58,566 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1] [2018-12-03 15:46:58,566 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:46:58,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:46:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1868574667, now seen corresponding path program 9 times [2018-12-03 15:46:58,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:46:58,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:58,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:46:58,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:46:58,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:46:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:46:58,988 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:58,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:58,989 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:46:58,989 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:46:58,989 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:46:58,989 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:46:58,989 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 15:46:58,998 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:46:58,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:46:59,007 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:46:59,007 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:46:59,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:46:59,285 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:59,286 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:46:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:46:59,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:46:59,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 22 [2018-12-03 15:46:59,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:46:59,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:46:59,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:46:59,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:46:59,342 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 23 states. [2018-12-03 15:47:00,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:00,714 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2018-12-03 15:47:00,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 15:47:00,715 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-12-03 15:47:00,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:00,717 INFO L225 Difference]: With dead ends: 94 [2018-12-03 15:47:00,717 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 15:47:00,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=149, Invalid=1041, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 15:47:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 15:47:00,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2018-12-03 15:47:00,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 15:47:00,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2018-12-03 15:47:00,727 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 44 [2018-12-03 15:47:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:00,727 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2018-12-03 15:47:00,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:47:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2018-12-03 15:47:00,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 15:47:00,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:00,728 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1] [2018-12-03 15:47:00,729 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:00,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:00,729 INFO L82 PathProgramCache]: Analyzing trace with hash 269550812, now seen corresponding path program 10 times [2018-12-03 15:47:00,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:00,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:00,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:00,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:00,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:00,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:00,892 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:00,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:00,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:00,893 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:00,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 15:47:00,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:00,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 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 15:47:00,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:00,902 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:00,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:01,124 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:01,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 78 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:01,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:01,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 22 [2018-12-03 15:47:01,222 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:01,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 15:47:01,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 15:47:01,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-03 15:47:01,224 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 23 states. [2018-12-03 15:47:01,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:01,505 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2018-12-03 15:47:01,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 15:47:01,506 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 48 [2018-12-03 15:47:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:01,507 INFO L225 Difference]: With dead ends: 105 [2018-12-03 15:47:01,507 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 15:47:01,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 75 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2018-12-03 15:47:01,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 15:47:01,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-12-03 15:47:01,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 15:47:01,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2018-12-03 15:47:01,518 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 48 [2018-12-03 15:47:01,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:01,518 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2018-12-03 15:47:01,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 15:47:01,518 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2018-12-03 15:47:01,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 15:47:01,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:01,519 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 1, 1, 1, 1, 1] [2018-12-03 15:47:01,519 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:01,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:01,519 INFO L82 PathProgramCache]: Analyzing trace with hash 2089942100, now seen corresponding path program 11 times [2018-12-03 15:47:01,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:01,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:01,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:01,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:01,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:01,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:01,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:01,881 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:01,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:01,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:01,881 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 15:47:01,890 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:01,890 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:01,949 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 15:47:01,949 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:01,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:02,188 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:02,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:02,240 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 6 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:02,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:02,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 25 [2018-12-03 15:47:02,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:02,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:47:02,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:47:02,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:47:02,261 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand 26 states. [2018-12-03 15:47:03,922 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-12-03 15:47:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:03,946 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2018-12-03 15:47:03,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 15:47:03,947 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 51 [2018-12-03 15:47:03,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:03,948 INFO L225 Difference]: With dead ends: 109 [2018-12-03 15:47:03,948 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 15:47:03,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=179, Invalid=1381, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 15:47:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 15:47:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 56. [2018-12-03 15:47:03,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 15:47:03,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-12-03 15:47:03,958 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 51 [2018-12-03 15:47:03,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:03,958 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-12-03 15:47:03,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:47:03,959 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-12-03 15:47:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 15:47:03,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:03,962 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2018-12-03 15:47:03,962 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:03,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:03,962 INFO L82 PathProgramCache]: Analyzing trace with hash 549587323, now seen corresponding path program 12 times [2018-12-03 15:47:03,962 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:03,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:03,963 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:03,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:03,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:03,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:04,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:04,725 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:04,725 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:04,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:04,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:04,725 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 15:47:04,734 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:04,734 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:04,746 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:04,746 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:04,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:04,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:05,250 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:05,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:05,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 25 [2018-12-03 15:47:05,270 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:05,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 15:47:05,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 15:47:05,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=481, Unknown=0, NotChecked=0, Total=650 [2018-12-03 15:47:05,271 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 26 states. [2018-12-03 15:47:05,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:05,616 INFO L93 Difference]: Finished difference Result 120 states and 124 transitions. [2018-12-03 15:47:05,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 15:47:05,617 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 55 [2018-12-03 15:47:05,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:05,617 INFO L225 Difference]: With dead ends: 120 [2018-12-03 15:47:05,618 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 15:47:05,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 86 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 322 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=293, Invalid=829, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 15:47:05,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 15:47:05,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-12-03 15:47:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 15:47:05,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-12-03 15:47:05,629 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 55 [2018-12-03 15:47:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:05,629 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-12-03 15:47:05,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 15:47:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-12-03 15:47:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 15:47:05,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:05,631 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1] [2018-12-03 15:47:05,631 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:05,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:05,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1743111421, now seen corresponding path program 13 times [2018-12-03 15:47:05,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:05,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:05,632 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:05,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:05,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:06,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:06,132 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:06,132 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:06,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 15:47:06,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:06,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 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 15:47:06,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:06,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:06,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:06,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 7 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:06,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:06,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 28 [2018-12-03 15:47:06,497 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:06,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:47:06,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:47:06,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:47:06,498 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 29 states. [2018-12-03 15:47:08,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:08,003 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2018-12-03 15:47:08,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 15:47:08,008 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 58 [2018-12-03 15:47:08,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:08,008 INFO L225 Difference]: With dead ends: 124 [2018-12-03 15:47:08,009 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 15:47:08,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=211, Invalid=1769, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 15:47:08,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 15:47:08,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 63. [2018-12-03 15:47:08,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 15:47:08,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2018-12-03 15:47:08,020 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 58 [2018-12-03 15:47:08,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:08,020 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2018-12-03 15:47:08,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:47:08,020 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2018-12-03 15:47:08,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 15:47:08,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:08,021 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1] [2018-12-03 15:47:08,021 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:08,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:08,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1415751510, now seen corresponding path program 14 times [2018-12-03 15:47:08,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:08,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:08,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:08,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:08,023 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:08,246 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:08,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:08,246 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:08,247 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:08,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:08,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:08,247 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 15:47:08,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:08,256 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:08,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 15:47:08,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:08,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:08,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 136 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:08,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:08,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 28 [2018-12-03 15:47:08,703 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:08,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 15:47:08,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 15:47:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=604, Unknown=0, NotChecked=0, Total=812 [2018-12-03 15:47:08,704 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 29 states. [2018-12-03 15:47:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:09,196 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2018-12-03 15:47:09,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 15:47:09,196 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-12-03 15:47:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:09,197 INFO L225 Difference]: With dead ends: 135 [2018-12-03 15:47:09,197 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 15:47:09,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 97 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=361, Invalid=1045, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:47:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 15:47:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-12-03 15:47:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 15:47:09,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2018-12-03 15:47:09,221 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 62 [2018-12-03 15:47:09,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:09,221 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2018-12-03 15:47:09,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 15:47:09,221 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2018-12-03 15:47:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 15:47:09,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:09,222 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1] [2018-12-03 15:47:09,222 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:09,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:09,223 INFO L82 PathProgramCache]: Analyzing trace with hash 175889954, now seen corresponding path program 15 times [2018-12-03 15:47:09,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:09,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:09,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:09,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:09,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:09,705 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:09,705 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:09,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 15:47:09,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:09,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 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 15:47:09,715 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:09,715 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:09,740 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:09,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:09,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:10,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 8 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:10,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:10,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 31 [2018-12-03 15:47:10,241 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:10,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:47:10,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:47:10,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=910, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:47:10,243 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 32 states. [2018-12-03 15:47:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:12,365 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2018-12-03 15:47:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 15:47:12,366 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 65 [2018-12-03 15:47:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:12,367 INFO L225 Difference]: With dead ends: 139 [2018-12-03 15:47:12,367 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 15:47:12,369 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 116 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=245, Invalid=2205, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:47:12,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 15:47:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 70. [2018-12-03 15:47:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 15:47:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2018-12-03 15:47:12,377 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 65 [2018-12-03 15:47:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:12,377 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2018-12-03 15:47:12,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:47:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2018-12-03 15:47:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 15:47:12,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:12,378 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1] [2018-12-03 15:47:12,378 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:12,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:12,379 INFO L82 PathProgramCache]: Analyzing trace with hash 2774089, now seen corresponding path program 16 times [2018-12-03 15:47:12,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:12,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:12,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:12,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:12,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:12,615 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:12,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:12,616 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:12,616 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:12,616 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:12,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:12,616 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 15:47:12,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:12,633 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:12,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:13,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:13,498 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 171 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:13,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:13,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 31 [2018-12-03 15:47:13,517 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:13,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 15:47:13,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 15:47:13,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=741, Unknown=0, NotChecked=0, Total=992 [2018-12-03 15:47:13,518 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 32 states. [2018-12-03 15:47:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:13,903 INFO L93 Difference]: Finished difference Result 150 states and 154 transitions. [2018-12-03 15:47:13,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 15:47:13,903 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 69 [2018-12-03 15:47:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:13,904 INFO L225 Difference]: With dead ends: 150 [2018-12-03 15:47:13,904 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 15:47:13,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 108 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=436, Invalid=1286, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 15:47:13,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 15:47:13,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2018-12-03 15:47:13,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 15:47:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 75 transitions. [2018-12-03 15:47:13,915 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 75 transitions. Word has length 69 [2018-12-03 15:47:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:13,916 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 75 transitions. [2018-12-03 15:47:13,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 15:47:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 75 transitions. [2018-12-03 15:47:13,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 15:47:13,917 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:13,917 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1] [2018-12-03 15:47:13,917 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:13,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:13,917 INFO L82 PathProgramCache]: Analyzing trace with hash 2036938705, now seen corresponding path program 17 times [2018-12-03 15:47:13,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:13,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:13,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:13,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:13,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:13,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 9 proven. 307 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:14,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:14,560 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:14,560 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:14,560 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:14,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:14,561 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 15:47:14,569 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:14,569 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:14,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 15:47:14,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:14,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:15,658 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 162 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:15,658 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 153 proven. 163 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:16,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:16,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 58 [2018-12-03 15:47:16,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:16,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:47:16,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:47:16,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=3001, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:47:16,428 INFO L87 Difference]: Start difference. First operand 73 states and 75 transitions. Second operand 47 states. [2018-12-03 15:47:18,988 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-12-03 15:47:21,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:21,081 INFO L93 Difference]: Finished difference Result 192 states and 198 transitions. [2018-12-03 15:47:21,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:47:21,081 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 72 [2018-12-03 15:47:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:21,083 INFO L225 Difference]: With dead ends: 192 [2018-12-03 15:47:21,083 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 15:47:21,089 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 97 SyntacticMatches, 11 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3015 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=1319, Invalid=12723, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:47:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 15:47:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2018-12-03 15:47:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:47:21,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2018-12-03 15:47:21,098 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 72 [2018-12-03 15:47:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:21,098 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2018-12-03 15:47:21,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:47:21,098 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2018-12-03 15:47:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 15:47:21,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:21,099 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1] [2018-12-03 15:47:21,099 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:21,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1070649840, now seen corresponding path program 18 times [2018-12-03 15:47:21,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:21,100 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:21,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:21,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:22,287 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:22,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:22,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:22,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:22,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:22,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:22,288 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 15:47:22,296 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:22,296 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:22,311 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:22,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:22,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:22,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 10 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:23,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:23,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 37 [2018-12-03 15:47:23,009 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:23,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:47:23,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:47:23,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1308, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:47:23,010 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand 38 states. [2018-12-03 15:47:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:25,246 INFO L93 Difference]: Finished difference Result 169 states and 174 transitions. [2018-12-03 15:47:25,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 15:47:25,249 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 79 [2018-12-03 15:47:25,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:25,250 INFO L225 Difference]: With dead ends: 169 [2018-12-03 15:47:25,250 INFO L226 Difference]: Without dead ends: 127 [2018-12-03 15:47:25,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 142 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=319, Invalid=3221, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 15:47:25,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-12-03 15:47:25,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 84. [2018-12-03 15:47:25,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 15:47:25,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2018-12-03 15:47:25,261 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 79 [2018-12-03 15:47:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:25,262 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2018-12-03 15:47:25,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:47:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2018-12-03 15:47:25,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 15:47:25,262 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:25,263 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1] [2018-12-03 15:47:25,263 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:25,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:25,263 INFO L82 PathProgramCache]: Analyzing trace with hash -685461225, now seen corresponding path program 19 times [2018-12-03 15:47:25,263 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:25,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:25,264 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:25,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:25,264 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:25,880 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:25,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:25,881 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:25,881 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:25,881 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:25,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:25,881 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 15:47:25,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:25,890 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:25,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:25,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:26,170 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:26,364 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 253 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:26,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:26,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 37 [2018-12-03 15:47:26,383 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:26,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 15:47:26,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 15:47:26,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=1057, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 15:47:26,384 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand 38 states. [2018-12-03 15:47:26,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:26,987 INFO L93 Difference]: Finished difference Result 180 states and 184 transitions. [2018-12-03 15:47:26,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 15:47:26,988 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 83 [2018-12-03 15:47:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:26,989 INFO L225 Difference]: With dead ends: 180 [2018-12-03 15:47:26,989 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 15:47:26,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 130 SyntacticMatches, 23 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 770 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=607, Invalid=1843, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:47:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 15:47:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-12-03 15:47:27,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 15:47:27,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 89 transitions. [2018-12-03 15:47:27,001 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 89 transitions. Word has length 83 [2018-12-03 15:47:27,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:27,001 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 89 transitions. [2018-12-03 15:47:27,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 15:47:27,002 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 89 transitions. [2018-12-03 15:47:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 15:47:27,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:27,003 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1] [2018-12-03 15:47:27,003 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:27,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1750415713, now seen corresponding path program 20 times [2018-12-03 15:47:27,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:27,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:27,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:27,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:27,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:27,586 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 11 proven. 452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:27,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:27,586 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:27,587 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:27,587 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:27,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:27,587 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:47:27,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:27,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:27,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 15:47:27,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:27,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 242 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:28,727 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 231 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:29,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:29,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28, 28] total 68 [2018-12-03 15:47:29,721 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:29,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 15:47:29,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 15:47:29,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=560, Invalid=4132, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 15:47:29,723 INFO L87 Difference]: Start difference. First operand 87 states and 89 transitions. Second operand 55 states. [2018-12-03 15:47:36,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:36,347 INFO L93 Difference]: Finished difference Result 230 states and 236 transitions. [2018-12-03 15:47:36,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 15:47:36,348 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 86 [2018-12-03 15:47:36,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:36,349 INFO L225 Difference]: With dead ends: 230 [2018-12-03 15:47:36,349 INFO L226 Difference]: Without dead ends: 135 [2018-12-03 15:47:36,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4250 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=1745, Invalid=17995, Unknown=0, NotChecked=0, Total=19740 [2018-12-03 15:47:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-12-03 15:47:36,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 94. [2018-12-03 15:47:36,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 15:47:36,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2018-12-03 15:47:36,368 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 86 [2018-12-03 15:47:36,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:36,368 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2018-12-03 15:47:36,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 15:47:36,369 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2018-12-03 15:47:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 15:47:36,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:36,370 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1] [2018-12-03 15:47:36,370 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:36,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2005850046, now seen corresponding path program 21 times [2018-12-03 15:47:36,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:36,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:36,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:36,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:36,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:36,985 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:36,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:36,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:36,985 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 15:47:36,995 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:36,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:37,012 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:37,012 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:37,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:37,551 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:37,762 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 12 proven. 535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:37,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:37,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 43 [2018-12-03 15:47:37,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:37,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:47:37,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:47:37,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1778, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:47:37,782 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 44 states. [2018-12-03 15:47:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:41,029 INFO L93 Difference]: Finished difference Result 199 states and 204 transitions. [2018-12-03 15:47:41,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 15:47:41,030 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 93 [2018-12-03 15:47:41,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:41,030 INFO L225 Difference]: With dead ends: 199 [2018-12-03 15:47:41,031 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 15:47:41,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 168 SyntacticMatches, 3 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=401, Invalid=4429, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:47:41,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 15:47:41,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 98. [2018-12-03 15:47:41,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 15:47:41,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2018-12-03 15:47:41,046 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 93 [2018-12-03 15:47:41,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:41,046 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2018-12-03 15:47:41,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:47:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2018-12-03 15:47:41,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 15:47:41,047 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:41,047 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1] [2018-12-03 15:47:41,048 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:41,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:41,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1370431461, now seen corresponding path program 22 times [2018-12-03 15:47:41,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:41,049 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:41,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:41,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:41,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:41,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:41,389 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:41,389 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:41,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 15:47:41,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:41,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 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 15:47:41,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:41,398 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:41,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:41,418 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:41,750 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:42,533 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 351 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:42,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:42,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 43 [2018-12-03 15:47:42,553 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:42,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 15:47:42,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 15:47:42,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1429, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 15:47:42,554 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 44 states. [2018-12-03 15:47:43,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:43,212 INFO L93 Difference]: Finished difference Result 210 states and 214 transitions. [2018-12-03 15:47:43,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 15:47:43,212 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 97 [2018-12-03 15:47:43,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:43,213 INFO L225 Difference]: With dead ends: 210 [2018-12-03 15:47:43,214 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 15:47:43,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 152 SyntacticMatches, 27 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1066 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=806, Invalid=2500, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 15:47:43,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 15:47:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-12-03 15:47:43,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 15:47:43,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2018-12-03 15:47:43,231 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 97 [2018-12-03 15:47:43,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:43,232 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2018-12-03 15:47:43,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 15:47:43,232 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2018-12-03 15:47:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 15:47:43,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:43,233 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1] [2018-12-03 15:47:43,233 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:43,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:43,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1811736429, now seen corresponding path program 23 times [2018-12-03 15:47:43,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:43,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:43,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:43,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:43,234 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:44,144 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:44,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:44,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:44,145 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:44,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:44,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:44,145 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 15:47:44,153 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:44,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:44,179 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 15:47:44,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:44,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:44,885 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:44,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 638 backedges. 13 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:44,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:44,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 46 [2018-12-03 15:47:44,990 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:44,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:47:44,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:47:44,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=2040, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:47:44,991 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand 47 states. [2018-12-03 15:47:48,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:48,608 INFO L93 Difference]: Finished difference Result 214 states and 219 transitions. [2018-12-03 15:47:48,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 15:47:48,609 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 100 [2018-12-03 15:47:48,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:48,610 INFO L225 Difference]: With dead ends: 214 [2018-12-03 15:47:48,610 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 15:47:48,612 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 181 SyntacticMatches, 3 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 878 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=445, Invalid=5105, Unknown=0, NotChecked=0, Total=5550 [2018-12-03 15:47:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 15:47:48,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 105. [2018-12-03 15:47:48,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 15:47:48,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2018-12-03 15:47:48,626 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2018-12-03 15:47:48,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:48,627 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2018-12-03 15:47:48,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:47:48,627 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2018-12-03 15:47:48,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 15:47:48,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:48,627 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1] [2018-12-03 15:47:48,628 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:48,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:48,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1008713748, now seen corresponding path program 24 times [2018-12-03 15:47:48,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:48,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:48,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:48,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:48,629 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:48,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:48,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:48,998 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:48,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:48,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:48,999 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 15:47:49,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:49,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:49,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:49,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:49,024 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:49,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 406 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:49,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:49,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 46 [2018-12-03 15:47:49,796 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:49,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 15:47:49,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 15:47:49,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=526, Invalid=1636, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 15:47:49,797 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand 47 states. [2018-12-03 15:47:50,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:50,396 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2018-12-03 15:47:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 15:47:50,396 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 104 [2018-12-03 15:47:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:50,397 INFO L225 Difference]: With dead ends: 225 [2018-12-03 15:47:50,397 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 15:47:50,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 163 SyntacticMatches, 29 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=916, Invalid=2866, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 15:47:50,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 15:47:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-12-03 15:47:50,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 15:47:50,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 110 transitions. [2018-12-03 15:47:50,417 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 110 transitions. Word has length 104 [2018-12-03 15:47:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:50,417 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 110 transitions. [2018-12-03 15:47:50,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 15:47:50,417 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 110 transitions. [2018-12-03 15:47:50,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 15:47:50,418 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:50,418 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 1, 1, 1, 1, 1] [2018-12-03 15:47:50,418 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:50,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:50,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1699483764, now seen corresponding path program 25 times [2018-12-03 15:47:50,419 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:50,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:50,420 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:50,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:50,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:50,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:51,368 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:51,368 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:51,368 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:51,368 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:51,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 15:47:51,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:51,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 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 15:47:51,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:51,377 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:47:51,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:51,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:52,044 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:52,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 14 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:52,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:52,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 49 [2018-12-03 15:47:52,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:52,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:47:52,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:47:52,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=2320, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:47:52,147 INFO L87 Difference]: Start difference. First operand 108 states and 110 transitions. Second operand 50 states. [2018-12-03 15:47:56,746 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-12-03 15:47:57,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:57,063 INFO L93 Difference]: Finished difference Result 229 states and 234 transitions. [2018-12-03 15:47:57,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 15:47:57,064 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 107 [2018-12-03 15:47:57,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:57,065 INFO L225 Difference]: With dead ends: 229 [2018-12-03 15:47:57,065 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 15:47:57,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 194 SyntacticMatches, 3 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=491, Invalid=5829, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:47:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 15:47:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 112. [2018-12-03 15:47:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 15:47:57,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-12-03 15:47:57,087 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 107 [2018-12-03 15:47:57,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:57,087 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-12-03 15:47:57,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:47:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-12-03 15:47:57,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 15:47:57,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:57,088 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1] [2018-12-03 15:47:57,089 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:57,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:57,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1446534989, now seen corresponding path program 26 times [2018-12-03 15:47:57,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:57,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:57,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:47:57,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:57,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:57,509 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:57,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:57,509 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:57,510 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:57,510 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:57,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:57,510 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 15:47:57,520 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:47:57,520 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:47:57,546 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 15:47:57,546 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:57,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:47:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:58,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:47:58,311 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 465 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:58,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:47:58,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 49 [2018-12-03 15:47:58,331 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:47:58,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 15:47:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 15:47:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=593, Invalid=1857, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 15:47:58,333 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 50 states. [2018-12-03 15:47:58,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:47:58,863 INFO L93 Difference]: Finished difference Result 240 states and 244 transitions. [2018-12-03 15:47:58,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 15:47:58,864 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 111 [2018-12-03 15:47:58,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:47:58,865 INFO L225 Difference]: With dead ends: 240 [2018-12-03 15:47:58,865 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 15:47:58,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 174 SyntacticMatches, 31 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1410 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1033, Invalid=3257, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 15:47:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 15:47:58,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-12-03 15:47:58,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 15:47:58,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-12-03 15:47:58,887 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 111 [2018-12-03 15:47:58,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:47:58,887 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-12-03 15:47:58,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 15:47:58,887 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-12-03 15:47:58,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 15:47:58,888 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:47:58,888 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 1, 1, 1, 1, 1] [2018-12-03 15:47:58,888 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:47:58,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:47:58,889 INFO L82 PathProgramCache]: Analyzing trace with hash -2055366085, now seen corresponding path program 27 times [2018-12-03 15:47:58,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:47:58,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:58,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:47:58,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:47:58,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:47:58,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:47:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:47:59,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:59,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:47:59,876 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:47:59,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:47:59,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:47:59,876 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 15:47:59,885 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:47:59,885 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:47:59,914 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:47:59,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:47:59,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:00,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 15 proven. 826 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:00,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:00,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 52 [2018-12-03 15:48:00,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:00,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:48:00,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:48:00,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=2618, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:48:00,895 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 53 states. [2018-12-03 15:48:06,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:06,121 INFO L93 Difference]: Finished difference Result 244 states and 249 transitions. [2018-12-03 15:48:06,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 15:48:06,125 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 114 [2018-12-03 15:48:06,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:06,126 INFO L225 Difference]: With dead ends: 244 [2018-12-03 15:48:06,126 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 15:48:06,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 207 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=539, Invalid=6601, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 15:48:06,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 15:48:06,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 119. [2018-12-03 15:48:06,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-03 15:48:06,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 121 transitions. [2018-12-03 15:48:06,150 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 121 transitions. Word has length 114 [2018-12-03 15:48:06,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:06,150 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 121 transitions. [2018-12-03 15:48:06,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:48:06,150 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 121 transitions. [2018-12-03 15:48:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-12-03 15:48:06,151 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:06,151 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1] [2018-12-03 15:48:06,151 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:06,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:06,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1833851874, now seen corresponding path program 28 times [2018-12-03 15:48:06,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:06,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:06,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:06,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:06,934 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:06,934 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:06,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:06,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:06,935 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 15:48:06,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:06,945 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:06,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:06,969 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:07,457 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:07,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 528 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:07,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:07,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 52 [2018-12-03 15:48:07,827 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:07,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 15:48:07,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 15:48:07,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=664, Invalid=2092, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 15:48:07,829 INFO L87 Difference]: Start difference. First operand 119 states and 121 transitions. Second operand 53 states. [2018-12-03 15:48:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:08,755 INFO L93 Difference]: Finished difference Result 255 states and 259 transitions. [2018-12-03 15:48:08,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 15:48:08,756 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 118 [2018-12-03 15:48:08,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:08,757 INFO L225 Difference]: With dead ends: 255 [2018-12-03 15:48:08,757 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 15:48:08,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 185 SyntacticMatches, 33 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1157, Invalid=3673, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 15:48:08,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 15:48:08,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-12-03 15:48:08,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 15:48:08,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-12-03 15:48:08,777 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 118 [2018-12-03 15:48:08,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:08,778 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-12-03 15:48:08,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 15:48:08,778 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-12-03 15:48:08,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 15:48:08,778 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:08,778 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 1, 1, 1, 1, 1] [2018-12-03 15:48:08,779 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:08,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:08,779 INFO L82 PathProgramCache]: Analyzing trace with hash 540940634, now seen corresponding path program 29 times [2018-12-03 15:48:08,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:08,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:08,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:08,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:08,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:09,759 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 16 proven. 937 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:09,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:09,759 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:09,759 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:09,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 15:48:09,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:09,760 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 15:48:09,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:09,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:09,822 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 15:48:09,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:09,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:12,052 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 512 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:12,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:13,824 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 496 proven. 457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:13,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:13,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 93 [2018-12-03 15:48:13,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:13,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 15:48:13,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 15:48:13,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=7747, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:48:13,845 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 75 states. [2018-12-03 15:48:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:24,294 INFO L93 Difference]: Finished difference Result 325 states and 331 transitions. [2018-12-03 15:48:24,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-12-03 15:48:24,295 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 121 [2018-12-03 15:48:24,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:24,296 INFO L225 Difference]: With dead ends: 325 [2018-12-03 15:48:24,297 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 15:48:24,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 167 SyntacticMatches, 18 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8265 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=3055, Invalid=35165, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 15:48:24,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 15:48:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 129. [2018-12-03 15:48:24,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 15:48:24,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2018-12-03 15:48:24,319 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 121 [2018-12-03 15:48:24,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:24,319 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2018-12-03 15:48:24,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 15:48:24,319 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2018-12-03 15:48:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 15:48:24,320 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:24,320 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 1, 1, 1, 1, 1] [2018-12-03 15:48:24,320 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:24,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:24,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1991581943, now seen corresponding path program 30 times [2018-12-03 15:48:24,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:24,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:24,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:24,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:24,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:25,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:25,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:25,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:25,416 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:25,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:25,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:25,416 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 15:48:25,424 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:25,425 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:25,445 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:25,445 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:25,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:26,335 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:26,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 17 proven. 1055 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:26,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:26,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 38, 38] total 58 [2018-12-03 15:48:26,473 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:26,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:48:26,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:48:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=3268, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:48:26,475 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand 59 states. [2018-12-03 15:48:32,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:32,394 INFO L93 Difference]: Finished difference Result 274 states and 279 transitions. [2018-12-03 15:48:32,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 15:48:32,394 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 128 [2018-12-03 15:48:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:32,396 INFO L225 Difference]: With dead ends: 274 [2018-12-03 15:48:32,397 INFO L226 Difference]: Without dead ends: 204 [2018-12-03 15:48:32,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1414 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=641, Invalid=8289, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:48:32,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-12-03 15:48:32,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 133. [2018-12-03 15:48:32,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 15:48:32,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-12-03 15:48:32,423 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 128 [2018-12-03 15:48:32,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:32,423 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-12-03 15:48:32,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:48:32,423 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-12-03 15:48:32,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 15:48:32,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:32,424 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1] [2018-12-03 15:48:32,424 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:32,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:32,424 INFO L82 PathProgramCache]: Analyzing trace with hash -1942976080, now seen corresponding path program 31 times [2018-12-03 15:48:32,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:32,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:32,425 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:32,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:32,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:33,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:33,004 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:33,004 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:33,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 15:48:33,004 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:33,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 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 15:48:33,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:33,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:48:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:33,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:33,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:33,660 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1143 backedges. 666 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:34,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:34,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 58 [2018-12-03 15:48:34,115 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:34,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 15:48:34,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 15:48:34,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=818, Invalid=2604, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 15:48:34,116 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 59 states. [2018-12-03 15:48:35,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:35,006 INFO L93 Difference]: Finished difference Result 285 states and 289 transitions. [2018-12-03 15:48:35,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 15:48:35,007 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 132 [2018-12-03 15:48:35,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:35,008 INFO L225 Difference]: With dead ends: 285 [2018-12-03 15:48:35,008 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 15:48:35,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 207 SyntacticMatches, 37 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1426, Invalid=4580, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 15:48:35,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 15:48:35,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-12-03 15:48:35,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 15:48:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 138 transitions. [2018-12-03 15:48:35,038 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 138 transitions. Word has length 132 [2018-12-03 15:48:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:35,038 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 138 transitions. [2018-12-03 15:48:35,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 15:48:35,038 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 138 transitions. [2018-12-03 15:48:35,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 15:48:35,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:35,039 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 1, 1, 1, 1, 1] [2018-12-03 15:48:35,040 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:35,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:35,040 INFO L82 PathProgramCache]: Analyzing trace with hash 220943656, now seen corresponding path program 32 times [2018-12-03 15:48:35,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:35,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:35,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:48:35,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:35,041 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 18 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:36,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:36,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:36,102 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:36,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:36,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:36,103 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 15:48:36,111 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:48:36,111 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:48:36,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 15:48:36,147 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:36,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 648 proven. 550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:38,819 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:41,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 630 proven. 568 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:41,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:41,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 103 [2018-12-03 15:48:41,035 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:41,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 15:48:41,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 15:48:41,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1204, Invalid=9508, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 15:48:41,037 INFO L87 Difference]: Start difference. First operand 136 states and 138 transitions. Second operand 83 states. [2018-12-03 15:48:51,985 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-03 15:48:52,276 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-03 15:48:52,630 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-12-03 15:48:54,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:48:54,842 INFO L93 Difference]: Finished difference Result 363 states and 369 transitions. [2018-12-03 15:48:54,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-12-03 15:48:54,842 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 135 [2018-12-03 15:48:54,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:48:54,844 INFO L225 Difference]: With dead ends: 363 [2018-12-03 15:48:54,844 INFO L226 Difference]: Without dead ends: 212 [2018-12-03 15:48:54,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 187 SyntacticMatches, 20 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10242 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=3677, Invalid=43629, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 15:48:54,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-03 15:48:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 143. [2018-12-03 15:48:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-12-03 15:48:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 145 transitions. [2018-12-03 15:48:54,875 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 145 transitions. Word has length 135 [2018-12-03 15:48:54,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:48:54,876 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 145 transitions. [2018-12-03 15:48:54,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 15:48:54,876 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 145 transitions. [2018-12-03 15:48:54,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-12-03 15:48:54,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:48:54,876 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 1, 1, 1, 1, 1] [2018-12-03 15:48:54,877 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:48:54,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:48:54,877 INFO L82 PathProgramCache]: Analyzing trace with hash 847427031, now seen corresponding path program 33 times [2018-12-03 15:48:54,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:48:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:54,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:48:54,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:48:54,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:48:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:48:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:56,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:56,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:48:56,218 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:48:56,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:48:56,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:48:56,218 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 15:48:56,227 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:48:56,227 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:48:56,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:48:56,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:48:56,267 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:48:57,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:57,390 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:48:57,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1331 backedges. 19 proven. 1312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:48:57,529 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:48:57,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 64 [2018-12-03 15:48:57,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:48:57,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:48:57,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:48:57,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=3990, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:48:57,530 INFO L87 Difference]: Start difference. First operand 143 states and 145 transitions. Second operand 65 states. [2018-12-03 15:49:01,812 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-03 15:49:02,075 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-03 15:49:02,332 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-12-03 15:49:02,691 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2018-12-03 15:49:02,888 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2018-12-03 15:49:03,103 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2018-12-03 15:49:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:04,344 INFO L93 Difference]: Finished difference Result 304 states and 309 transitions. [2018-12-03 15:49:04,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 15:49:04,344 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 142 [2018-12-03 15:49:04,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:04,345 INFO L225 Difference]: With dead ends: 304 [2018-12-03 15:49:04,345 INFO L226 Difference]: Without dead ends: 226 [2018-12-03 15:49:04,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 259 SyntacticMatches, 3 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1730 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=751, Invalid=10169, Unknown=0, NotChecked=0, Total=10920 [2018-12-03 15:49:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-03 15:49:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 147. [2018-12-03 15:49:04,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 15:49:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 149 transitions. [2018-12-03 15:49:04,377 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 149 transitions. Word has length 142 [2018-12-03 15:49:04,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:04,377 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 149 transitions. [2018-12-03 15:49:04,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:49:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 149 transitions. [2018-12-03 15:49:04,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 15:49:04,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:04,378 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1] [2018-12-03 15:49:04,379 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:04,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1796978306, now seen corresponding path program 34 times [2018-12-03 15:49:04,379 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:04,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:04,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:04,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:04,380 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:05,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:05,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:05,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:05,867 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:05,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:05,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:05,867 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 15:49:05,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:05,877 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:05,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:06,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:07,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1410 backedges. 820 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:07,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:07,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 64 [2018-12-03 15:49:07,266 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:07,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 15:49:07,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 15:49:07,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=988, Invalid=3172, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 15:49:07,267 INFO L87 Difference]: Start difference. First operand 147 states and 149 transitions. Second operand 65 states. [2018-12-03 15:49:08,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:08,863 INFO L93 Difference]: Finished difference Result 315 states and 319 transitions. [2018-12-03 15:49:08,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 15:49:08,865 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 146 [2018-12-03 15:49:08,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:08,866 INFO L225 Difference]: With dead ends: 315 [2018-12-03 15:49:08,866 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 15:49:08,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 229 SyntacticMatches, 41 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2480 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1723, Invalid=5587, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:49:08,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 15:49:08,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-12-03 15:49:08,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 15:49:08,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2018-12-03 15:49:08,903 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 146 [2018-12-03 15:49:08,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:08,903 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2018-12-03 15:49:08,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 15:49:08,903 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2018-12-03 15:49:08,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 15:49:08,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:08,904 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 1, 1, 1, 1, 1] [2018-12-03 15:49:08,904 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:08,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:08,905 INFO L82 PathProgramCache]: Analyzing trace with hash -193355018, now seen corresponding path program 35 times [2018-12-03 15:49:08,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:08,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:08,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:08,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:08,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:08,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:10,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 20 proven. 1451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:10,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:10,527 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:10,528 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:10,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:10,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:10,528 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 15:49:10,536 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:10,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:10,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 15:49:10,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:10,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 800 proven. 671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:13,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:16,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1471 backedges. 780 proven. 691 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:16,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:16,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 46, 46] total 113 [2018-12-03 15:49:16,242 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:16,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 15:49:16,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 15:49:16,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=11449, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:49:16,244 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 91 states. [2018-12-03 15:49:28,042 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-03 15:49:28,371 WARN L180 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-03 15:49:28,730 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-12-03 15:49:29,009 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:49:31,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:31,691 INFO L93 Difference]: Finished difference Result 401 states and 407 transitions. [2018-12-03 15:49:31,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-12-03 15:49:31,691 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 149 [2018-12-03 15:49:31,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:31,693 INFO L225 Difference]: With dead ends: 401 [2018-12-03 15:49:31,693 INFO L226 Difference]: Without dead ends: 234 [2018-12-03 15:49:31,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 207 SyntacticMatches, 22 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12431 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=4355, Invalid=53005, Unknown=0, NotChecked=0, Total=57360 [2018-12-03 15:49:31,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-03 15:49:31,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 157. [2018-12-03 15:49:31,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 15:49:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 159 transitions. [2018-12-03 15:49:31,726 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 159 transitions. Word has length 149 [2018-12-03 15:49:31,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:31,726 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 159 transitions. [2018-12-03 15:49:31,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 15:49:31,726 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 159 transitions. [2018-12-03 15:49:31,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 15:49:31,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:31,727 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 1, 1, 1, 1, 1] [2018-12-03 15:49:31,727 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:31,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:31,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1380130469, now seen corresponding path program 36 times [2018-12-03 15:49:31,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:31,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:31,729 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:31,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:31,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:31,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:33,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:33,146 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:33,146 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:33,146 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:33,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:33,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:33,147 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 15:49:33,156 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:49:33,156 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:49:33,182 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:49:33,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:33,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:35,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1618 backedges. 21 proven. 1597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:35,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:35,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 70 [2018-12-03 15:49:35,689 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:35,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:49:35,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:49:35,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=4784, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:49:35,690 INFO L87 Difference]: Start difference. First operand 157 states and 159 transitions. Second operand 71 states. [2018-12-03 15:49:41,544 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-03 15:49:41,863 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-03 15:49:42,165 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-12-03 15:49:42,360 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:49:42,557 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:49:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:44,687 INFO L93 Difference]: Finished difference Result 334 states and 339 transitions. [2018-12-03 15:49:44,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 15:49:44,688 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 156 [2018-12-03 15:49:44,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:44,690 INFO L225 Difference]: With dead ends: 334 [2018-12-03 15:49:44,690 INFO L226 Difference]: Without dead ends: 248 [2018-12-03 15:49:44,691 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 285 SyntacticMatches, 3 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=869, Invalid=12241, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 15:49:44,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-03 15:49:44,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 161. [2018-12-03 15:49:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 15:49:44,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 163 transitions. [2018-12-03 15:49:44,734 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 163 transitions. Word has length 156 [2018-12-03 15:49:44,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:44,734 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 163 transitions. [2018-12-03 15:49:44,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:49:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 163 transitions. [2018-12-03 15:49:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 15:49:44,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:44,735 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2018-12-03 15:49:44,736 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:44,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:44,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1719166132, now seen corresponding path program 37 times [2018-12-03 15:49:44,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:44,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:44,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:49:44,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:44,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:44,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:46,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:46,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:46,049 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:46,049 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:46,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:46,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:46,050 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 15:49:46,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:46,058 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:49:46,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:46,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:46,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:46,967 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1705 backedges. 990 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:47,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:47,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 70 [2018-12-03 15:49:47,617 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:47,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 15:49:47,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 15:49:47,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1174, Invalid=3796, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 15:49:47,618 INFO L87 Difference]: Start difference. First operand 161 states and 163 transitions. Second operand 71 states. [2018-12-03 15:49:49,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:49:49,497 INFO L93 Difference]: Finished difference Result 345 states and 349 transitions. [2018-12-03 15:49:49,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 15:49:49,499 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 160 [2018-12-03 15:49:49,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:49:49,500 INFO L225 Difference]: With dead ends: 345 [2018-12-03 15:49:49,500 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 15:49:49,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 251 SyntacticMatches, 45 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2992 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2048, Invalid=6694, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 15:49:49,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 15:49:49,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-12-03 15:49:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 15:49:49,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 166 transitions. [2018-12-03 15:49:49,540 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 166 transitions. Word has length 160 [2018-12-03 15:49:49,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:49:49,541 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 166 transitions. [2018-12-03 15:49:49,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 15:49:49,541 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 166 transitions. [2018-12-03 15:49:49,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 15:49:49,541 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:49:49,541 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1, 1] [2018-12-03 15:49:49,542 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:49:49,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:49:49,542 INFO L82 PathProgramCache]: Analyzing trace with hash -148438332, now seen corresponding path program 38 times [2018-12-03 15:49:49,542 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:49:49,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:49,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:49:49,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:49:49,543 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:49:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:49:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:51,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:51,051 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:49:51,051 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:49:51,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:49:51,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:49:51,051 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 15:49:51,060 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:49:51,061 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:49:51,165 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 15:49:51,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:49:51,170 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:49:52,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:52,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:49:52,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1772 backedges. 22 proven. 1750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:49:52,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:49:52,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 73 [2018-12-03 15:49:52,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:49:52,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:49:52,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:49:52,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=5208, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:49:52,699 INFO L87 Difference]: Start difference. First operand 164 states and 166 transitions. Second operand 74 states. [2018-12-03 15:49:59,893 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-03 15:50:00,236 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-03 15:50:00,564 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-12-03 15:50:00,775 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:50:00,978 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:50:01,179 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:50:03,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:03,206 INFO L93 Difference]: Finished difference Result 349 states and 354 transitions. [2018-12-03 15:50:03,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 15:50:03,206 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 163 [2018-12-03 15:50:03,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:03,207 INFO L225 Difference]: With dead ends: 349 [2018-12-03 15:50:03,208 INFO L226 Difference]: Without dead ends: 259 [2018-12-03 15:50:03,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 298 SyntacticMatches, 3 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2264 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=931, Invalid=13349, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 15:50:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-03 15:50:03,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 168. [2018-12-03 15:50:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 15:50:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 170 transitions. [2018-12-03 15:50:03,240 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 170 transitions. Word has length 163 [2018-12-03 15:50:03,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:03,240 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 170 transitions. [2018-12-03 15:50:03,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:50:03,241 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 170 transitions. [2018-12-03 15:50:03,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 15:50:03,241 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:03,241 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1] [2018-12-03 15:50:03,241 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:03,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:03,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1550952469, now seen corresponding path program 39 times [2018-12-03 15:50:03,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:03,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:03,242 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:03,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:03,243 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:04,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:04,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:04,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:04,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:04,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 15:50:04,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:04,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 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 15:50:04,147 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:04,147 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:04,173 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:04,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:04,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:05,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:05,382 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:06,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1863 backedges. 1081 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:06,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:06,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 73 [2018-12-03 15:50:06,099 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:06,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 15:50:06,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 15:50:06,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1273, Invalid=4129, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 15:50:06,100 INFO L87 Difference]: Start difference. First operand 168 states and 170 transitions. Second operand 74 states. [2018-12-03 15:50:07,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:07,893 INFO L93 Difference]: Finished difference Result 360 states and 364 transitions. [2018-12-03 15:50:07,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 15:50:07,894 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 167 [2018-12-03 15:50:07,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:07,895 INFO L225 Difference]: With dead ends: 360 [2018-12-03 15:50:07,895 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 15:50:07,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 262 SyntacticMatches, 47 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3266 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2221, Invalid=7285, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 15:50:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 15:50:07,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-12-03 15:50:07,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 15:50:07,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2018-12-03 15:50:07,929 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 167 [2018-12-03 15:50:07,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:07,929 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2018-12-03 15:50:07,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 15:50:07,929 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2018-12-03 15:50:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 15:50:07,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:07,930 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 1, 1, 1, 1, 1] [2018-12-03 15:50:07,930 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:07,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:07,930 INFO L82 PathProgramCache]: Analyzing trace with hash -810935949, now seen corresponding path program 40 times [2018-12-03 15:50:07,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:07,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:07,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:07,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:07,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:09,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:09,789 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:09,790 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:09,790 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:09,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:09,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:50:09,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:09,799 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:09,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:11,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:11,598 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 23 proven. 1910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:11,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:11,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 50, 50] total 76 [2018-12-03 15:50:11,777 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:11,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:50:11,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:50:11,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=5650, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:50:11,778 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand 77 states. [2018-12-03 15:50:19,346 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-03 15:50:19,746 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-03 15:50:20,135 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2018-12-03 15:50:20,375 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:50:20,595 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:50:20,802 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:50:21,008 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:50:23,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:23,146 INFO L93 Difference]: Finished difference Result 364 states and 369 transitions. [2018-12-03 15:50:23,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 15:50:23,146 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 170 [2018-12-03 15:50:23,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:23,148 INFO L225 Difference]: With dead ends: 364 [2018-12-03 15:50:23,148 INFO L226 Difference]: Without dead ends: 270 [2018-12-03 15:50:23,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 437 GetRequests, 311 SyntacticMatches, 3 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2458 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=995, Invalid=14505, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 15:50:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-12-03 15:50:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 175. [2018-12-03 15:50:23,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-03 15:50:23,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 177 transitions. [2018-12-03 15:50:23,188 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 177 transitions. Word has length 170 [2018-12-03 15:50:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:23,188 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 177 transitions. [2018-12-03 15:50:23,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:50:23,189 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 177 transitions. [2018-12-03 15:50:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-03 15:50:23,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:23,190 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1] [2018-12-03 15:50:23,190 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:23,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1036484838, now seen corresponding path program 41 times [2018-12-03 15:50:23,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:23,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:23,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:23,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:23,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:23,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:24,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:24,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:24,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:24,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:24,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:24,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:24,462 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 15:50:24,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:24,477 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:24,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 15:50:24,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:24,837 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:26,193 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:26,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2028 backedges. 1176 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:26,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:26,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 76 [2018-12-03 15:50:26,992 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:26,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 15:50:26,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 15:50:26,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1376, Invalid=4476, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 15:50:26,994 INFO L87 Difference]: Start difference. First operand 175 states and 177 transitions. Second operand 77 states. [2018-12-03 15:50:28,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:28,839 INFO L93 Difference]: Finished difference Result 375 states and 379 transitions. [2018-12-03 15:50:28,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 15:50:28,840 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 174 [2018-12-03 15:50:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:28,841 INFO L225 Difference]: With dead ends: 375 [2018-12-03 15:50:28,841 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 15:50:28,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 273 SyntacticMatches, 49 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3552 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2401, Invalid=7901, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 15:50:28,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 15:50:28,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2018-12-03 15:50:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 15:50:28,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2018-12-03 15:50:28,877 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 174 [2018-12-03 15:50:28,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:28,877 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2018-12-03 15:50:28,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 15:50:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2018-12-03 15:50:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 15:50:28,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:28,878 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 1, 1, 1, 1, 1] [2018-12-03 15:50:28,878 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:28,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:28,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1003391854, now seen corresponding path program 42 times [2018-12-03 15:50:28,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:28,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:28,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:28,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:31,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:31,478 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:31,478 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:31,478 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:31,478 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:31,478 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 15:50:31,487 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:50:31,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:50:31,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:50:31,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:31,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:33,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:33,141 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:33,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 24 proven. 2077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:33,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:33,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 79 [2018-12-03 15:50:33,340 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:33,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:50:33,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:50:33,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=6110, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:50:33,341 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 80 states. [2018-12-03 15:50:39,803 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-03 15:50:40,218 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-03 15:50:40,624 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2018-12-03 15:50:40,869 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:50:41,108 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:50:41,334 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:50:41,554 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:50:41,768 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:50:43,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:43,973 INFO L93 Difference]: Finished difference Result 379 states and 384 transitions. [2018-12-03 15:50:43,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 15:50:43,973 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 177 [2018-12-03 15:50:43,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:43,974 INFO L225 Difference]: With dead ends: 379 [2018-12-03 15:50:43,975 INFO L226 Difference]: Without dead ends: 281 [2018-12-03 15:50:43,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1061, Invalid=15709, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 15:50:43,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-03 15:50:44,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 182. [2018-12-03 15:50:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 15:50:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2018-12-03 15:50:44,027 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 177 [2018-12-03 15:50:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:44,027 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2018-12-03 15:50:44,027 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:50:44,027 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2018-12-03 15:50:44,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 15:50:44,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:44,028 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1] [2018-12-03 15:50:44,029 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:44,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:44,029 INFO L82 PathProgramCache]: Analyzing trace with hash 525284025, now seen corresponding path program 43 times [2018-12-03 15:50:44,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:44,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:44,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:50:44,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:44,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:45,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:45,341 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:45,341 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:45,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:45,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:45,342 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 15:50:45,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:45,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:50:45,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:45,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:46,520 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:46,520 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:50:47,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2200 backedges. 1275 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:47,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:50:47,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 79 [2018-12-03 15:50:47,384 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:50:47,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 15:50:47,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 15:50:47,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1483, Invalid=4837, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 15:50:47,385 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 80 states. [2018-12-03 15:50:49,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:50:49,361 INFO L93 Difference]: Finished difference Result 390 states and 394 transitions. [2018-12-03 15:50:49,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 15:50:49,361 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 181 [2018-12-03 15:50:49,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:50:49,363 INFO L225 Difference]: With dead ends: 390 [2018-12-03 15:50:49,363 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 15:50:49,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 284 SyntacticMatches, 51 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3850 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2588, Invalid=8542, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 15:50:49,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 15:50:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-12-03 15:50:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-03 15:50:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 187 transitions. [2018-12-03 15:50:49,402 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 187 transitions. Word has length 181 [2018-12-03 15:50:49,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:50:49,402 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 187 transitions. [2018-12-03 15:50:49,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 15:50:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 187 transitions. [2018-12-03 15:50:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-03 15:50:49,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:50:49,403 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 1, 1, 1, 1, 1] [2018-12-03 15:50:49,403 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:50:49,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:50:49,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1479170495, now seen corresponding path program 44 times [2018-12-03 15:50:49,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:50:49,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:49,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:50:49,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:50:49,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:50:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:50:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 25 proven. 2251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:51,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:51,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:50:51,961 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:50:51,961 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:50:51,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:50:51,961 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:50:51,971 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:50:51,972 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:50:52,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 15:50:52,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:50:52,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:50:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1250 proven. 1026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:50:56,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2276 backedges. 1225 proven. 1051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:00,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:00,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 56, 56] total 138 [2018-12-03 15:51:00,661 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:00,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 15:51:00,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 15:51:00,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2093, Invalid=17089, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 15:51:00,663 INFO L87 Difference]: Start difference. First operand 185 states and 187 transitions. Second operand 111 states. [2018-12-03 15:51:18,644 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-03 15:51:19,088 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-03 15:51:19,564 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-03 15:51:19,960 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:51:20,333 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:51:20,688 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:51:21,081 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:51:21,449 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:51:21,755 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:51:24,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:24,896 INFO L93 Difference]: Finished difference Result 496 states and 502 transitions. [2018-12-03 15:51:24,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-12-03 15:51:24,897 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 184 [2018-12-03 15:51:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:24,899 INFO L225 Difference]: With dead ends: 496 [2018-12-03 15:51:24,899 INFO L226 Difference]: Without dead ends: 289 [2018-12-03 15:51:24,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 257 SyntacticMatches, 27 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18831 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=6295, Invalid=80435, Unknown=0, NotChecked=0, Total=86730 [2018-12-03 15:51:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-12-03 15:51:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2018-12-03 15:51:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 15:51:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 194 transitions. [2018-12-03 15:51:24,942 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 194 transitions. Word has length 184 [2018-12-03 15:51:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:24,942 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 194 transitions. [2018-12-03 15:51:24,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 15:51:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 194 transitions. [2018-12-03 15:51:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 15:51:24,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:24,943 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 1, 1, 1, 1, 1] [2018-12-03 15:51:24,943 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:24,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1734936480, now seen corresponding path program 45 times [2018-12-03 15:51:24,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:24,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:24,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:24,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:24,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:27,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:27,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:27,007 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:27,007 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:27,007 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:27,007 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:27,007 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 15:51:27,016 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:51:27,016 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:51:27,046 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:51:27,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:27,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:29,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2458 backedges. 26 proven. 2432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:29,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:29,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 56, 56] total 85 [2018-12-03 15:51:29,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:29,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:51:29,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:51:29,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=7084, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:51:29,390 INFO L87 Difference]: Start difference. First operand 192 states and 194 transitions. Second operand 86 states. [2018-12-03 15:51:38,009 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-03 15:51:38,418 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-03 15:51:38,817 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 133 [2018-12-03 15:51:39,095 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:51:39,360 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:51:39,617 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:51:39,863 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:51:40,093 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:51:40,314 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:51:40,529 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:51:42,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:42,954 INFO L93 Difference]: Finished difference Result 409 states and 414 transitions. [2018-12-03 15:51:42,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 15:51:42,955 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 191 [2018-12-03 15:51:42,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:42,957 INFO L225 Difference]: With dead ends: 409 [2018-12-03 15:51:42,957 INFO L226 Difference]: Without dead ends: 303 [2018-12-03 15:51:42,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 491 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1199, Invalid=18261, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 15:51:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-12-03 15:51:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 196. [2018-12-03 15:51:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 15:51:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 198 transitions. [2018-12-03 15:51:43,002 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 198 transitions. Word has length 191 [2018-12-03 15:51:43,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:43,002 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 198 transitions. [2018-12-03 15:51:43,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:51:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 198 transitions. [2018-12-03 15:51:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 15:51:43,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:43,003 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1] [2018-12-03 15:51:43,004 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:43,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash 2056396679, now seen corresponding path program 46 times [2018-12-03 15:51:43,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:43,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:43,005 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:51:43,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:43,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:44,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:44,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:44,128 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:44,128 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:44,128 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:44,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:44,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 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 15:51:44,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:44,137 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:51:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:44,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:47,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:48,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2565 backedges. 1485 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:48,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:48,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 85 [2018-12-03 15:51:48,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:48,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 15:51:48,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 15:51:48,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=5601, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 15:51:48,836 INFO L87 Difference]: Start difference. First operand 196 states and 198 transitions. Second operand 86 states. [2018-12-03 15:51:51,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:51:51,166 INFO L93 Difference]: Finished difference Result 420 states and 424 transitions. [2018-12-03 15:51:51,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 15:51:51,166 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 195 [2018-12-03 15:51:51,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:51:51,168 INFO L225 Difference]: With dead ends: 420 [2018-12-03 15:51:51,168 INFO L226 Difference]: Without dead ends: 201 [2018-12-03 15:51:51,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 306 SyntacticMatches, 55 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4482 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=2983, Invalid=9899, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 15:51:51,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-12-03 15:51:51,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-12-03 15:51:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-03 15:51:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 201 transitions. [2018-12-03 15:51:51,215 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 201 transitions. Word has length 195 [2018-12-03 15:51:51,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:51:51,215 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 201 transitions. [2018-12-03 15:51:51,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 15:51:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 201 transitions. [2018-12-03 15:51:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-03 15:51:51,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:51:51,216 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 1, 1, 1, 1, 1] [2018-12-03 15:51:51,216 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:51:51,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:51:51,217 INFO L82 PathProgramCache]: Analyzing trace with hash -303839985, now seen corresponding path program 47 times [2018-12-03 15:51:51,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:51:51,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:51,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:51:51,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:51:51,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:51:51,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:51:53,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:53,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:53,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:51:53,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:51:53,364 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:51:53,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:51:53,364 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 15:51:53,373 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:51:53,373 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:51:53,427 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 15:51:53,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:51:53,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:51:55,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:55,411 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:51:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2647 backedges. 27 proven. 2620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:51:55,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:51:55,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 88 [2018-12-03 15:51:55,620 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:51:55,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 15:51:55,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 15:51:55,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=7598, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:51:55,622 INFO L87 Difference]: Start difference. First operand 199 states and 201 transitions. Second operand 89 states. [2018-12-03 15:52:04,260 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-03 15:52:04,688 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-03 15:52:05,099 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 138 [2018-12-03 15:52:05,385 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-03 15:52:05,669 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:52:05,961 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:52:06,210 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:52:06,453 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:52:06,680 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:52:06,902 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:52:07,169 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:52:07,415 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-03 15:52:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:09,592 INFO L93 Difference]: Finished difference Result 424 states and 429 transitions. [2018-12-03 15:52:09,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-03 15:52:09,592 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 198 [2018-12-03 15:52:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:09,594 INFO L225 Difference]: With dead ends: 424 [2018-12-03 15:52:09,594 INFO L226 Difference]: Without dead ends: 314 [2018-12-03 15:52:09,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 363 SyntacticMatches, 3 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3314 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1271, Invalid=19609, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 15:52:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-03 15:52:09,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 203. [2018-12-03 15:52:09,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 15:52:09,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2018-12-03 15:52:09,649 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 198 [2018-12-03 15:52:09,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:09,650 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2018-12-03 15:52:09,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 15:52:09,650 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2018-12-03 15:52:09,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-03 15:52:09,651 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:09,651 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1] [2018-12-03 15:52:09,651 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:09,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:09,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1908736842, now seen corresponding path program 48 times [2018-12-03 15:52:09,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:09,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:09,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:09,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:09,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:11,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:11,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:11,066 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:11,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:11,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:11,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 15:52:11,074 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:11,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:11,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:11,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:11,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:12,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:12,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2758 backedges. 1596 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:13,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:13,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 88 [2018-12-03 15:52:13,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:13,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 15:52:13,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 15:52:13,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1828, Invalid=6004, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 15:52:13,965 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand 89 states. [2018-12-03 15:52:16,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:16,403 INFO L93 Difference]: Finished difference Result 435 states and 439 transitions. [2018-12-03 15:52:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 15:52:16,403 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 202 [2018-12-03 15:52:16,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:16,405 INFO L225 Difference]: With dead ends: 435 [2018-12-03 15:52:16,405 INFO L226 Difference]: Without dead ends: 208 [2018-12-03 15:52:16,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 317 SyntacticMatches, 57 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4816 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3191, Invalid=10615, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 15:52:16,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-12-03 15:52:16,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2018-12-03 15:52:16,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-12-03 15:52:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2018-12-03 15:52:16,461 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 202 [2018-12-03 15:52:16,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:16,462 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2018-12-03 15:52:16,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 15:52:16,462 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2018-12-03 15:52:16,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-12-03 15:52:16,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:16,463 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 1, 1, 1, 1, 1] [2018-12-03 15:52:16,463 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:16,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1062571566, now seen corresponding path program 49 times [2018-12-03 15:52:16,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:16,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:16,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:16,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:16,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:18,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:18,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:18,814 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:18,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:18,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:18,814 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 15:52:18,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:18,824 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:52:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:18,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:21,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:21,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2843 backedges. 28 proven. 2815 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:21,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:21,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 91 [2018-12-03 15:52:21,253 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:21,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 15:52:21,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 15:52:21,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=8130, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:52:21,255 INFO L87 Difference]: Start difference. First operand 206 states and 208 transitions. Second operand 92 states. [2018-12-03 15:52:30,516 WARN L180 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-12-03 15:52:30,958 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-12-03 15:52:31,396 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 143 [2018-12-03 15:52:31,705 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-03 15:52:32,005 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-03 15:52:32,310 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:52:32,591 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:52:32,935 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:52:33,194 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:52:33,443 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:52:33,683 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:52:33,923 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:52:36,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:36,412 INFO L93 Difference]: Finished difference Result 439 states and 444 transitions. [2018-12-03 15:52:36,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-12-03 15:52:36,412 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 205 [2018-12-03 15:52:36,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:36,414 INFO L225 Difference]: With dead ends: 439 [2018-12-03 15:52:36,415 INFO L226 Difference]: Without dead ends: 325 [2018-12-03 15:52:36,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 376 SyntacticMatches, 3 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3548 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1345, Invalid=21005, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:52:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-12-03 15:52:36,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 210. [2018-12-03 15:52:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-12-03 15:52:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 212 transitions. [2018-12-03 15:52:36,471 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 212 transitions. Word has length 205 [2018-12-03 15:52:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:36,472 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 212 transitions. [2018-12-03 15:52:36,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 15:52:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 212 transitions. [2018-12-03 15:52:36,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-12-03 15:52:36,473 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:36,473 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1] [2018-12-03 15:52:36,473 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:36,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:36,474 INFO L82 PathProgramCache]: Analyzing trace with hash -782950827, now seen corresponding path program 50 times [2018-12-03 15:52:36,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:36,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:36,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:52:36,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:36,475 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:37,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:37,717 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:37,717 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:37,718 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:52:37,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:37,718 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 15:52:37,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:52:37,726 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:52:37,798 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 15:52:37,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:37,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:39,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 2958 backedges. 1711 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:40,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:40,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 91 [2018-12-03 15:52:40,635 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:40,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 15:52:40,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 15:52:40,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1951, Invalid=6421, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 15:52:40,636 INFO L87 Difference]: Start difference. First operand 210 states and 212 transitions. Second operand 92 states. [2018-12-03 15:52:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:52:43,528 INFO L93 Difference]: Finished difference Result 450 states and 454 transitions. [2018-12-03 15:52:43,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 15:52:43,528 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 209 [2018-12-03 15:52:43,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:52:43,530 INFO L225 Difference]: With dead ends: 450 [2018-12-03 15:52:43,530 INFO L226 Difference]: Without dead ends: 215 [2018-12-03 15:52:43,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 328 SyntacticMatches, 59 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5162 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=3406, Invalid=11356, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 15:52:43,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-03 15:52:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-12-03 15:52:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 15:52:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 215 transitions. [2018-12-03 15:52:43,585 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 215 transitions. Word has length 209 [2018-12-03 15:52:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:52:43,585 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 215 transitions. [2018-12-03 15:52:43,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 15:52:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 215 transitions. [2018-12-03 15:52:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 15:52:43,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:52:43,586 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 1, 1, 1, 1, 1] [2018-12-03 15:52:43,587 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:52:43,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:52:43,587 INFO L82 PathProgramCache]: Analyzing trace with hash -890079779, now seen corresponding path program 51 times [2018-12-03 15:52:43,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:52:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:43,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:52:43,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:52:43,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:52:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:52:45,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:45,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:45,739 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:52:45,739 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:52:45,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 15:52:45,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:52:45,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 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 15:52:45,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:52:45,749 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:52:45,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:52:45,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:52:45,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:52:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:48,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:52:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3046 backedges. 29 proven. 3017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:52:48,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:52:48,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 62, 62] total 94 [2018-12-03 15:52:48,919 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:52:48,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 15:52:48,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 15:52:48,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=8680, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:52:48,920 INFO L87 Difference]: Start difference. First operand 213 states and 215 transitions. Second operand 95 states. [2018-12-03 15:52:59,495 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-12-03 15:52:59,958 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-12-03 15:53:00,411 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 148 [2018-12-03 15:53:00,740 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-03 15:53:01,050 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-03 15:53:01,373 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-03 15:53:01,663 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:53:01,942 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:53:02,221 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:53:02,477 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:53:02,733 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:53:02,982 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:53:03,219 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:53:03,523 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-03 15:53:05,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:05,876 INFO L93 Difference]: Finished difference Result 454 states and 459 transitions. [2018-12-03 15:53:05,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 15:53:05,876 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 212 [2018-12-03 15:53:05,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:05,878 INFO L225 Difference]: With dead ends: 454 [2018-12-03 15:53:05,878 INFO L226 Difference]: Without dead ends: 336 [2018-12-03 15:53:05,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 389 SyntacticMatches, 3 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3790 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=1421, Invalid=22449, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 15:53:05,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-12-03 15:53:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 217. [2018-12-03 15:53:05,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-03 15:53:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 219 transitions. [2018-12-03 15:53:05,938 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 219 transitions. Word has length 212 [2018-12-03 15:53:05,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:05,938 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 219 transitions. [2018-12-03 15:53:05,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 15:53:05,938 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 219 transitions. [2018-12-03 15:53:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-03 15:53:05,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:05,939 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1] [2018-12-03 15:53:05,939 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:05,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:05,939 INFO L82 PathProgramCache]: Analyzing trace with hash -272066940, now seen corresponding path program 52 times [2018-12-03 15:53:05,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:05,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:05,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:53:05,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:05,940 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:07,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,203 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:07,203 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:07,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 15:53:07,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:07,204 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 15:53:07,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:07,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:53:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:07,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:09,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:10,284 INFO L134 CoverageAnalysis]: Checked inductivity of 3165 backedges. 1830 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:10,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:10,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 94 [2018-12-03 15:53:10,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:10,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 15:53:10,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 15:53:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2078, Invalid=6852, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 15:53:10,304 INFO L87 Difference]: Start difference. First operand 217 states and 219 transitions. Second operand 95 states. [2018-12-03 15:53:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:53:13,093 INFO L93 Difference]: Finished difference Result 465 states and 469 transitions. [2018-12-03 15:53:13,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 15:53:13,094 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 216 [2018-12-03 15:53:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:53:13,095 INFO L225 Difference]: With dead ends: 465 [2018-12-03 15:53:13,095 INFO L226 Difference]: Without dead ends: 222 [2018-12-03 15:53:13,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 524 GetRequests, 339 SyntacticMatches, 61 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5520 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=3628, Invalid=12122, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 15:53:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-12-03 15:53:13,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-12-03 15:53:13,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-03 15:53:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 222 transitions. [2018-12-03 15:53:13,146 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 222 transitions. Word has length 216 [2018-12-03 15:53:13,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:53:13,147 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 222 transitions. [2018-12-03 15:53:13,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 15:53:13,147 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 222 transitions. [2018-12-03 15:53:13,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-03 15:53:13,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:53:13,148 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 1, 1, 1, 1, 1] [2018-12-03 15:53:13,148 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:53:13,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:53:13,148 INFO L82 PathProgramCache]: Analyzing trace with hash 292238844, now seen corresponding path program 53 times [2018-12-03 15:53:13,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:53:13,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:13,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:53:13,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:53:13,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:53:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:53:15,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 30 proven. 3226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:15,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:15,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:53:15,729 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:53:15,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:53:15,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:53:15,730 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 15:53:15,738 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:53:15,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:53:15,801 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 15:53:15,802 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:53:15,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:53:21,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1800 proven. 1456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:21,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:53:27,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3256 backedges. 1770 proven. 1486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:53:27,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:53:27,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 66, 66] total 163 [2018-12-03 15:53:27,612 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:53:27,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-03 15:53:27,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-03 15:53:27,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2878, Invalid=23854, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 15:53:27,614 INFO L87 Difference]: Start difference. First operand 220 states and 222 transitions. Second operand 131 states. [2018-12-03 15:53:52,192 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-03 15:53:52,761 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-03 15:53:53,365 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 153 [2018-12-03 15:53:53,893 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 15:53:54,383 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-03 15:53:54,940 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-03 15:53:55,409 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-03 15:53:55,860 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:53:56,317 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:53:56,739 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:53:57,140 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:53:57,536 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:53:57,909 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:53:58,299 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:54:02,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:02,037 INFO L93 Difference]: Finished difference Result 591 states and 597 transitions. [2018-12-03 15:54:02,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-12-03 15:54:02,037 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 219 [2018-12-03 15:54:02,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:02,038 INFO L225 Difference]: With dead ends: 591 [2018-12-03 15:54:02,039 INFO L226 Difference]: Without dead ends: 344 [2018-12-03 15:54:02,042 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 307 SyntacticMatches, 32 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26556 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=8585, Invalid=113565, Unknown=0, NotChecked=0, Total=122150 [2018-12-03 15:54:02,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-12-03 15:54:02,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 227. [2018-12-03 15:54:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 15:54:02,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 229 transitions. [2018-12-03 15:54:02,095 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 229 transitions. Word has length 219 [2018-12-03 15:54:02,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:02,095 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 229 transitions. [2018-12-03 15:54:02,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-03 15:54:02,095 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 229 transitions. [2018-12-03 15:54:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-03 15:54:02,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:02,097 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 1, 1, 1, 1, 1] [2018-12-03 15:54:02,097 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:02,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:02,097 INFO L82 PathProgramCache]: Analyzing trace with hash 2116008107, now seen corresponding path program 54 times [2018-12-03 15:54:02,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:02,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:02,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:02,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:04,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:04,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:04,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:04,552 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:04,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:04,552 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 15:54:04,562 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:54:04,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:54:04,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:54:04,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:04,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:07,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:07,360 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:07,583 INFO L134 CoverageAnalysis]: Checked inductivity of 3473 backedges. 31 proven. 3442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:07,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:07,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 100 [2018-12-03 15:54:07,603 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:07,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 15:54:07,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 15:54:07,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=9834, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:54:07,605 INFO L87 Difference]: Start difference. First operand 227 states and 229 transitions. Second operand 101 states. [2018-12-03 15:54:20,598 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-03 15:54:21,103 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-03 15:54:21,605 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 158 [2018-12-03 15:54:21,960 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-03 15:54:22,297 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 15:54:22,635 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-03 15:54:22,965 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-03 15:54:23,281 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-03 15:54:23,588 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:54:23,886 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:54:24,179 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:54:24,461 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:54:24,730 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:54:24,999 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:54:25,250 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:54:25,524 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-03 15:54:27,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:27,972 INFO L93 Difference]: Finished difference Result 484 states and 489 transitions. [2018-12-03 15:54:27,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-03 15:54:27,972 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 226 [2018-12-03 15:54:27,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:27,974 INFO L225 Difference]: With dead ends: 484 [2018-12-03 15:54:27,974 INFO L226 Difference]: Without dead ends: 358 [2018-12-03 15:54:27,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 581 GetRequests, 415 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=1579, Invalid=25481, Unknown=0, NotChecked=0, Total=27060 [2018-12-03 15:54:27,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-12-03 15:54:28,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 231. [2018-12-03 15:54:28,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-12-03 15:54:28,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 233 transitions. [2018-12-03 15:54:28,036 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 233 transitions. Word has length 226 [2018-12-03 15:54:28,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:28,036 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 233 transitions. [2018-12-03 15:54:28,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 15:54:28,036 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 233 transitions. [2018-12-03 15:54:28,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-12-03 15:54:28,038 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:28,038 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1] [2018-12-03 15:54:28,038 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:28,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:28,038 INFO L82 PathProgramCache]: Analyzing trace with hash -237256110, now seen corresponding path program 55 times [2018-12-03 15:54:28,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:28,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:28,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:54:28,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:28,039 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:29,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:29,570 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:29,570 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:29,570 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:29,570 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:29,570 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 15:54:29,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:29,579 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:54:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:29,626 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:31,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:31,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:33,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 2080 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:33,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:33,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 100 [2018-12-03 15:54:33,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:33,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 15:54:33,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 15:54:33,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2344, Invalid=7756, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 15:54:33,290 INFO L87 Difference]: Start difference. First operand 231 states and 233 transitions. Second operand 101 states. [2018-12-03 15:54:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:54:35,685 INFO L93 Difference]: Finished difference Result 495 states and 499 transitions. [2018-12-03 15:54:35,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 15:54:35,685 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 230 [2018-12-03 15:54:35,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:54:35,686 INFO L225 Difference]: With dead ends: 495 [2018-12-03 15:54:35,686 INFO L226 Difference]: Without dead ends: 236 [2018-12-03 15:54:35,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 361 SyntacticMatches, 65 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6272 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=4093, Invalid=13729, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 15:54:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-12-03 15:54:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-12-03 15:54:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-12-03 15:54:35,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 236 transitions. [2018-12-03 15:54:35,765 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 236 transitions. Word has length 230 [2018-12-03 15:54:35,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:54:35,766 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 236 transitions. [2018-12-03 15:54:35,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 15:54:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 236 transitions. [2018-12-03 15:54:35,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-12-03 15:54:35,767 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:54:35,767 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 1, 1, 1, 1, 1] [2018-12-03 15:54:35,767 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:54:35,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:54:35,768 INFO L82 PathProgramCache]: Analyzing trace with hash -170528822, now seen corresponding path program 56 times [2018-12-03 15:54:35,768 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:54:35,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:35,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:54:35,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:54:35,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:54:35,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:54:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 32 proven. 3665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:38,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:38,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:54:38,359 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:54:38,359 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:54:38,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:54:38,359 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 15:54:38,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:54:38,369 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:54:38,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 15:54:38,452 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:54:38,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:54:45,173 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2048 proven. 1649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:45,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:54:51,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3697 backedges. 2016 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:54:51,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:54:51,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 70, 70] total 173 [2018-12-03 15:54:51,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:54:51,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-12-03 15:54:51,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-12-03 15:54:51,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3227, Invalid=26875, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 15:54:51,867 INFO L87 Difference]: Start difference. First operand 234 states and 236 transitions. Second operand 139 states. [2018-12-03 15:55:17,662 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-12-03 15:55:18,262 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-12-03 15:55:18,907 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-03 15:55:19,471 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-03 15:55:20,037 WARN L180 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-03 15:55:20,565 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 15:55:21,091 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-03 15:55:21,606 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-03 15:55:22,127 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-03 15:55:22,622 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:55:23,081 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:55:23,530 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:55:23,946 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:55:24,351 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:55:24,764 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:55:25,131 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:55:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:29,079 INFO L93 Difference]: Finished difference Result 629 states and 635 transitions. [2018-12-03 15:55:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-12-03 15:55:29,080 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 233 [2018-12-03 15:55:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:29,082 INFO L225 Difference]: With dead ends: 629 [2018-12-03 15:55:29,082 INFO L226 Difference]: Without dead ends: 366 [2018-12-03 15:55:29,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 327 SyntacticMatches, 34 SemanticMatches, 370 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30017 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=9599, Invalid=128413, Unknown=0, NotChecked=0, Total=138012 [2018-12-03 15:55:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-12-03 15:55:29,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 241. [2018-12-03 15:55:29,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-03 15:55:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 243 transitions. [2018-12-03 15:55:29,146 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 243 transitions. Word has length 233 [2018-12-03 15:55:29,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:29,147 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 243 transitions. [2018-12-03 15:55:29,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-12-03 15:55:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 243 transitions. [2018-12-03 15:55:29,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-03 15:55:29,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:29,148 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 1, 1, 1, 1, 1] [2018-12-03 15:55:29,148 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:29,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1552518521, now seen corresponding path program 57 times [2018-12-03 15:55:29,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:29,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:29,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:29,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:29,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:31,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:31,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:31,810 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:31,810 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:31,811 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:31,811 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:31,811 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 15:55:31,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:55:31,824 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:55:31,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:55:31,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:55:31,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:55:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:34,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:55:35,187 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 33 proven. 3895 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:35,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:55:35,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 70, 70] total 106 [2018-12-03 15:55:35,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:55:35,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 15:55:35,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 15:55:35,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=11060, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:55:35,207 INFO L87 Difference]: Start difference. First operand 241 states and 243 transitions. Second operand 107 states. [2018-12-03 15:55:47,268 WARN L180 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-12-03 15:55:47,935 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-12-03 15:55:48,500 WARN L180 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2018-12-03 15:55:48,883 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-03 15:55:49,254 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-03 15:55:49,623 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-03 15:55:49,982 WARN L180 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 15:55:50,331 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-03 15:55:50,679 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-03 15:55:51,015 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-03 15:55:51,349 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:55:51,661 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:55:51,959 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:55:52,251 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:55:52,616 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:55:52,887 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:55:53,149 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:55:56,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:55:56,003 INFO L93 Difference]: Finished difference Result 514 states and 519 transitions. [2018-12-03 15:55:56,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-12-03 15:55:56,004 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 240 [2018-12-03 15:55:56,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:55:56,006 INFO L225 Difference]: With dead ends: 514 [2018-12-03 15:55:56,006 INFO L226 Difference]: Without dead ends: 380 [2018-12-03 15:55:56,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 441 SyntacticMatches, 3 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4838 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=1745, Invalid=28705, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 15:55:56,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-12-03 15:55:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 245. [2018-12-03 15:55:56,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-03 15:55:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 247 transitions. [2018-12-03 15:55:56,071 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 247 transitions. Word has length 240 [2018-12-03 15:55:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:55:56,071 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 247 transitions. [2018-12-03 15:55:56,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 15:55:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 247 transitions. [2018-12-03 15:55:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-03 15:55:56,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:55:56,072 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1] [2018-12-03 15:55:56,072 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:55:56,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:55:56,072 INFO L82 PathProgramCache]: Analyzing trace with hash 714244128, now seen corresponding path program 58 times [2018-12-03 15:55:56,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:55:56,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:56,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:55:56,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:55:56,073 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:55:56,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:58,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:55:58,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:58,018 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:55:58,018 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:55:58,018 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:55:58,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:55:58,019 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 15:55:58,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:55:58,027 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:55:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:55:58,075 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:00,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:00,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4063 backedges. 2346 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:01,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:01,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 106 [2018-12-03 15:56:01,500 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:01,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 15:56:01,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 15:56:01,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=8716, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 15:56:01,502 INFO L87 Difference]: Start difference. First operand 245 states and 247 transitions. Second operand 107 states. [2018-12-03 15:56:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:56:04,291 INFO L93 Difference]: Finished difference Result 525 states and 529 transitions. [2018-12-03 15:56:04,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 15:56:04,292 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 244 [2018-12-03 15:56:04,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:56:04,293 INFO L225 Difference]: With dead ends: 525 [2018-12-03 15:56:04,294 INFO L226 Difference]: Without dead ends: 250 [2018-12-03 15:56:04,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 592 GetRequests, 383 SyntacticMatches, 69 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7072 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=4586, Invalid=15436, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 15:56:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-03 15:56:04,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-12-03 15:56:04,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-03 15:56:04,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 250 transitions. [2018-12-03 15:56:04,368 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 250 transitions. Word has length 244 [2018-12-03 15:56:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:56:04,368 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 250 transitions. [2018-12-03 15:56:04,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 15:56:04,369 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 250 transitions. [2018-12-03 15:56:04,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-12-03 15:56:04,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:56:04,370 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 1, 1, 1, 1, 1] [2018-12-03 15:56:04,370 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:56:04,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:56:04,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1637071768, now seen corresponding path program 59 times [2018-12-03 15:56:04,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:56:04,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:04,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:56:04,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:56:04,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:56:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:56:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 34 proven. 4132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:07,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:07,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:56:07,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:56:07,172 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:56:07,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:56:07,172 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 15:56:07,181 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:56:07,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:56:07,254 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 15:56:07,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:56:07,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:56:15,211 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2312 proven. 1854 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:15,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:56:22,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4166 backedges. 2278 proven. 1888 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:56:22,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:56:22,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 74, 74] total 183 [2018-12-03 15:56:22,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:56:22,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-12-03 15:56:22,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-12-03 15:56:22,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3596, Invalid=30076, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 15:56:22,425 INFO L87 Difference]: Start difference. First operand 248 states and 250 transitions. Second operand 147 states. [2018-12-03 15:56:50,785 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-12-03 15:56:51,454 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-12-03 15:56:52,126 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 173 [2018-12-03 15:56:52,754 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-03 15:56:53,368 WARN L180 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-03 15:56:54,037 WARN L180 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-03 15:56:54,630 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-03 15:56:55,188 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 15:56:55,718 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-03 15:56:56,263 WARN L180 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-03 15:56:56,759 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-03 15:56:57,254 WARN L180 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:56:57,745 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:56:58,236 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:56:58,682 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:56:59,187 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:56:59,596 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:56:59,975 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:57:00,367 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-03 15:57:04,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:04,005 INFO L93 Difference]: Finished difference Result 667 states and 673 transitions. [2018-12-03 15:57:04,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 247 states. [2018-12-03 15:57:04,005 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 247 [2018-12-03 15:57:04,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:04,007 INFO L225 Difference]: With dead ends: 667 [2018-12-03 15:57:04,007 INFO L226 Difference]: Without dead ends: 388 [2018-12-03 15:57:04,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 775 GetRequests, 347 SyntacticMatches, 36 SemanticMatches, 392 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33690 ImplicationChecksByTransitivity, 50.0s TimeCoverageRelationStatistics Valid=10669, Invalid=144173, Unknown=0, NotChecked=0, Total=154842 [2018-12-03 15:57:04,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-12-03 15:57:04,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 255. [2018-12-03 15:57:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-12-03 15:57:04,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 257 transitions. [2018-12-03 15:57:04,081 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 257 transitions. Word has length 247 [2018-12-03 15:57:04,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:04,081 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 257 transitions. [2018-12-03 15:57:04,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-12-03 15:57:04,081 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 257 transitions. [2018-12-03 15:57:04,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-12-03 15:57:04,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:04,082 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 1, 1, 1, 1, 1] [2018-12-03 15:57:04,082 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:04,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:04,082 INFO L82 PathProgramCache]: Analyzing trace with hash -783420345, now seen corresponding path program 60 times [2018-12-03 15:57:04,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:04,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:04,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:04,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:04,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:07,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:07,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:07,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:07,230 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:07,231 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:07,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:07,231 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 15:57:07,240 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:57:07,240 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:57:07,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:57:07,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:07,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:10,744 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 4411 backedges. 35 proven. 4376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:11,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:11,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 74, 74] total 112 [2018-12-03 15:57:11,029 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:11,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 15:57:11,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 15:57:11,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=12358, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:57:11,031 INFO L87 Difference]: Start difference. First operand 255 states and 257 transitions. Second operand 113 states. [2018-12-03 15:57:25,468 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-12-03 15:57:26,058 WARN L180 SmtUtils]: Spent 244.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-12-03 15:57:26,645 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 178 [2018-12-03 15:57:27,065 WARN L180 SmtUtils]: Spent 228.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2018-12-03 15:57:27,480 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-03 15:57:27,875 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-03 15:57:28,275 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-03 15:57:28,671 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-03 15:57:29,043 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 15:57:29,410 WARN L180 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-03 15:57:29,812 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-03 15:57:30,160 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-03 15:57:30,491 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:57:30,833 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:57:31,150 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:57:31,454 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:57:31,752 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:57:32,031 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:57:32,300 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:57:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:35,432 INFO L93 Difference]: Finished difference Result 544 states and 549 transitions. [2018-12-03 15:57:35,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-12-03 15:57:35,432 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 254 [2018-12-03 15:57:35,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:35,434 INFO L225 Difference]: With dead ends: 544 [2018-12-03 15:57:35,434 INFO L226 Difference]: Without dead ends: 402 [2018-12-03 15:57:35,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 653 GetRequests, 467 SyntacticMatches, 3 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5410 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=1919, Invalid=32121, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 15:57:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-12-03 15:57:35,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 259. [2018-12-03 15:57:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-03 15:57:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 261 transitions. [2018-12-03 15:57:35,507 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 261 transitions. Word has length 254 [2018-12-03 15:57:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:35,507 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 261 transitions. [2018-12-03 15:57:35,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 15:57:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 261 transitions. [2018-12-03 15:57:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-03 15:57:35,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:35,509 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1] [2018-12-03 15:57:35,509 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:35,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:35,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1175113710, now seen corresponding path program 61 times [2018-12-03 15:57:35,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:35,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:57:35,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:35,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:37,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:37,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:37,271 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:37,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:37,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:37,271 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 15:57:37,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:37,280 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:57:37,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:37,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:39,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:57:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 4554 backedges. 2628 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:41,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:57:41,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 112 [2018-12-03 15:57:41,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:57:41,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 15:57:41,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 15:57:41,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2924, Invalid=9732, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 15:57:41,425 INFO L87 Difference]: Start difference. First operand 259 states and 261 transitions. Second operand 113 states. [2018-12-03 15:57:44,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:57:44,390 INFO L93 Difference]: Finished difference Result 555 states and 559 transitions. [2018-12-03 15:57:44,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 15:57:44,390 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 258 [2018-12-03 15:57:44,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:57:44,392 INFO L225 Difference]: With dead ends: 555 [2018-12-03 15:57:44,392 INFO L226 Difference]: Without dead ends: 264 [2018-12-03 15:57:44,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 405 SyntacticMatches, 73 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7920 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=5107, Invalid=17243, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 15:57:44,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-12-03 15:57:44,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2018-12-03 15:57:44,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-03 15:57:44,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 264 transitions. [2018-12-03 15:57:44,464 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 264 transitions. Word has length 258 [2018-12-03 15:57:44,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:57:44,464 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 264 transitions. [2018-12-03 15:57:44,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 15:57:44,464 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 264 transitions. [2018-12-03 15:57:44,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-03 15:57:44,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:57:44,465 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 1, 1, 1, 1, 1] [2018-12-03 15:57:44,466 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:57:44,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:57:44,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1470273894, now seen corresponding path program 62 times [2018-12-03 15:57:44,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:57:44,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:44,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:57:44,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:57:44,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:57:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:57:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 36 proven. 4627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:48,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:48,026 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:57:48,026 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:57:48,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:57:48,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:57:48,026 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 15:57:48,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:57:48,035 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:57:48,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 15:57:48,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:57:48,180 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:57:56,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2592 proven. 2071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:57:56,947 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:58:04,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4663 backedges. 2556 proven. 2107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:04,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:58:04,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 78, 78] total 193 [2018-12-03 15:58:04,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:58:04,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-12-03 15:58:04,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-12-03 15:58:04,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3985, Invalid=33457, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 15:58:04,929 INFO L87 Difference]: Start difference. First operand 262 states and 264 transitions. Second operand 155 states. [2018-12-03 15:58:37,164 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-03 15:58:37,916 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-03 15:58:38,678 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2018-12-03 15:58:39,348 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-12-03 15:58:40,032 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2018-12-03 15:58:40,693 WARN L180 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-03 15:58:41,355 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-03 15:58:41,978 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-03 15:58:42,591 WARN L180 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-03 15:58:43,176 WARN L180 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 15:58:43,745 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-03 15:58:44,301 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-03 15:58:44,851 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-03 15:58:45,373 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:58:45,884 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:58:46,420 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:58:46,945 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:58:47,393 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:58:47,822 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:58:48,232 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:58:52,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:58:52,622 INFO L93 Difference]: Finished difference Result 705 states and 711 transitions. [2018-12-03 15:58:52,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 261 states. [2018-12-03 15:58:52,622 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 261 [2018-12-03 15:58:52,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:58:52,625 INFO L225 Difference]: With dead ends: 705 [2018-12-03 15:58:52,625 INFO L226 Difference]: Without dead ends: 410 [2018-12-03 15:58:52,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 819 GetRequests, 367 SyntacticMatches, 38 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37575 ImplicationChecksByTransitivity, 56.8s TimeCoverageRelationStatistics Valid=11795, Invalid=160845, Unknown=0, NotChecked=0, Total=172640 [2018-12-03 15:58:52,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-12-03 15:58:52,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 269. [2018-12-03 15:58:52,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-03 15:58:52,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 271 transitions. [2018-12-03 15:58:52,712 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 271 transitions. Word has length 261 [2018-12-03 15:58:52,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:58:52,713 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 271 transitions. [2018-12-03 15:58:52,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-12-03 15:58:52,713 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 271 transitions. [2018-12-03 15:58:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-03 15:58:52,714 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:58:52,714 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 1, 1, 1, 1, 1] [2018-12-03 15:58:52,714 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:58:52,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:58:52,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1569385749, now seen corresponding path program 63 times [2018-12-03 15:58:52,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:58:52,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:52,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:58:52,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:58:52,716 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:58:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:58:56,042 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:56,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:56,043 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:58:56,043 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:58:56,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:58:56,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:58:56,043 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 15:58:56,052 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:58:56,052 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:58:56,097 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:58:56,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:58:56,103 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:58:59,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:58:59,958 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4922 backedges. 37 proven. 4885 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:00,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:00,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 78, 78] total 118 [2018-12-03 15:59:00,261 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:00,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-03 15:59:00,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-03 15:59:00,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=13728, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:59:00,262 INFO L87 Difference]: Start difference. First operand 269 states and 271 transitions. Second operand 119 states. [2018-12-03 15:59:16,920 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2018-12-03 15:59:17,624 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 193 [2018-12-03 15:59:18,261 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 188 [2018-12-03 15:59:18,713 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-12-03 15:59:19,167 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 179 [2018-12-03 15:59:19,607 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 174 [2018-12-03 15:59:20,041 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 169 [2018-12-03 15:59:20,466 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 164 [2018-12-03 15:59:20,868 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 159 [2018-12-03 15:59:21,258 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 154 [2018-12-03 15:59:21,666 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 15:59:22,043 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 144 [2018-12-03 15:59:22,470 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2018-12-03 15:59:22,843 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2018-12-03 15:59:23,188 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2018-12-03 15:59:23,527 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 15:59:23,857 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 15:59:24,187 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 15:59:24,491 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2018-12-03 15:59:24,790 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-12-03 15:59:25,079 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2018-12-03 15:59:28,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:28,347 INFO L93 Difference]: Finished difference Result 574 states and 579 transitions. [2018-12-03 15:59:28,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-12-03 15:59:28,347 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 268 [2018-12-03 15:59:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:28,349 INFO L225 Difference]: With dead ends: 574 [2018-12-03 15:59:28,349 INFO L226 Difference]: Without dead ends: 424 [2018-12-03 15:59:28,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 493 SyntacticMatches, 3 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6014 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=2101, Invalid=35729, Unknown=0, NotChecked=0, Total=37830 [2018-12-03 15:59:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-03 15:59:28,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2018-12-03 15:59:28,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-03 15:59:28,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 275 transitions. [2018-12-03 15:59:28,443 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 275 transitions. Word has length 268 [2018-12-03 15:59:28,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:28,444 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 275 transitions. [2018-12-03 15:59:28,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-03 15:59:28,444 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 275 transitions. [2018-12-03 15:59:28,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-03 15:59:28,445 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:28,445 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1] [2018-12-03 15:59:28,445 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:28,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:28,445 INFO L82 PathProgramCache]: Analyzing trace with hash 107131324, now seen corresponding path program 64 times [2018-12-03 15:59:28,445 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:28,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:28,446 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:59:28,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:28,446 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:30,402 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:30,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:30,402 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:30,402 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:30,402 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:30,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:30,402 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 15:59:30,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:30,412 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:59:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:30,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:59:33,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:33,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:59:35,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5073 backedges. 2926 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:35,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:59:35,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 118 [2018-12-03 15:59:35,027 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:59:35,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-03 15:59:35,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-03 15:59:35,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3238, Invalid=10804, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 15:59:35,028 INFO L87 Difference]: Start difference. First operand 273 states and 275 transitions. Second operand 119 states. [2018-12-03 15:59:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:59:38,539 INFO L93 Difference]: Finished difference Result 585 states and 589 transitions. [2018-12-03 15:59:38,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 15:59:38,540 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 272 [2018-12-03 15:59:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:59:38,541 INFO L225 Difference]: With dead ends: 585 [2018-12-03 15:59:38,542 INFO L226 Difference]: Without dead ends: 278 [2018-12-03 15:59:38,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 660 GetRequests, 427 SyntacticMatches, 77 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8816 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=5656, Invalid=19150, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 15:59:38,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-03 15:59:38,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-12-03 15:59:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-12-03 15:59:38,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 278 transitions. [2018-12-03 15:59:38,629 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 278 transitions. Word has length 272 [2018-12-03 15:59:38,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:59:38,630 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 278 transitions. [2018-12-03 15:59:38,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-03 15:59:38,630 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 278 transitions. [2018-12-03 15:59:38,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-12-03 15:59:38,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:59:38,631 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 38, 38, 38, 1, 1, 1, 1, 1] [2018-12-03 15:59:38,631 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:59:38,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:59:38,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1761642804, now seen corresponding path program 65 times [2018-12-03 15:59:38,631 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:59:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:38,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:59:38,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:59:38,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:59:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:59:42,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5188 backedges. 38 proven. 5150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:59:42,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:42,079 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:59:42,079 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:59:42,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:59:42,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:59:42,079 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 15:59:42,088 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:59:42,088 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:59:42,175 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 15:59:42,175 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:59:42,180 INFO L273 TraceCheckSpWp]: Computing forward predicates...