java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:55:48,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:55:48,725 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:55:48,743 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:55:48,744 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:55:48,745 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:55:48,747 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:55:48,749 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:55:48,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:55:48,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:55:48,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:55:48,761 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:55:48,763 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:55:48,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:55:48,767 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:55:48,768 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:55:48,769 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:55:48,772 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:55:48,777 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:55:48,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:55:48,783 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:55:48,785 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:55:48,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:55:48,789 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:55:48,789 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:55:48,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:55:48,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:55:48,794 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:55:48,796 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:55:48,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:55:48,797 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:55:48,799 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:55:48,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:55:48,799 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:55:48,800 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:55:48,801 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:55:48,802 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2018-12-03 16:55:48,828 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:55:48,828 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:55:48,829 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:55:48,829 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:55:48,829 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:55:48,829 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:55:48,829 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:55:48,833 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:55:48,833 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:55:48,833 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:55:48,833 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:55:48,834 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:55:48,834 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:55:48,834 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:55:48,834 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:55:48,837 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:55:48,838 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:55:48,838 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:55:48,838 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:55:48,838 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:55:48,838 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:55:48,839 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:55:48,839 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:55:48,839 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:55:48,839 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:55:48,839 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:55:48,839 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:55:48,840 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:55:48,840 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:55:48,840 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:55:48,840 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:55:48,840 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:55:48,842 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:55:48,843 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:55:48,843 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:55:48,843 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:55:48,843 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:55:48,843 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:55:48,844 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:55:48,844 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:55:48,844 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:55:48,893 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:55:48,907 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:55:48,914 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:55:48,915 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:55:48,916 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:55:48,917 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg.bpl [2018-12-03 16:55:48,917 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg.bpl' [2018-12-03 16:55:48,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:55:48,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:55:48,956 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:55:48,957 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:55:48,957 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:55:48,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:55:48" (1/1) ... [2018-12-03 16:55:48,984 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:55:48" (1/1) ... [2018-12-03 16:55:48,992 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:55:48,993 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:55:48,993 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:55:48,995 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:55:48,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:55:48,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:55:48,996 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:55:49,008 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:55:48" (1/1) ... [2018-12-03 16:55:49,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:55:48" (1/1) ... [2018-12-03 16:55:49,009 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:55:48" (1/1) ... [2018-12-03 16:55:49,009 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:55:48" (1/1) ... [2018-12-03 16:55:49,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:55:48" (1/1) ... [2018-12-03 16:55:49,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:55:48" (1/1) ... [2018-12-03 16:55:49,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:55:48" (1/1) ... [2018-12-03 16:55:49,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:55:49,019 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:55:49,019 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:55:49,019 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:55:49,020 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:55:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:55:49,089 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-12-03 16:55:49,089 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 16:55:49,090 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 16:55:49,325 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:55:49,325 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 16:55:49,326 INFO L202 PluginConnector]: Adding new model Luxembourg.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:55:49 BoogieIcfgContainer [2018-12-03 16:55:49,326 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:55:49,327 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:55:49,327 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:55:49,334 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:55:49,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:55:48" (1/2) ... [2018-12-03 16:55:49,336 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe6fb8d and model type Luxembourg.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:55:49, skipping insertion in model container [2018-12-03 16:55:49,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:55:49" (2/2) ... [2018-12-03 16:55:49,339 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg.bpl [2018-12-03 16:55:49,349 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:55:49,359 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:55:49,380 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:55:49,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:55:49,424 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:55:49,424 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:55:49,424 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:55:49,424 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:55:49,424 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:55:49,425 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:55:49,427 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:55:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:55:49,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:55:49,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:49,456 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:55:49,458 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:49,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:49,465 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-12-03 16:55:49,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:49,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:49,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:49,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:49,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:49,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:55:49,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 16:55:49,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:55:49,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:55:49,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:55:49,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:55:49,643 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:55:49,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:49,677 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-12-03 16:55:49,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:55:49,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:55:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:49,691 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:55:49,691 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 16:55:49,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:55:49,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 16:55:49,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 16:55:49,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 16:55:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 16:55:49,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 16:55:49,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:49,730 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 16:55:49,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:55:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 16:55:49,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:55:49,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:49,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:55:49,732 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:49,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:49,732 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-12-03 16:55:49,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:49,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:49,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:49,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:49,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:49,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:49,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:49,898 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 16:55:49,901 INFO L205 CegarAbsIntRunner]: [0], [4], [8], [9] [2018-12-03 16:55:49,986 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:55:49,987 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:55:50,154 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:55:50,158 INFO L272 AbstractInterpreter]: Visited 4 different actions 11 times. Merged at 2 different actions 4 times. Never widened. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 16:55:50,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:50,205 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:55:50,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:50,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:50,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:50,225 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:50,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:50,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:50,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:50,296 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:50,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:50,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:50,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 16:55:50,375 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:50,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 16:55:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 16:55:50,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:55:50,377 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 16:55:50,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:50,403 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 16:55:50,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:55:50,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 16:55:50,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:50,404 INFO L225 Difference]: With dead ends: 8 [2018-12-03 16:55:50,404 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:55:50,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:55:50,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:55:50,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:55:50,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:55:50,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:55:50,408 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:55:50,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:50,408 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:55:50,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 16:55:50,409 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:55:50,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:55:50,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:50,409 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:55:50,410 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:50,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:50,410 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-12-03 16:55:50,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:50,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:50,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:50,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:50,412 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:50,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:50,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:50,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:50,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:50,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:50,474 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:50,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:50,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:50,487 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:50,487 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:50,502 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:55:50,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:50,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:50,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:50,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:50,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 16:55:50,616 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:50,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:55:50,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:55:50,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:55:50,617 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 16:55:50,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:50,673 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:55:50,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:55:50,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 16:55:50,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:50,677 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:55:50,677 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:55:50,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:55:50,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:55:50,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:55:50,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:55:50,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:55:50,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 16:55:50,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:50,680 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:55:50,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:55:50,681 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:55:50,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:55:50,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:50,681 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 16:55:50,682 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:50,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:50,682 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-12-03 16:55:50,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:50,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:50,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:50,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:50,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:50,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:50,783 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:50,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:50,784 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:50,784 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:50,785 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:50,785 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:50,785 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:50,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:50,803 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:50,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:50,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:50,819 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:50,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:50,825 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:51,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:51,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 16:55:51,015 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:51,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:55:51,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:55:51,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:55:51,018 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 16:55:51,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:51,077 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 16:55:51,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:55:51,079 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 16:55:51,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:51,080 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:55:51,080 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:55:51,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:55:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:55:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:55:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:55:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:55:51,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 16:55:51,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:51,085 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:55:51,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:55:51,085 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:55:51,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:55:51,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:51,086 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 16:55:51,086 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:51,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:51,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-12-03 16:55:51,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:51,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:51,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:51,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:51,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:51,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:51,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:51,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:51,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:51,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:51,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:51,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:51,217 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:51,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:51,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:51,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:51,373 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:51,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:51,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-03 16:55:51,393 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:51,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 16:55:51,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 16:55:51,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:55:51,394 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 16:55:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:51,509 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:55:51,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:55:51,510 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 16:55:51,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:51,510 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:55:51,511 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:55:51,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-03 16:55:51,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:55:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:55:51,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:55:51,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:55:51,514 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 16:55:51,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:51,514 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:55:51,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 16:55:51,515 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:55:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:55:51,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:51,515 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 16:55:51,516 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:51,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-12-03 16:55:51,516 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:51,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:51,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:51,518 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:51,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:51,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:51,762 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:51,763 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:51,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:51,763 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:51,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:51,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:51,818 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 16:55:51,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:51,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:51,826 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:51,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:52,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:52,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-03 16:55:52,313 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:52,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:55:52,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:55:52,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:55:52,315 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 16:55:52,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:52,345 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 16:55:52,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:55:52,345 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 16:55:52,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:52,346 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:55:52,346 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:55:52,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:55:52,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:55:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:55:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:55:52,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:55:52,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 16:55:52,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:52,351 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:55:52,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:55:52,351 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:55:52,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:55:52,351 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:52,352 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 16:55:52,352 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:52,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:52,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-12-03 16:55:52,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:52,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:52,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:52,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:52,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:52,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:52,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:52,563 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:52,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:52,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:52,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:52,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:52,574 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:52,591 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:52,591 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:52,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:52,599 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:52,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:52,754 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:52,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:52,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 16:55:52,775 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:52,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 16:55:52,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 16:55:52,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:55:52,777 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 16:55:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:52,812 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 16:55:52,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:55:52,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 16:55:52,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:52,814 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:55:52,814 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 16:55:52,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-03 16:55:52,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 16:55:52,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 16:55:52,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 16:55:52,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 16:55:52,819 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 16:55:52,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:52,819 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 16:55:52,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 16:55:52,819 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 16:55:52,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 16:55:52,820 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:52,820 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 16:55:52,820 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:52,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:52,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-12-03 16:55:52,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:52,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:52,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:52,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:52,822 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:52,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:52,958 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:52,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:52,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:52,959 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:52,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:52,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:52,959 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:52,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:52,973 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:52,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:52,989 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:52,989 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:53,276 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:53,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-03 16:55:53,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:53,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:55:53,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:55:53,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:53,300 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 16:55:53,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:53,342 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 16:55:53,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:55:53,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 16:55:53,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:53,344 INFO L225 Difference]: With dead ends: 14 [2018-12-03 16:55:53,344 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:55:53,345 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-03 16:55:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:55:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:55:53,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:55:53,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 16:55:53,348 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 16:55:53,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:53,348 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 16:55:53,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:55:53,348 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 16:55:53,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:55:53,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:53,349 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 16:55:53,349 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:53,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:53,350 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-12-03 16:55:53,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:53,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:53,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:53,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:53,351 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:53,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:53,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:53,475 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:53,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:53,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:53,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:53,486 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:53,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:53,496 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-03 16:55:53,496 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:53,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:53,722 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:53,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-03 16:55:53,742 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:53,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 16:55:53,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 16:55:53,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:53,744 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-12-03 16:55:53,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:53,777 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 16:55:53,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:55:53,777 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-12-03 16:55:53,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:53,778 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:55:53,778 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:55:53,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:55:53,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:55:53,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:55:53,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:55:53,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 16:55:53,781 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-12-03 16:55:53,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:53,782 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 16:55:53,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 16:55:53,782 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 16:55:53,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:55:53,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:53,783 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-12-03 16:55:53,783 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:53,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:53,783 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-12-03 16:55:53,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:53,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:53,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:53,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:53,784 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:53,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:53,909 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:53,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:53,910 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:53,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:53,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:53,910 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:53,920 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:53,920 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:53,928 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:53,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:53,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:54,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:54,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-03 16:55:54,195 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:54,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:55:54,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:55:54,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:55:54,197 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-12-03 16:55:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:54,230 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-12-03 16:55:54,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:55:54,230 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-12-03 16:55:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:54,231 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:55:54,231 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:55:54,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:55:54,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:55:54,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:55:54,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:55:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 16:55:54,236 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-12-03 16:55:54,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:54,236 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 16:55:54,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:55:54,236 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 16:55:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:55:54,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:54,237 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-12-03 16:55:54,237 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:54,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:54,238 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-12-03 16:55:54,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:54,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:54,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:54,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:54,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:54,364 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:54,364 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:54,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:54,365 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:54,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:54,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:54,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:54,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:54,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:54,391 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:54,391 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:54,806 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:54,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:54,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-03 16:55:54,826 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:54,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 16:55:54,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 16:55:54,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:55:54,828 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-12-03 16:55:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:54,856 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 16:55:54,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:55:54,857 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-12-03 16:55:54,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:54,858 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:55:54,858 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 16:55:54,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-03 16:55:54,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 16:55:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 16:55:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 16:55:54,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-12-03 16:55:54,861 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-12-03 16:55:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:54,862 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-12-03 16:55:54,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 16:55:54,862 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-12-03 16:55:54,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 16:55:54,862 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:54,863 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-12-03 16:55:54,863 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:54,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:54,863 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-12-03 16:55:54,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:54,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:54,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:54,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:54,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:55,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:55,196 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:55,196 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:55,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:55,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:55,197 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:55,234 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:55,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:55,267 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-12-03 16:55:55,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:55,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:55,278 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:55,278 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:55,667 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:55,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:55,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-03 16:55:55,687 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:55,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:55:55,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:55:55,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:55:55,688 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-12-03 16:55:55,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:55,727 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-03 16:55:55,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:55:55,727 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-12-03 16:55:55,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:55,728 INFO L225 Difference]: With dead ends: 18 [2018-12-03 16:55:55,728 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:55:55,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:55:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:55:55,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:55:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:55:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 16:55:55,731 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-12-03 16:55:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:55,731 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 16:55:55,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:55:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 16:55:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:55:55,732 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:55,732 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-12-03 16:55:55,732 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:55,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-12-03 16:55:55,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:55,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:55,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:55,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:55,734 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:55,870 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:55,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:55,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:55,871 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:55,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:55,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:55,871 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:55,880 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:55,880 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:55,895 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:55,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:55,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:55,903 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:55,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:56,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:56,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-12-03 16:55:56,318 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:56,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-03 16:55:56,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-03 16:55:56,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:55:56,320 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-12-03 16:55:56,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:56,485 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 16:55:56,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:55:56,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-12-03 16:55:56,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:56,486 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:55:56,486 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 16:55:56,489 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-12-03 16:55:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 16:55:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 16:55:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 16:55:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 16:55:56,494 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-12-03 16:55:56,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:56,494 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 16:55:56,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-03 16:55:56,495 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 16:55:56,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 16:55:56,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:56,495 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 16:55:56,495 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:56,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:56,496 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-12-03 16:55:56,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:56,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:56,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:56,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:56,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:56,841 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:56,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:56,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:56,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:56,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:56,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:56,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:56,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:56,854 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:56,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:56,872 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:56,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:57,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:57,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-12-03 16:55:57,460 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:57,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:55:57,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:55:57,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:55:57,462 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-12-03 16:55:57,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:57,491 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-12-03 16:55:57,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:55:57,492 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-12-03 16:55:57,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:57,493 INFO L225 Difference]: With dead ends: 20 [2018-12-03 16:55:57,493 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:55:57,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-12-03 16:55:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:55:57,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:55:57,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:55:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 16:55:57,497 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-12-03 16:55:57,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:57,498 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 16:55:57,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:55:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 16:55:57,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:55:57,498 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:57,499 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-12-03 16:55:57,499 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:57,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:57,499 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-12-03 16:55:57,499 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:57,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:57,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:57,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:57,501 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:57,771 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:57,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:57,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:57,771 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:57,771 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:57,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:57,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:57,781 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:57,781 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:57,800 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 16:55:57,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:57,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:57,811 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:57,811 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:58,270 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:58,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:58,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-12-03 16:55:58,290 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:58,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 16:55:58,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 16:55:58,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:55:58,292 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-12-03 16:55:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:58,337 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 16:55:58,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:55:58,338 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-12-03 16:55:58,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:58,338 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:55:58,338 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 16:55:58,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:55:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 16:55:58,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 16:55:58,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 16:55:58,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-03 16:55:58,343 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-12-03 16:55:58,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:58,343 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-03 16:55:58,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 16:55:58,344 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-03 16:55:58,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 16:55:58,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:58,344 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-12-03 16:55:58,345 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:58,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:58,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-12-03 16:55:58,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:58,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:58,346 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:58,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:58,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:58,685 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:58,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:58,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:58,686 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:58,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:58,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:58,686 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:58,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:58,696 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:58,706 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:58,706 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:58,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:58,715 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:59,098 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:59,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:59,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-12-03 16:55:59,117 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:59,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:55:59,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:55:59,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:55:59,119 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-12-03 16:55:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:59,150 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-12-03 16:55:59,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:55:59,151 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-12-03 16:55:59,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:59,152 INFO L225 Difference]: With dead ends: 22 [2018-12-03 16:55:59,152 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:55:59,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-12-03 16:55:59,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:55:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:55:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:55:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 16:55:59,156 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-12-03 16:55:59,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:59,156 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 16:55:59,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:55:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 16:55:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:55:59,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:59,158 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-12-03 16:55:59,158 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:59,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:59,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-12-03 16:55:59,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:59,159 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:59,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:59,159 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:59,975 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:59,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:59,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:59,975 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:59,976 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:59,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:59,976 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:55:59,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:59,995 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:00,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:00,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:00,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:00,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-12-03 16:56:00,867 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:00,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-03 16:56:00,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-03 16:56:00,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:56:00,868 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-12-03 16:56:00,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:00,897 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 16:56:00,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:56:00,898 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-12-03 16:56:00,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:00,898 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:56:00,899 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:56:00,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 16:56:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:56:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:56:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:56:00,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 16:56:00,903 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-12-03 16:56:00,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:00,903 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 16:56:00,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-03 16:56:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 16:56:00,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:56:00,905 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:00,905 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-12-03 16:56:00,905 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:00,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:00,906 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-12-03 16:56:00,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:00,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:00,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:00,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:00,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:01,116 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:01,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:01,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:01,117 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:01,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:01,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:01,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:01,127 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:01,127 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:01,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 16:56:01,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:01,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:01,153 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:01,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:02,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:02,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-12-03 16:56:02,352 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:02,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:56:02,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:56:02,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:56:02,353 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-12-03 16:56:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:02,396 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-03 16:56:02,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:56:02,397 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-12-03 16:56:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:02,398 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:56:02,398 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:56:02,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:56:02,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:56:02,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:56:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:56:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 16:56:02,402 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-12-03 16:56:02,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:02,402 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 16:56:02,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:56:02,403 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 16:56:02,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:56:02,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:02,404 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-12-03 16:56:02,404 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:02,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:02,404 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-12-03 16:56:02,404 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:02,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:02,405 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:02,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:02,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:03,115 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:03,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:03,116 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:03,116 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:03,116 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:03,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:03,117 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:03,126 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:03,126 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:03,141 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:03,141 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:03,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:03,151 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:03,637 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:03,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:03,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-12-03 16:56:03,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:03,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-03 16:56:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-03 16:56:03,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:56:03,659 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-12-03 16:56:03,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:03,705 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 16:56:03,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:56:03,705 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-12-03 16:56:03,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:03,706 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:56:03,706 INFO L226 Difference]: Without dead ends: 23 [2018-12-03 16:56:03,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 16:56:03,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-03 16:56:03,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-03 16:56:03,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-03 16:56:03,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-12-03 16:56:03,711 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-12-03 16:56:03,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:03,712 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-12-03 16:56:03,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-03 16:56:03,712 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-12-03 16:56:03,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-03 16:56:03,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:03,712 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-12-03 16:56:03,713 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:03,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:03,713 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-12-03 16:56:03,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:03,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:03,714 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:03,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:03,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:03,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:03,928 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:03,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:03,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:03,929 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:03,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:03,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:03,929 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:03,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:03,939 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:03,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:03,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:03,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:04,444 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:04,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:04,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-12-03 16:56:04,463 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:04,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:56:04,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:56:04,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:56:04,464 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-12-03 16:56:04,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:04,498 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-12-03 16:56:04,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:56:04,498 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-12-03 16:56:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:04,499 INFO L225 Difference]: With dead ends: 26 [2018-12-03 16:56:04,499 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:56:04,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 16:56:04,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:56:04,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:56:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:56:04,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 16:56:04,504 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-12-03 16:56:04,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:04,505 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 16:56:04,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:56:04,505 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 16:56:04,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:56:04,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:04,506 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-12-03 16:56:04,506 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:04,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:04,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-12-03 16:56:04,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:04,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:04,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:04,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:04,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:04,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:04,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:04,797 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:04,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:04,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:04,797 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:04,806 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:04,806 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:04,831 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-03 16:56:04,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:04,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:04,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:05,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:05,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2018-12-03 16:56:05,360 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:05,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 16:56:05,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 16:56:05,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:56:05,362 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-12-03 16:56:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:05,393 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 16:56:05,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:56:05,393 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-12-03 16:56:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:05,393 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:56:05,393 INFO L226 Difference]: Without dead ends: 25 [2018-12-03 16:56:05,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:56:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-03 16:56:05,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-03 16:56:05,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 16:56:05,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-03 16:56:05,397 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-12-03 16:56:05,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:05,397 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-03 16:56:05,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 16:56:05,397 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-03 16:56:05,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 16:56:05,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:05,398 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-12-03 16:56:05,398 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:05,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:05,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-12-03 16:56:05,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:05,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:05,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:05,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:05,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:05,829 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:05,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:05,829 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:05,829 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:05,829 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:05,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:05,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:05,839 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:05,839 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:05,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:05,852 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:05,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:05,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:06,426 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:06,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:06,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2018-12-03 16:56:06,447 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:06,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:56:06,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:56:06,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:56:06,448 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-12-03 16:56:06,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:06,506 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-12-03 16:56:06,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:56:06,509 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-12-03 16:56:06,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:06,509 INFO L225 Difference]: With dead ends: 28 [2018-12-03 16:56:06,510 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:56:06,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-12-03 16:56:06,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:56:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:56:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:56:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 16:56:06,513 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-12-03 16:56:06,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:06,514 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 16:56:06,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:56:06,514 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 16:56:06,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:56:06,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:06,514 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-12-03 16:56:06,515 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:06,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:06,515 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-12-03 16:56:06,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:06,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:06,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:06,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:06,516 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:06,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:06,930 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:06,930 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:06,931 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:06,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:06,931 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:06,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:06,940 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:06,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:06,963 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:06,963 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:08,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:08,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2018-12-03 16:56:08,108 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:08,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-12-03 16:56:08,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-12-03 16:56:08,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:56:08,110 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-12-03 16:56:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:08,171 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 16:56:08,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:56:08,172 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-12-03 16:56:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:08,173 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:56:08,173 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 16:56:08,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 16:56:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 16:56:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 16:56:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 16:56:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-12-03 16:56:08,178 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-12-03 16:56:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:08,179 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-12-03 16:56:08,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-12-03 16:56:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-12-03 16:56:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 16:56:08,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:08,180 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-12-03 16:56:08,180 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:08,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-12-03 16:56:08,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:08,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:08,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:08,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:08,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:08,487 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:08,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:08,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:08,488 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:08,488 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:08,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:08,488 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:08,497 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:08,498 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:08,583 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2018-12-03 16:56:08,584 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:08,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:08,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:09,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:09,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2018-12-03 16:56:09,358 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:09,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:56:09,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:56:09,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:56:09,359 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-12-03 16:56:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:09,401 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-03 16:56:09,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:56:09,401 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-12-03 16:56:09,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:09,402 INFO L225 Difference]: With dead ends: 30 [2018-12-03 16:56:09,402 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:56:09,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:56:09,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:56:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:56:09,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:56:09,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 16:56:09,408 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-12-03 16:56:09,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:09,408 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 16:56:09,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:56:09,408 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 16:56:09,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:56:09,409 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:09,409 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-12-03 16:56:09,409 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:09,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-12-03 16:56:09,410 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:09,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:09,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:09,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:09,411 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:09,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:09,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:09,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:09,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:09,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:09,888 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:09,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:09,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:09,908 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:09,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:09,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:09,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:10,587 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:10,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:10,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2018-12-03 16:56:10,606 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:10,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-03 16:56:10,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-03 16:56:10,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:56:10,608 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-12-03 16:56:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:10,641 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 16:56:10,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:56:10,642 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-12-03 16:56:10,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:10,642 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:56:10,642 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 16:56:10,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 16:56:10,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 16:56:10,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 16:56:10,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 16:56:10,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-12-03 16:56:10,649 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-12-03 16:56:10,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:10,649 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-12-03 16:56:10,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-03 16:56:10,650 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-12-03 16:56:10,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 16:56:10,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:10,651 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-12-03 16:56:10,651 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:10,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:10,651 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-12-03 16:56:10,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:10,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:10,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:10,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:10,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:10,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:11,020 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:11,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:11,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:11,020 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:11,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:11,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:11,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:11,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:11,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:11,050 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:11,058 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:11,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:12,932 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:12,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2018-12-03 16:56:12,932 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:12,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:56:12,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:56:12,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:56:12,934 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-12-03 16:56:12,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:12,981 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-12-03 16:56:12,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:56:12,982 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-12-03 16:56:12,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:12,982 INFO L225 Difference]: With dead ends: 32 [2018-12-03 16:56:12,983 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:56:12,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 16:56:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:56:12,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 16:56:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:56:12,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 16:56:12,987 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-12-03 16:56:12,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:12,987 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 16:56:12,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:56:12,987 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 16:56:12,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 16:56:12,988 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:12,988 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-12-03 16:56:12,988 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:12,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:12,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-12-03 16:56:12,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:12,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:12,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:12,989 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:13,869 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:13,869 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:13,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:13,870 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:13,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:13,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:13,870 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:13,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:13,879 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:13,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 16:56:13,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:13,899 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:13,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:14,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:14,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2018-12-03 16:56:14,784 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:14,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 16:56:14,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 16:56:14,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:56:14,786 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-12-03 16:56:14,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:14,962 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 16:56:14,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:56:14,962 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-12-03 16:56:14,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:14,963 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:56:14,963 INFO L226 Difference]: Without dead ends: 31 [2018-12-03 16:56:14,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:56:14,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-03 16:56:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-12-03 16:56:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 16:56:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-03 16:56:14,968 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-12-03 16:56:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:14,968 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-03 16:56:14,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 16:56:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-03 16:56:14,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 16:56:14,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:14,969 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-12-03 16:56:14,969 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:14,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:14,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-12-03 16:56:14,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:14,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:14,970 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:14,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:14,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:14,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:15,954 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:15,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:15,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:15,954 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:15,954 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:15,954 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:15,954 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:15,963 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:15,963 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:15,979 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:15,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:15,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:15,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:16,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:16,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2018-12-03 16:56:16,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:16,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:56:16,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:56:16,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:56:16,879 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-12-03 16:56:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:16,922 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-12-03 16:56:16,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:56:16,923 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-12-03 16:56:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:16,923 INFO L225 Difference]: With dead ends: 34 [2018-12-03 16:56:16,923 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:56:16,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-12-03 16:56:16,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:56:16,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 16:56:16,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:56:16,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 16:56:16,929 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-12-03 16:56:16,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:16,929 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 16:56:16,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:56:16,930 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 16:56:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:56:16,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:16,930 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-12-03 16:56:16,931 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:16,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:16,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-12-03 16:56:16,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:16,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:16,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:16,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:16,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:17,601 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:17,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:17,601 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:17,602 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:17,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:17,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:17,602 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:17,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:17,611 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:17,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:17,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:18,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:18,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2018-12-03 16:56:18,639 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:18,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-12-03 16:56:18,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-12-03 16:56:18,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:56:18,641 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-12-03 16:56:18,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:18,715 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 16:56:18,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:56:18,715 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-12-03 16:56:18,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:18,716 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:56:18,716 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 16:56:18,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 16:56:18,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 16:56:18,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 16:56:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 16:56:18,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-12-03 16:56:18,721 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-12-03 16:56:18,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:18,721 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-12-03 16:56:18,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-12-03 16:56:18,721 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-12-03 16:56:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 16:56:18,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:18,722 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-12-03 16:56:18,722 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:18,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:18,722 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-12-03 16:56:18,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:18,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:18,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:18,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:18,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:18,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:19,189 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:19,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:19,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:19,190 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:19,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:19,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:19,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:19,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:19,199 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:19,226 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 16:56:19,226 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:19,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:19,239 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:19,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:20,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:20,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2018-12-03 16:56:20,642 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:20,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:56:20,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:56:20,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:56:20,644 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-12-03 16:56:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:20,711 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-03 16:56:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:56:20,712 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-12-03 16:56:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:20,712 INFO L225 Difference]: With dead ends: 36 [2018-12-03 16:56:20,712 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:56:20,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:56:20,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:56:20,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:56:20,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:56:20,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 16:56:20,717 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-12-03 16:56:20,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:20,717 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 16:56:20,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:56:20,717 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 16:56:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:56:20,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:20,717 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-12-03 16:56:20,718 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:20,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:20,718 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-12-03 16:56:20,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:20,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:20,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:20,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:20,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:21,175 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:21,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:21,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:21,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:21,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:21,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:21,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:21,190 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:21,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:21,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:21,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:21,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:21,218 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:21,218 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:22,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:22,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2018-12-03 16:56:22,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:22,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-03 16:56:22,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-03 16:56:22,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:56:22,269 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-12-03 16:56:22,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:22,357 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 16:56:22,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:56:22,357 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-12-03 16:56:22,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:22,358 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:56:22,358 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 16:56:22,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 16:56:22,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 16:56:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 16:56:22,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 16:56:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-12-03 16:56:22,362 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-12-03 16:56:22,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:22,362 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-12-03 16:56:22,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-03 16:56:22,362 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-12-03 16:56:22,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 16:56:22,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:22,363 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-12-03 16:56:22,363 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:22,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:22,364 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-12-03 16:56:22,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:22,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:22,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:22,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:22,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:23,087 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:23,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:23,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:23,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:23,088 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:23,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:23,089 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:23,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:23,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:23,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:23,124 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:23,124 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:24,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:24,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2018-12-03 16:56:24,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:24,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:56:24,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:56:24,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:56:24,232 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-12-03 16:56:24,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:24,286 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-12-03 16:56:24,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:56:24,287 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-12-03 16:56:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:24,288 INFO L225 Difference]: With dead ends: 38 [2018-12-03 16:56:24,288 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:56:24,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 16:56:24,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:56:24,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:56:24,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:56:24,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 16:56:24,293 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-12-03 16:56:24,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:24,293 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 16:56:24,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:56:24,293 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 16:56:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:56:24,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:24,294 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-12-03 16:56:24,294 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:24,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-12-03 16:56:24,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:24,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:24,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:24,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:24,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:24,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:24,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:24,766 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:24,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:24,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:24,766 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:24,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:24,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:24,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2018-12-03 16:56:24,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:24,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:24,806 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:25,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:25,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2018-12-03 16:56:25,997 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:25,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 16:56:25,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 16:56:25,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:56:25,998 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-12-03 16:56:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:26,080 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 16:56:26,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:56:26,080 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-12-03 16:56:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:26,081 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:56:26,081 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:56:26,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:56:26,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:56:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:56:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:56:26,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 16:56:26,085 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-12-03 16:56:26,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:26,086 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 16:56:26,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 16:56:26,086 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 16:56:26,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:56:26,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:26,086 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-12-03 16:56:26,087 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:26,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:26,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-12-03 16:56:26,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:26,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:26,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:26,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:26,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:26,629 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:26,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:26,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:26,630 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:26,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:26,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:26,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:26,640 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:26,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:26,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:26,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:26,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:26,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:28,270 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:28,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:28,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2018-12-03 16:56:28,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:28,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:56:28,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:56:28,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:56:28,291 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-12-03 16:56:28,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:28,383 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-12-03 16:56:28,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:56:28,384 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-12-03 16:56:28,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:28,385 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:56:28,385 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:56:28,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:56:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:56:28,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 16:56:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 16:56:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 16:56:28,389 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-12-03 16:56:28,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:28,389 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 16:56:28,389 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:56:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 16:56:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 16:56:28,389 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:28,390 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-12-03 16:56:28,390 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:28,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:28,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-12-03 16:56:28,390 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:28,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:28,391 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:28,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:28,391 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:29,192 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:29,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:29,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:29,193 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:29,193 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:29,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:29,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:29,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:29,201 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:29,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:29,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:30,812 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:30,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:30,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2018-12-03 16:56:30,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:30,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-12-03 16:56:30,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-12-03 16:56:30,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:56:30,831 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-12-03 16:56:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:30,906 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 16:56:30,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:56:30,907 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-12-03 16:56:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:30,907 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:56:30,908 INFO L226 Difference]: Without dead ends: 39 [2018-12-03 16:56:30,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 16:56:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-03 16:56:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-12-03 16:56:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-12-03 16:56:30,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-12-03 16:56:30,911 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-12-03 16:56:30,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:30,911 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-12-03 16:56:30,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-12-03 16:56:30,912 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-12-03 16:56:30,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 16:56:30,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:30,912 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-12-03 16:56:30,912 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:30,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:30,913 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-12-03 16:56:30,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:30,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:30,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:30,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:30,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:30,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:31,436 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:31,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:31,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:31,437 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:31,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:31,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:31,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:31,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:31,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:31,516 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-12-03 16:56:31,516 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:31,517 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:31,526 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:31,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:33,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:33,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2018-12-03 16:56:33,196 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:33,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:56:33,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:56:33,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:56:33,197 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-12-03 16:56:33,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:33,254 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-03 16:56:33,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:56:33,255 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-12-03 16:56:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:33,255 INFO L225 Difference]: With dead ends: 42 [2018-12-03 16:56:33,255 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:56:33,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:56:33,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:56:33,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 16:56:33,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:56:33,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 16:56:33,259 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-12-03 16:56:33,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:33,259 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 16:56:33,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:56:33,260 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 16:56:33,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:56:33,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:33,260 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-12-03 16:56:33,260 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:33,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:33,260 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-12-03 16:56:33,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:33,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:33,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:33,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:33,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:33,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:34,382 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:34,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:34,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:34,383 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:34,383 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:34,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:34,383 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:34,393 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:34,393 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:34,412 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:34,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:34,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:34,421 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:34,422 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:36,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:36,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2018-12-03 16:56:36,123 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:36,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-12-03 16:56:36,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-12-03 16:56:36,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:56:36,124 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-12-03 16:56:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:36,180 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 16:56:36,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:56:36,180 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-12-03 16:56:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:36,181 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:56:36,181 INFO L226 Difference]: Without dead ends: 41 [2018-12-03 16:56:36,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 16:56:36,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-03 16:56:36,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-12-03 16:56:36,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 16:56:36,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-12-03 16:56:36,184 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-12-03 16:56:36,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:36,184 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-12-03 16:56:36,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-12-03 16:56:36,184 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-12-03 16:56:36,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 16:56:36,185 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:36,185 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-12-03 16:56:36,185 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:36,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:36,185 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-12-03 16:56:36,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:36,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:36,186 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:36,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:36,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:36,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:36,843 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:36,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:36,843 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:36,843 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:36,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:36,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:36,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:36,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:36,852 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:36,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:36,885 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:36,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:38,781 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:38,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:38,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2018-12-03 16:56:38,800 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:38,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:56:38,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:56:38,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:56:38,801 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-12-03 16:56:38,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:38,866 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-12-03 16:56:38,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:56:38,866 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-12-03 16:56:38,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:38,867 INFO L225 Difference]: With dead ends: 44 [2018-12-03 16:56:38,867 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 16:56:38,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 16:56:38,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 16:56:38,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 16:56:38,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:56:38,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 16:56:38,871 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-12-03 16:56:38,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:38,871 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 16:56:38,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:56:38,871 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 16:56:38,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:56:38,872 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:38,872 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-12-03 16:56:38,872 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:38,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:38,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-12-03 16:56:38,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:38,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:38,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:38,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:38,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:39,531 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:39,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:39,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:39,532 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:39,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:39,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:39,532 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:39,541 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:39,541 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:39,569 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 16:56:39,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:39,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:39,578 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:39,579 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:41,257 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:41,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:41,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2018-12-03 16:56:41,276 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:41,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 16:56:41,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 16:56:41,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:56:41,278 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-12-03 16:56:41,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:41,339 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 16:56:41,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:56:41,339 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-12-03 16:56:41,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:41,340 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:56:41,340 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 16:56:41,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:56:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 16:56:41,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 16:56:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 16:56:41,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-03 16:56:41,344 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-12-03 16:56:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:41,344 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-03 16:56:41,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 16:56:41,345 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-03 16:56:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 16:56:41,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:41,345 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-12-03 16:56:41,345 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:41,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:41,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-12-03 16:56:41,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:41,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:41,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:41,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:41,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:41,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:42,171 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:42,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:42,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:42,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:42,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 16:56:42,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:42,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:42,183 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:42,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:42,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:42,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:42,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:42,219 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:42,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:44,149 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:44,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:44,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2018-12-03 16:56:44,168 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:44,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:56:44,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:56:44,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:56:44,169 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-12-03 16:56:44,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:44,215 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-12-03 16:56:44,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:56:44,215 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-12-03 16:56:44,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:44,216 INFO L225 Difference]: With dead ends: 46 [2018-12-03 16:56:44,216 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:56:44,217 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-12-03 16:56:44,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:56:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 16:56:44,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:56:44,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 16:56:44,220 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-12-03 16:56:44,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:44,220 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 16:56:44,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:56:44,221 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 16:56:44,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:56:44,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:44,221 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-12-03 16:56:44,221 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:44,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:44,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-12-03 16:56:44,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:44,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:44,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:44,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:44,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:44,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:44,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:44,886 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:44,886 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:44,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:44,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:44,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:44,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:44,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:44,929 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:46,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:46,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2018-12-03 16:56:46,730 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:46,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-12-03 16:56:46,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-12-03 16:56:46,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:56:46,732 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-12-03 16:56:46,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:46,819 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 16:56:46,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:56:46,819 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-12-03 16:56:46,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:46,820 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:56:46,820 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 16:56:46,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 16:56:46,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 16:56:46,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 16:56:46,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 16:56:46,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-12-03 16:56:46,823 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-12-03 16:56:46,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:46,824 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-12-03 16:56:46,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-12-03 16:56:46,824 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-12-03 16:56:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 16:56:46,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:46,824 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-12-03 16:56:46,825 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:46,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:46,825 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-12-03 16:56:46,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:46,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:46,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:46,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:46,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:47,644 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:47,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:47,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:47,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:47,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:47,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:47,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:47,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:47,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:47,686 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 16:56:47,687 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:47,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:47,696 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:47,696 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:49,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:49,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2018-12-03 16:56:49,894 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:49,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:56:49,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:56:49,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:56:49,896 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-12-03 16:56:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:49,964 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-03 16:56:49,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:56:49,964 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-12-03 16:56:49,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:49,965 INFO L225 Difference]: With dead ends: 48 [2018-12-03 16:56:49,965 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:56:49,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:56:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:56:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 16:56:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 16:56:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 16:56:49,968 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-12-03 16:56:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:49,969 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 16:56:49,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:56:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 16:56:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 16:56:49,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:49,970 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-12-03 16:56:49,970 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:49,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:49,970 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-12-03 16:56:49,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:49,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:49,971 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:49,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:49,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:49,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:50,841 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:50,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:50,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:50,842 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:50,842 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:50,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:50,842 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:50,850 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:50,850 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:50,876 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:50,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:50,878 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:50,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:53,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:53,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2018-12-03 16:56:53,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:53,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-03 16:56:53,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-03 16:56:53,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:56:53,093 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-12-03 16:56:53,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:53,195 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 16:56:53,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:56:53,195 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-12-03 16:56:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:53,196 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:56:53,196 INFO L226 Difference]: Without dead ends: 47 [2018-12-03 16:56:53,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 16:56:53,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-03 16:56:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-12-03 16:56:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-03 16:56:53,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-12-03 16:56:53,198 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-12-03 16:56:53,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:53,198 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-12-03 16:56:53,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-03 16:56:53,199 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-12-03 16:56:53,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 16:56:53,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:53,199 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-12-03 16:56:53,199 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:53,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:53,200 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-12-03 16:56:53,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:53,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:53,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:53,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:53,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:54,085 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:54,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:54,085 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:54,086 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:54,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:54,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:54,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:54,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:54,094 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:54,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:54,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:54,130 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:54,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:56,150 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:56,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:56,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2018-12-03 16:56:56,171 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:56,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:56:56,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:56:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:56:56,172 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-12-03 16:56:56,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:56,298 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-12-03 16:56:56,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:56:56,298 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-12-03 16:56:56,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:56,299 INFO L225 Difference]: With dead ends: 50 [2018-12-03 16:56:56,299 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 16:56:56,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 16:56:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 16:56:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 16:56:56,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:56:56,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 16:56:56,302 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-12-03 16:56:56,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:56,302 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 16:56:56,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:56:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 16:56:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:56:56,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:56,303 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-12-03 16:56:56,303 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:56,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:56,303 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-12-03 16:56:56,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:56,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:56,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:56,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:56,304 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:57,062 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:57,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:57,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:57,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:57,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:57,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:57,063 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:56:57,072 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:57,072 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:57,111 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-12-03 16:56:57,111 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:57,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:57,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:59,546 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:59,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:59,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2018-12-03 16:56:59,565 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:59,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 16:56:59,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 16:56:59,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:56:59,566 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-12-03 16:56:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:59,630 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 16:56:59,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:56:59,631 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-12-03 16:56:59,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:59,632 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:56:59,632 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 16:56:59,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:56:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 16:56:59,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 16:56:59,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 16:56:59,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-03 16:56:59,635 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-12-03 16:56:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:59,635 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-03 16:56:59,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 16:56:59,636 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-03 16:56:59,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 16:56:59,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:59,636 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-12-03 16:56:59,636 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:59,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:59,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-12-03 16:56:59,637 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:59,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:59,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:59,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:59,638 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:00,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:00,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:00,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:00,425 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:00,425 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:00,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:00,425 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:00,435 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:00,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:00,462 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:00,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:00,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:00,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:02,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:02,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2018-12-03 16:57:02,738 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:02,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:57:02,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:57:02,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:57:02,740 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-12-03 16:57:03,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:03,100 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-12-03 16:57:03,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:57:03,100 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-12-03 16:57:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:03,101 INFO L225 Difference]: With dead ends: 52 [2018-12-03 16:57:03,101 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 16:57:03,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-12-03 16:57:03,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 16:57:03,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 16:57:03,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 16:57:03,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 16:57:03,105 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-12-03 16:57:03,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:03,105 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 16:57:03,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:57:03,106 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 16:57:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 16:57:03,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:03,106 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-12-03 16:57:03,106 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:03,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:03,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-12-03 16:57:03,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:03,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:03,108 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:03,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:03,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:03,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:04,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:04,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:04,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:04,280 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:04,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:04,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:04,280 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:04,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:04,288 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:04,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:04,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:04,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:06,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:06,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2018-12-03 16:57:06,772 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:06,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-12-03 16:57:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-12-03 16:57:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:57:06,773 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-12-03 16:57:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:06,875 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 16:57:06,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:57:06,875 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-12-03 16:57:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:06,876 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:57:06,876 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 16:57:06,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 16:57:06,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 16:57:06,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 16:57:06,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 16:57:06,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-12-03 16:57:06,879 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-12-03 16:57:06,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:06,879 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-12-03 16:57:06,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-12-03 16:57:06,879 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-12-03 16:57:06,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 16:57:06,880 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:06,880 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-12-03 16:57:06,880 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:06,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:06,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-12-03 16:57:06,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:06,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:06,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:06,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:06,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:06,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:07,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:07,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:07,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:07,988 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:07,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:07,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:07,988 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:07,997 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:07,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:08,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2018-12-03 16:57:08,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:08,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:08,043 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:10,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:10,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:10,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2018-12-03 16:57:10,787 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:10,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:57:10,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:57:10,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:57:10,788 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-12-03 16:57:10,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:10,865 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-03 16:57:10,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:57:10,872 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-12-03 16:57:10,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:10,873 INFO L225 Difference]: With dead ends: 54 [2018-12-03 16:57:10,873 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:57:10,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:57:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:57:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:57:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:57:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 16:57:10,875 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-12-03 16:57:10,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:10,876 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 16:57:10,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:57:10,876 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 16:57:10,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:57:10,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:10,877 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-12-03 16:57:10,877 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:10,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:10,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-12-03 16:57:10,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:10,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:10,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:10,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:10,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:11,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:11,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:11,800 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:11,800 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:11,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:11,800 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:11,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:11,809 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:11,836 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:11,836 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:11,838 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:11,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:11,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:14,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:14,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2018-12-03 16:57:14,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:14,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-12-03 16:57:14,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-12-03 16:57:14,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:57:14,553 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-12-03 16:57:14,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:14,669 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 16:57:14,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:57:14,670 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-12-03 16:57:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:14,671 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:57:14,671 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 16:57:14,672 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 16:57:14,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 16:57:14,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 16:57:14,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 16:57:14,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-12-03 16:57:14,675 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-12-03 16:57:14,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:14,675 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-12-03 16:57:14,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-12-03 16:57:14,676 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-12-03 16:57:14,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 16:57:14,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:14,676 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-12-03 16:57:14,676 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:14,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:14,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-12-03 16:57:14,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:14,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:14,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:14,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:14,678 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:16,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:16,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:16,575 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:16,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:16,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:16,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:16,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:16,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:16,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:16,615 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:16,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:16,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:19,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:19,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2018-12-03 16:57:19,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:19,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:57:19,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:57:19,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:57:19,843 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-12-03 16:57:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:19,922 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-12-03 16:57:19,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:57:19,922 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-12-03 16:57:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:19,923 INFO L225 Difference]: With dead ends: 56 [2018-12-03 16:57:19,923 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 16:57:19,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 16:57:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 16:57:19,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 16:57:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:57:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 16:57:19,927 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-12-03 16:57:19,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:19,927 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 16:57:19,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:57:19,927 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 16:57:19,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:57:19,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:19,928 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-12-03 16:57:19,928 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:19,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-12-03 16:57:19,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:19,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:19,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:19,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:19,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:21,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:21,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:21,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:21,095 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:21,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:21,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:21,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:21,105 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:21,105 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:21,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 16:57:21,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:21,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:21,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:21,195 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:24,202 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:24,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:24,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2018-12-03 16:57:24,230 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:24,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 16:57:24,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 16:57:24,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:57:24,232 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-12-03 16:57:24,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:24,362 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 16:57:24,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:57:24,363 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-12-03 16:57:24,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:24,364 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:57:24,364 INFO L226 Difference]: Without dead ends: 55 [2018-12-03 16:57:24,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:57:24,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-03 16:57:24,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-03 16:57:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-03 16:57:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-03 16:57:24,367 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-12-03 16:57:24,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:24,367 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-03 16:57:24,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 16:57:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-03 16:57:24,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 16:57:24,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:24,368 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-12-03 16:57:24,368 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:24,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:24,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-12-03 16:57:24,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:24,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:24,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:24,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:25,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:25,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:25,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:25,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:25,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:25,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:25,449 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:25,449 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:25,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:25,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:25,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:25,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:28,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:28,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2018-12-03 16:57:28,446 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:28,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:57:28,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:57:28,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:57:28,448 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-12-03 16:57:28,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:28,527 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-12-03 16:57:28,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:57:28,527 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-12-03 16:57:28,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:28,528 INFO L225 Difference]: With dead ends: 58 [2018-12-03 16:57:28,528 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 16:57:28,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-12-03 16:57:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 16:57:28,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 16:57:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 16:57:28,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 16:57:28,531 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-12-03 16:57:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:28,532 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 16:57:28,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:57:28,532 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 16:57:28,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 16:57:28,532 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:28,532 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-12-03 16:57:28,533 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:28,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:28,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-12-03 16:57:28,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:28,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:28,534 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:28,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:28,534 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:29,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:29,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:29,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:29,906 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:29,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:29,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:29,906 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:29,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:29,915 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:29,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:29,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:29,955 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:32,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:32,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:32,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2018-12-03 16:57:32,978 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:32,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-12-03 16:57:32,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-12-03 16:57:32,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:57:32,979 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-12-03 16:57:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:33,057 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 16:57:33,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:57:33,058 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-12-03 16:57:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:33,058 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:57:33,059 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 16:57:33,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 16:57:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 16:57:33,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 16:57:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 16:57:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-12-03 16:57:33,062 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-12-03 16:57:33,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:33,062 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-12-03 16:57:33,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-12-03 16:57:33,063 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-12-03 16:57:33,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 16:57:33,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:33,063 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-12-03 16:57:33,063 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:33,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:33,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-12-03 16:57:33,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:33,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:33,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:33,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:33,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:34,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:34,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:34,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:34,355 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:34,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:34,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:34,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:34,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:34,365 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:34,417 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 16:57:34,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:34,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:34,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:37,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:37,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:37,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2018-12-03 16:57:37,469 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:37,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:57:37,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:57:37,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:57:37,471 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-12-03 16:57:37,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:37,554 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-03 16:57:37,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:57:37,554 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-12-03 16:57:37,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:37,555 INFO L225 Difference]: With dead ends: 60 [2018-12-03 16:57:37,555 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:57:37,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:57:37,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:57:37,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 16:57:37,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 16:57:37,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 16:57:37,559 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-12-03 16:57:37,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:37,559 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 16:57:37,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:57:37,559 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 16:57:37,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 16:57:37,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:37,560 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-12-03 16:57:37,560 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:37,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:37,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-12-03 16:57:37,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:37,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:37,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:37,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:38,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:38,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:38,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:38,716 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:38,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:38,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:38,716 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:38,725 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:38,725 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:38,755 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:38,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:38,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:38,767 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:42,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:42,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:42,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2018-12-03 16:57:42,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:42,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-12-03 16:57:42,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-12-03 16:57:42,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:57:42,245 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-12-03 16:57:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:42,312 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 16:57:42,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:57:42,312 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-12-03 16:57:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:42,313 INFO L225 Difference]: With dead ends: 61 [2018-12-03 16:57:42,313 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 16:57:42,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 16:57:42,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 16:57:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 16:57:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 16:57:42,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-12-03 16:57:42,317 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-12-03 16:57:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:42,317 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-12-03 16:57:42,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-12-03 16:57:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-12-03 16:57:42,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 16:57:42,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:42,318 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-12-03 16:57:42,318 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:42,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-12-03 16:57:42,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:42,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:42,320 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:43,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:43,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:43,576 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:43,576 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:43,576 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:43,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:43,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:43,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:43,587 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:43,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:43,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:47,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:47,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2018-12-03 16:57:47,269 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:47,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:57:47,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:57:47,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:57:47,271 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-12-03 16:57:47,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:47,395 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-12-03 16:57:47,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:57:47,396 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-12-03 16:57:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:47,397 INFO L225 Difference]: With dead ends: 62 [2018-12-03 16:57:47,397 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 16:57:47,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 16:57:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 16:57:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 16:57:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:57:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 16:57:47,401 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-12-03 16:57:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:47,401 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 16:57:47,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:57:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 16:57:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:57:47,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:47,402 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-12-03 16:57:47,402 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:47,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:47,402 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-12-03 16:57:47,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:47,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:47,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:47,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:47,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:47,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:48,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:48,582 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:48,582 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:48,583 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:48,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:48,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:48,592 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:48,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:48,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2018-12-03 16:57:48,739 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:48,742 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:48,754 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:52,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:52,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:52,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2018-12-03 16:57:52,423 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:52,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 16:57:52,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 16:57:52,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:57:52,425 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-12-03 16:57:52,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:52,513 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 16:57:52,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:57:52,514 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-12-03 16:57:52,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:52,515 INFO L225 Difference]: With dead ends: 63 [2018-12-03 16:57:52,515 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 16:57:52,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:57:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 16:57:52,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 16:57:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 16:57:52,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-03 16:57:52,519 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-12-03 16:57:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:52,519 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-03 16:57:52,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 16:57:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-03 16:57:52,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 16:57:52,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:52,520 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-12-03 16:57:52,520 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:52,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:52,521 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-12-03 16:57:52,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:52,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:52,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:52,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:52,522 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:53,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:53,826 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:53,826 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:53,826 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:53,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:53,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:53,836 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:53,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:53,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:53,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:53,876 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:53,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:53,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:57,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:57,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2018-12-03 16:57:57,798 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:57,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:57:57,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:57:57,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:57:57,799 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-12-03 16:57:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:57,890 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-12-03 16:57:57,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:57:57,891 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-12-03 16:57:57,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:57,891 INFO L225 Difference]: With dead ends: 64 [2018-12-03 16:57:57,891 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 16:57:57,892 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-12-03 16:57:57,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 16:57:57,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 16:57:57,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 16:57:57,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 16:57:57,895 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-12-03 16:57:57,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:57,895 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 16:57:57,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:57:57,895 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 16:57:57,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 16:57:57,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:57,896 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-12-03 16:57:57,896 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:57,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:57,897 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-12-03 16:57:57,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:57,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:57,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:57,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:57,897 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:59,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:59,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:59,202 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:59,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:59,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:59,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:59,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:59,211 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:59,245 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:59,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:03,299 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:03,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:03,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2018-12-03 16:58:03,319 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:03,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-12-03 16:58:03,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-12-03 16:58:03,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:58:03,321 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-12-03 16:58:03,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:03,415 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 16:58:03,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:58:03,415 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-12-03 16:58:03,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:03,416 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:58:03,416 INFO L226 Difference]: Without dead ends: 63 [2018-12-03 16:58:03,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 16:58:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-03 16:58:03,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-03 16:58:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-03 16:58:03,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-12-03 16:58:03,420 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-12-03 16:58:03,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:03,420 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-12-03 16:58:03,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-12-03 16:58:03,420 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-12-03 16:58:03,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-03 16:58:03,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:03,420 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-12-03 16:58:03,421 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:03,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:03,421 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-12-03 16:58:03,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:03,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:03,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:03,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:03,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:06,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:06,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:06,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:06,762 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:06,762 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:06,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:06,762 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:06,771 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:06,771 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:06,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2018-12-03 16:58:06,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:06,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:06,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:06,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:10,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:10,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2018-12-03 16:58:10,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:10,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:58:10,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:58:10,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:58:10,858 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-12-03 16:58:10,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:10,952 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-03 16:58:10,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:58:10,952 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-12-03 16:58:10,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:10,953 INFO L225 Difference]: With dead ends: 66 [2018-12-03 16:58:10,953 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 16:58:10,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:58:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 16:58:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 16:58:10,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:58:10,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 16:58:10,957 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-12-03 16:58:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:10,957 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 16:58:10,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:58:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 16:58:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:58:10,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:10,958 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-12-03 16:58:10,958 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:10,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:10,958 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-12-03 16:58:10,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:10,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:10,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:10,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:12,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:12,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:12,420 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:12,420 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:12,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:12,420 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:12,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:12,429 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:12,465 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:12,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:12,467 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:12,478 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:16,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:16,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:16,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2018-12-03 16:58:16,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:16,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-12-03 16:58:16,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-12-03 16:58:16,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:58:16,464 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-12-03 16:58:16,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:16,562 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 16:58:16,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:58:16,563 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-12-03 16:58:16,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:16,563 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:58:16,564 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 16:58:16,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 16:58:16,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 16:58:16,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-03 16:58:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 16:58:16,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-12-03 16:58:16,567 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-12-03 16:58:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:16,567 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-12-03 16:58:16,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-12-03 16:58:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-12-03 16:58:16,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 16:58:16,567 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:16,567 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-12-03 16:58:16,567 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:16,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:16,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-12-03 16:58:16,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:16,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:16,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:16,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:16,569 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:18,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:18,015 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:18,015 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:18,015 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:18,016 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:18,016 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:18,016 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:18,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:18,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:18,058 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:18,069 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:22,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:22,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:22,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2018-12-03 16:58:22,322 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:22,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:58:22,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:58:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:58:22,324 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-12-03 16:58:22,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:22,419 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-12-03 16:58:22,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:58:22,419 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-12-03 16:58:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:22,420 INFO L225 Difference]: With dead ends: 68 [2018-12-03 16:58:22,420 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 16:58:22,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 16:58:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 16:58:22,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 16:58:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:58:22,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 16:58:22,424 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-12-03 16:58:22,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:22,424 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 16:58:22,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:58:22,424 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 16:58:22,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 16:58:22,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:22,424 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-12-03 16:58:22,425 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:22,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:22,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-12-03 16:58:22,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:22,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:22,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:22,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:22,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:24,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:24,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:24,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:24,475 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:24,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:24,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:24,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:24,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:24,485 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:24,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 16:58:24,535 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:24,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:24,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:28,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:28,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2018-12-03 16:58:28,908 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:28,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 16:58:28,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 16:58:28,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:58:28,909 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-12-03 16:58:29,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:29,059 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 16:58:29,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:58:29,060 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-12-03 16:58:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:29,061 INFO L225 Difference]: With dead ends: 69 [2018-12-03 16:58:29,061 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 16:58:29,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:58:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 16:58:29,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 16:58:29,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 16:58:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-03 16:58:29,064 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-12-03 16:58:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:29,065 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-03 16:58:29,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 16:58:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-03 16:58:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 16:58:29,065 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:29,065 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-12-03 16:58:29,065 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:29,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:29,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-12-03 16:58:29,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:29,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:29,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:29,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:29,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:29,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:30,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:30,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:30,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:30,813 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:30,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:30,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:30,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:30,828 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:30,877 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:30,877 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:30,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:30,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:30,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:35,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:35,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2018-12-03 16:58:35,248 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:35,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:58:35,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:58:35,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:58:35,250 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-12-03 16:58:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:35,349 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-12-03 16:58:35,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:58:35,349 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-12-03 16:58:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:35,350 INFO L225 Difference]: With dead ends: 70 [2018-12-03 16:58:35,350 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 16:58:35,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-12-03 16:58:35,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 16:58:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 16:58:35,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 16:58:35,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 16:58:35,355 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-12-03 16:58:35,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:35,355 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 16:58:35,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:58:35,355 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 16:58:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:58:35,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:35,356 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-12-03 16:58:35,356 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:35,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:35,356 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-12-03 16:58:35,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:35,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:35,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:35,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:35,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:37,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:37,205 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:37,205 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:37,206 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:37,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:37,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:37,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:37,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:37,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:37,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:37,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:37,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:37,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:41,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:41,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2018-12-03 16:58:41,838 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:41,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-12-03 16:58:41,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-12-03 16:58:41,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:58:41,840 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-12-03 16:58:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:42,117 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 16:58:42,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:58:42,118 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-12-03 16:58:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:42,119 INFO L225 Difference]: With dead ends: 71 [2018-12-03 16:58:42,119 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:58:42,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 16:58:42,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:58:42,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 16:58:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:58:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 16:58:42,123 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-12-03 16:58:42,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:42,123 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 16:58:42,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-12-03 16:58:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 16:58:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:58:42,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:42,124 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-12-03 16:58:42,124 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:42,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:42,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-12-03 16:58:42,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:42,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:42,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:42,125 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:44,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:44,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:44,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:44,301 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:44,301 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:44,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:44,301 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:44,309 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:44,310 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:44,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 16:58:44,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:44,364 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:44,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:44,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:49,147 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:49,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:49,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2018-12-03 16:58:49,166 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:49,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:58:49,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:58:49,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:58:49,168 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-12-03 16:58:49,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:49,286 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-03 16:58:49,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:58:49,286 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-12-03 16:58:49,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:49,287 INFO L225 Difference]: With dead ends: 72 [2018-12-03 16:58:49,287 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 16:58:49,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:58:49,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 16:58:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 16:58:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 16:58:49,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 16:58:49,292 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-12-03 16:58:49,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:49,292 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 16:58:49,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:58:49,292 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 16:58:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 16:58:49,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:49,293 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-12-03 16:58:49,293 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:49,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:49,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-12-03 16:58:49,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:49,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:49,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:49,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:50,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:50,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:50,983 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:50,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:50,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:50,983 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:50,994 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:50,994 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:51,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:51,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:51,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:51,055 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:57,438 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:57,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:57,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2018-12-03 16:58:57,456 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:57,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-12-03 16:58:57,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-12-03 16:58:57,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:58:57,458 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-12-03 16:58:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:57,544 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 16:58:57,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:58:57,545 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-12-03 16:58:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:57,546 INFO L225 Difference]: With dead ends: 73 [2018-12-03 16:58:57,546 INFO L226 Difference]: Without dead ends: 71 [2018-12-03 16:58:57,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-12-03 16:58:57,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-03 16:58:57,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-03 16:58:57,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-03 16:58:57,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-12-03 16:58:57,549 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-12-03 16:58:57,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:57,549 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-12-03 16:58:57,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-12-03 16:58:57,550 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-12-03 16:58:57,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-03 16:58:57,550 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:57,550 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-12-03 16:58:57,550 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:57,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:57,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-12-03 16:58:57,551 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:57,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:57,551 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:57,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:57,551 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:59,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:59,178 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:59,178 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:59,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:59,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:59,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:59,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:59,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:59,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:59,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:59,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:59,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:04,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:04,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2018-12-03 16:59:04,251 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:04,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:59:04,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:59:04,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:59:04,253 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-12-03 16:59:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:04,368 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-12-03 16:59:04,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:59:04,368 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-12-03 16:59:04,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:04,369 INFO L225 Difference]: With dead ends: 74 [2018-12-03 16:59:04,369 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 16:59:04,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 16:59:04,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 16:59:04,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 16:59:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 16:59:04,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 16:59:04,373 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-12-03 16:59:04,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:04,373 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 16:59:04,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:59:04,373 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 16:59:04,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 16:59:04,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:04,374 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-12-03 16:59:04,374 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:04,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:04,375 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-12-03 16:59:04,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:04,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:04,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:06,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:06,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:06,111 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:06,112 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:06,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:06,112 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:06,120 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:06,120 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:06,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2018-12-03 16:59:06,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:06,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:06,190 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:11,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:11,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:11,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2018-12-03 16:59:11,501 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:11,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 16:59:11,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 16:59:11,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:59:11,503 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-12-03 16:59:11,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:11,622 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 16:59:11,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:59:11,622 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-12-03 16:59:11,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:11,623 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:59:11,623 INFO L226 Difference]: Without dead ends: 73 [2018-12-03 16:59:11,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:59:11,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-12-03 16:59:11,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-12-03 16:59:11,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 16:59:11,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-03 16:59:11,626 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-12-03 16:59:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:11,626 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-03 16:59:11,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 16:59:11,626 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-03 16:59:11,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 16:59:11,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:11,627 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-12-03 16:59:11,627 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:11,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:11,627 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-12-03 16:59:11,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:11,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:11,628 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:11,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:11,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:13,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:13,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:13,461 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:13,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:13,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:13,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:13,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:13,470 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:13,507 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:13,508 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:13,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:13,523 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:18,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:18,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:18,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2018-12-03 16:59:18,811 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:18,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:59:18,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:59:18,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:59:18,812 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-12-03 16:59:18,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:18,955 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-12-03 16:59:18,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:59:18,955 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-12-03 16:59:18,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:18,956 INFO L225 Difference]: With dead ends: 76 [2018-12-03 16:59:18,956 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 16:59:18,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 16:59:18,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 16:59:18,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 16:59:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 16:59:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 16:59:18,960 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-12-03 16:59:18,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:18,960 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 16:59:18,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:59:18,960 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 16:59:18,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 16:59:18,961 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:18,961 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-12-03 16:59:18,961 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:18,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:18,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-12-03 16:59:18,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:18,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:18,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:18,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:18,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:21,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:21,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:21,169 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:21,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:21,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:21,169 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:21,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:21,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:21,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:21,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:21,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:26,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:26,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2018-12-03 16:59:26,666 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:26,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 16:59:26,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 16:59:26,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:59:26,668 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-12-03 16:59:26,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:26,919 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 16:59:26,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:59:26,920 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-12-03 16:59:26,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:26,920 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:59:26,920 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 16:59:26,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 16:59:26,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 16:59:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 16:59:26,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 16:59:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-12-03 16:59:26,924 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-12-03 16:59:26,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:26,924 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-12-03 16:59:26,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 16:59:26,924 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-12-03 16:59:26,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 16:59:26,925 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:26,925 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-12-03 16:59:26,925 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:26,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:26,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-12-03 16:59:26,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:26,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:26,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:26,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:26,926 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:29,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:29,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:29,201 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:29,202 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:29,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:29,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:29,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:29,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:29,211 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:29,268 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2018-12-03 16:59:29,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:29,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:29,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:34,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:34,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2018-12-03 16:59:34,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:34,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:59:34,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:59:34,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:59:34,899 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-12-03 16:59:35,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:35,001 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-03 16:59:35,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:59:35,001 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-12-03 16:59:35,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:35,002 INFO L225 Difference]: With dead ends: 78 [2018-12-03 16:59:35,002 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:59:35,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:59:35,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:59:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:59:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:59:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 16:59:35,006 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-12-03 16:59:35,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:35,007 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 16:59:35,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:59:35,007 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 16:59:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:59:35,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:35,008 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-12-03 16:59:35,008 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:35,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:35,008 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-12-03 16:59:35,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:35,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,009 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:35,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:35,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:35,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:37,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:37,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:37,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:37,031 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:37,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:37,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:37,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:37,039 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:37,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:37,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:37,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:37,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:37,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:37,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:43,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:43,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:43,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2018-12-03 16:59:43,089 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:43,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 16:59:43,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 16:59:43,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:59:43,091 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-12-03 16:59:43,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:43,222 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 16:59:43,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:59:43,222 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-12-03 16:59:43,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:43,223 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:59:43,223 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 16:59:43,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-12-03 16:59:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 16:59:43,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 16:59:43,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 16:59:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-12-03 16:59:43,227 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-12-03 16:59:43,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:43,228 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-12-03 16:59:43,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 16:59:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-12-03 16:59:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 16:59:43,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:43,229 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-12-03 16:59:43,229 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:43,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:43,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-12-03 16:59:43,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:43,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:43,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:43,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:43,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:45,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:45,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:45,263 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:45,263 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:45,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:45,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:45,263 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:45,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:45,271 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:45,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:45,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:45,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:51,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:51,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:51,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2018-12-03 16:59:51,292 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:51,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:59:51,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:59:51,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:59:51,294 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-12-03 16:59:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:51,390 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-12-03 16:59:51,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:59:51,391 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-12-03 16:59:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:51,391 INFO L225 Difference]: With dead ends: 80 [2018-12-03 16:59:51,391 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 16:59:51,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 16:59:51,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 16:59:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 16:59:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 16:59:51,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 16:59:51,394 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-12-03 16:59:51,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:51,395 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 16:59:51,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:59:51,395 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 16:59:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 16:59:51,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:51,395 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-12-03 16:59:51,395 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:51,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:51,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-12-03 16:59:51,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:51,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:51,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:51,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:51,396 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:53,588 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:53,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:53,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:53,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:53,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:53,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:53,661 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 16:59:53,662 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:53,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:53,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:53,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:59,744 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:59,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:59,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2018-12-03 16:59:59,762 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:59,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 16:59:59,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 16:59:59,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:59:59,764 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-12-03 16:59:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:59,874 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 16:59:59,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:59:59,875 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-12-03 16:59:59,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:59,876 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:59:59,876 INFO L226 Difference]: Without dead ends: 79 [2018-12-03 16:59:59,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:59:59,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-03 16:59:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-12-03 16:59:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-03 16:59:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-03 16:59:59,880 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-12-03 16:59:59,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:59,880 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-03 16:59:59,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 16:59:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-03 16:59:59,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-03 16:59:59,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:59,881 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-12-03 16:59:59,881 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:59,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:59,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-12-03 16:59:59,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:59,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:59,883 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:59,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:59,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:59,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:01,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:01,981 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:01,981 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:01,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:01,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:01,982 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:01,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:01,990 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:02,035 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:02,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:02,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:02,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:02,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:08,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:08,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2018-12-03 17:00:08,658 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:08,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:00:08,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:00:08,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:00:08,660 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-12-03 17:00:08,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:08,794 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-12-03 17:00:08,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:00:08,795 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-12-03 17:00:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:08,796 INFO L225 Difference]: With dead ends: 82 [2018-12-03 17:00:08,796 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 17:00:08,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-12-03 17:00:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 17:00:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 17:00:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 17:00:08,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 17:00:08,799 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-12-03 17:00:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:08,800 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 17:00:08,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:00:08,800 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 17:00:08,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 17:00:08,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:08,800 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-12-03 17:00:08,800 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:08,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:08,801 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-12-03 17:00:08,801 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:08,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:08,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:08,802 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:10,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:10,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:10,891 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:10,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:10,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:10,891 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:10,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:10,899 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:10,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:10,975 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:10,975 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:17,241 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:17,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:17,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2018-12-03 17:00:17,260 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:17,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-12-03 17:00:17,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-12-03 17:00:17,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:00:17,262 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-12-03 17:00:18,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:18,263 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 17:00:18,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:00:18,264 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-12-03 17:00:18,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:18,265 INFO L225 Difference]: With dead ends: 83 [2018-12-03 17:00:18,265 INFO L226 Difference]: Without dead ends: 81 [2018-12-03 17:00:18,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:00:18,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-12-03 17:00:18,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-12-03 17:00:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 17:00:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-12-03 17:00:18,269 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-12-03 17:00:18,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:18,269 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-12-03 17:00:18,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-12-03 17:00:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-12-03 17:00:18,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 17:00:18,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:18,270 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-12-03 17:00:18,270 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:18,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-12-03 17:00:18,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:18,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:18,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:18,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:18,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:20,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:20,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:20,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:20,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:20,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:20,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:20,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:20,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:20,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 17:00:20,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:20,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:20,589 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:27,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:27,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2018-12-03 17:00:27,112 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:27,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 17:00:27,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 17:00:27,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:00:27,114 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-12-03 17:00:27,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:27,225 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-03 17:00:27,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 17:00:27,225 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-12-03 17:00:27,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:27,226 INFO L225 Difference]: With dead ends: 84 [2018-12-03 17:00:27,226 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 17:00:27,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 17:00:27,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 17:00:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 17:00:27,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 17:00:27,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 17:00:27,230 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-12-03 17:00:27,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:27,230 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 17:00:27,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 17:00:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 17:00:27,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 17:00:27,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:27,231 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-12-03 17:00:27,231 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:27,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:27,232 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-12-03 17:00:27,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:27,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:27,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:29,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:29,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:29,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:29,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:29,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:29,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:29,699 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:29,708 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:29,708 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:29,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:29,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:29,759 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:29,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:29,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:36,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:36,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:36,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2018-12-03 17:00:36,454 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:36,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-12-03 17:00:36,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-12-03 17:00:36,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:00:36,456 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-12-03 17:00:36,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:36,618 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 17:00:36,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:00:36,619 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-12-03 17:00:36,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:36,620 INFO L225 Difference]: With dead ends: 85 [2018-12-03 17:00:36,620 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 17:00:36,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-12-03 17:00:36,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 17:00:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 17:00:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 17:00:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-12-03 17:00:36,624 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-12-03 17:00:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:36,624 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-12-03 17:00:36,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-12-03 17:00:36,624 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-12-03 17:00:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 17:00:36,625 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:36,625 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-12-03 17:00:36,625 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:36,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:36,625 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-12-03 17:00:36,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:36,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:36,626 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:36,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:36,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:39,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:39,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:39,200 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:39,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:39,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:39,200 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:39,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:39,210 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:39,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:39,277 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:46,265 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:46,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:46,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2018-12-03 17:00:46,284 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:46,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 17:00:46,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 17:00:46,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:00:46,286 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-12-03 17:00:46,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:46,397 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-12-03 17:00:46,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 17:00:46,398 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-12-03 17:00:46,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:46,399 INFO L225 Difference]: With dead ends: 86 [2018-12-03 17:00:46,399 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 17:00:46,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:00:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 17:00:46,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 17:00:46,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 17:00:46,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 17:00:46,402 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-12-03 17:00:46,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:46,402 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 17:00:46,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 17:00:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 17:00:46,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 17:00:46,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:46,403 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-12-03 17:00:46,403 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:46,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:46,403 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-12-03 17:00:46,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:46,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:46,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:46,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:46,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:48,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:48,790 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:48,791 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:48,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:00:48,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:48,791 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:00:48,800 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:48,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:48,890 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2018-12-03 17:00:48,890 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:48,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:48,914 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:57,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:57,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2018-12-03 17:00:57,232 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:57,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 17:00:57,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 17:00:57,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:00:57,234 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-12-03 17:00:57,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:57,406 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 17:00:57,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 17:00:57,406 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-12-03 17:00:57,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:57,407 INFO L225 Difference]: With dead ends: 87 [2018-12-03 17:00:57,407 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:00:57,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 17:00:57,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:00:57,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:00:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:00:57,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-03 17:00:57,410 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-12-03 17:00:57,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:57,410 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-03 17:00:57,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 17:00:57,410 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-03 17:00:57,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 17:00:57,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:57,411 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-12-03 17:00:57,411 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:57,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:57,412 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-12-03 17:00:57,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:57,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:57,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:57,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:57,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:00,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:00,373 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:00,373 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:00,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:00,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:00,373 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:00,382 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:00,382 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:00,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:00,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:00,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:00,451 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:07,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:07,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2018-12-03 17:01:07,728 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:07,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 17:01:07,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 17:01:07,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:01:07,729 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-12-03 17:01:07,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:07,920 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-12-03 17:01:07,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 17:01:07,920 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-12-03 17:01:07,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:07,920 INFO L225 Difference]: With dead ends: 88 [2018-12-03 17:01:07,920 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 17:01:07,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-12-03 17:01:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 17:01:07,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 17:01:07,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 17:01:07,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 17:01:07,923 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-12-03 17:01:07,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:07,923 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 17:01:07,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 17:01:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 17:01:07,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 17:01:07,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:07,924 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-12-03 17:01:07,924 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:07,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:07,924 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-12-03 17:01:07,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:07,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:07,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:07,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:07,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:10,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:10,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:10,801 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:10,801 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:10,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:10,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:10,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:10,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:10,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:10,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:10,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:10,880 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:18,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:18,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2018-12-03 17:01:18,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:18,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-12-03 17:01:18,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-12-03 17:01:18,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:01:18,508 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-12-03 17:01:18,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:18,660 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 17:01:18,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:01:18,661 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-12-03 17:01:18,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:18,661 INFO L225 Difference]: With dead ends: 89 [2018-12-03 17:01:18,661 INFO L226 Difference]: Without dead ends: 87 [2018-12-03 17:01:18,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:01:18,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-12-03 17:01:18,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-12-03 17:01:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-12-03 17:01:18,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-12-03 17:01:18,666 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-12-03 17:01:18,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:18,666 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-12-03 17:01:18,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-12-03 17:01:18,666 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-12-03 17:01:18,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-12-03 17:01:18,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:18,667 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-12-03 17:01:18,667 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:18,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:18,667 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-12-03 17:01:18,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:18,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:18,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:18,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:18,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:21,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:21,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:21,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:21,665 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:21,665 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:21,665 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:21,665 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:21,674 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:21,674 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:21,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2018-12-03 17:01:21,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:21,754 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:21,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:21,768 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:29,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:29,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2018-12-03 17:01:29,349 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:29,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 17:01:29,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 17:01:29,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:01:29,351 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-12-03 17:01:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:29,547 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-03 17:01:29,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:01:29,548 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-12-03 17:01:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:29,548 INFO L225 Difference]: With dead ends: 90 [2018-12-03 17:01:29,549 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 17:01:29,550 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 17:01:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 17:01:29,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 17:01:29,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 17:01:29,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 17:01:29,552 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-12-03 17:01:29,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:29,553 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 17:01:29,553 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 17:01:29,553 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 17:01:29,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 17:01:29,553 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:29,553 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-12-03 17:01:29,553 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:29,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:29,554 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-12-03 17:01:29,554 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:29,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:29,554 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:29,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:29,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:32,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:32,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:32,377 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:32,377 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:32,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:32,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:32,378 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:32,386 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:32,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:32,437 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:32,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:32,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:32,456 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:40,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:40,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2018-12-03 17:01:40,361 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:40,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-12-03 17:01:40,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-12-03 17:01:40,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:01:40,363 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-12-03 17:01:40,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:40,521 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 17:01:40,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:01:40,522 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-12-03 17:01:40,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:40,523 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:01:40,523 INFO L226 Difference]: Without dead ends: 89 [2018-12-03 17:01:40,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-12-03 17:01:40,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-03 17:01:40,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-12-03 17:01:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 17:01:40,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-12-03 17:01:40,527 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-12-03 17:01:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:40,527 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-12-03 17:01:40,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-12-03 17:01:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-12-03 17:01:40,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 17:01:40,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:40,528 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-12-03 17:01:40,529 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:40,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:40,529 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-12-03 17:01:40,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:40,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:40,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:40,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:43,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:43,172 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:43,172 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:43,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 17:01:43,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:43,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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:43,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:43,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:43,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:43,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:43,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:51,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:51,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:51,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2018-12-03 17:01:51,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:51,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 17:01:51,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 17:01:51,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:01:51,409 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-12-03 17:01:51,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:51,593 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-12-03 17:01:51,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:01:51,594 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-12-03 17:01:51,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:51,595 INFO L225 Difference]: With dead ends: 92 [2018-12-03 17:01:51,595 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 17:01:51,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:01:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 17:01:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 17:01:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 17:01:51,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 17:01:51,599 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-12-03 17:01:51,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:51,599 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 17:01:51,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 17:01:51,599 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 17:01:51,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 17:01:51,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:51,600 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-12-03 17:01:51,600 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:51,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:51,600 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-12-03 17:01:51,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:51,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:51,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:51,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:51,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:54,248 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:54,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:54,248 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:54,249 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:54,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:54,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:54,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:01:54,257 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:54,257 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:54,332 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 17:01:54,333 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:54,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:54,351 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:54,351 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:02,802 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:02,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:02,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2018-12-03 17:02:02,821 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:02,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 17:02:02,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 17:02:02,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:02:02,823 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-12-03 17:02:03,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:03,025 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 17:02:03,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:02:03,025 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-12-03 17:02:03,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:03,026 INFO L225 Difference]: With dead ends: 93 [2018-12-03 17:02:03,026 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 17:02:03,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 17:02:03,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 17:02:03,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 17:02:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 17:02:03,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-03 17:02:03,030 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-12-03 17:02:03,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:03,030 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-03 17:02:03,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 17:02:03,030 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-03 17:02:03,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 17:02:03,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:03,031 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-12-03 17:02:03,031 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:03,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:03,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-12-03 17:02:03,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:03,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:03,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:03,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:03,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:06,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:06,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:06,249 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:06,250 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:06,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:06,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:06,260 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:06,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:06,314 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:06,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:06,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:06,349 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:06,350 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:14,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:14,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:14,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2018-12-03 17:02:14,699 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:14,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 17:02:14,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 17:02:14,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:02:14,701 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-12-03 17:02:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:14,839 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-12-03 17:02:14,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:02:14,840 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-12-03 17:02:14,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:14,841 INFO L225 Difference]: With dead ends: 94 [2018-12-03 17:02:14,841 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 17:02:14,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-12-03 17:02:14,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 17:02:14,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 17:02:14,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 17:02:14,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 17:02:14,845 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-12-03 17:02:14,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:14,845 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 17:02:14,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 17:02:14,845 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 17:02:14,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 17:02:14,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:14,846 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-12-03 17:02:14,846 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:14,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:14,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-12-03 17:02:14,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:14,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:14,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:14,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:14,847 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:17,871 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:17,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:17,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:17,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:17,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:17,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:17,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:17,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:17,880 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:17,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:17,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:17,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:26,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:26,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2018-12-03 17:02:26,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:26,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-12-03 17:02:26,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-12-03 17:02:26,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:02:26,750 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-12-03 17:02:26,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:26,962 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 17:02:26,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:02:26,962 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-12-03 17:02:26,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:26,963 INFO L225 Difference]: With dead ends: 95 [2018-12-03 17:02:26,963 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 17:02:26,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:02:26,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 17:02:26,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 17:02:26,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 17:02:26,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-12-03 17:02:26,967 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-12-03 17:02:26,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:26,967 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-12-03 17:02:26,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-12-03 17:02:26,967 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-12-03 17:02:26,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 17:02:26,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:26,968 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-12-03 17:02:26,968 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:26,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:26,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-12-03 17:02:26,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:26,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:26,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:26,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:26,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:26,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:29,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:29,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:29,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:29,856 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:29,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:29,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:29,856 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:29,864 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:29,864 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:30,021 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 17:02:30,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:30,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:30,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:39,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:39,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2018-12-03 17:02:39,124 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:39,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 17:02:39,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 17:02:39,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:02:39,126 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-12-03 17:02:39,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:39,265 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-03 17:02:39,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 17:02:39,266 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-12-03 17:02:39,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:39,266 INFO L225 Difference]: With dead ends: 96 [2018-12-03 17:02:39,267 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 17:02:39,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 17:02:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 17:02:39,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 17:02:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 17:02:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 17:02:39,270 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-12-03 17:02:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:39,270 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 17:02:39,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 17:02:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 17:02:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 17:02:39,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:39,271 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-12-03 17:02:39,271 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:39,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:39,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-12-03 17:02:39,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:39,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:39,272 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:39,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:39,272 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:42,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:42,460 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:42,461 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:42,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:42,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:42,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:42,471 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:42,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:42,524 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:42,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:42,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:42,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:42,545 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:51,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:51,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2018-12-03 17:02:51,406 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:51,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-12-03 17:02:51,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-12-03 17:02:51,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:02:51,408 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-12-03 17:02:51,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:51,698 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 17:02:51,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 17:02:51,698 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-12-03 17:02:51,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:51,698 INFO L225 Difference]: With dead ends: 97 [2018-12-03 17:02:51,699 INFO L226 Difference]: Without dead ends: 95 [2018-12-03 17:02:51,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-12-03 17:02:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-03 17:02:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-12-03 17:02:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-12-03 17:02:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-12-03 17:02:51,702 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-12-03 17:02:51,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:51,702 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-12-03 17:02:51,702 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-12-03 17:02:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-12-03 17:02:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 17:02:51,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:51,703 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-12-03 17:02:51,703 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:51,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-12-03 17:02:51,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:51,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:51,704 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:51,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:51,705 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:54,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:54,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:54,752 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:54,752 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:54,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:54,752 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:02:54,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:54,762 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:54,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:54,832 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:54,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:04,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:04,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:04,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2018-12-03 17:03:04,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:04,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 17:03:04,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 17:03:04,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:03:04,150 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-12-03 17:03:04,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:04,354 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-12-03 17:03:04,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:03:04,355 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-12-03 17:03:04,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:04,355 INFO L225 Difference]: With dead ends: 98 [2018-12-03 17:03:04,356 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 17:03:04,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:03:04,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 17:03:04,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 17:03:04,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 17:03:04,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 17:03:04,360 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-12-03 17:03:04,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:04,360 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 17:03:04,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 17:03:04,360 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 17:03:04,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 17:03:04,360 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:04,360 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-12-03 17:03:04,360 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:04,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:04,361 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-12-03 17:03:04,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:04,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:04,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:04,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:04,362 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:07,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:07,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:07,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:07,648 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:07,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:07,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:07,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:07,657 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:07,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:07,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2018-12-03 17:03:07,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:07,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:07,780 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:07,780 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:17,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:17,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2018-12-03 17:03:17,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:17,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 17:03:17,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 17:03:17,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:03:17,047 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-12-03 17:03:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:17,216 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 17:03:17,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 17:03:17,217 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-12-03 17:03:17,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:17,217 INFO L225 Difference]: With dead ends: 99 [2018-12-03 17:03:17,217 INFO L226 Difference]: Without dead ends: 97 [2018-12-03 17:03:17,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 17:03:17,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-12-03 17:03:17,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-12-03 17:03:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 17:03:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-03 17:03:17,220 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-12-03 17:03:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:17,220 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-03 17:03:17,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 17:03:17,220 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-03 17:03:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 17:03:17,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:17,221 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-12-03 17:03:17,221 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:17,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-12-03 17:03:17,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:17,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:17,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:17,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:17,222 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:20,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:20,449 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:20,450 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:20,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:20,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:20,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:20,458 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:20,458 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:20,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:20,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:20,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:20,543 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:30,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:30,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2018-12-03 17:03:30,298 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:30,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 17:03:30,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 17:03:30,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:03:30,300 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-12-03 17:03:30,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:30,468 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-12-03 17:03:30,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:03:30,468 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-12-03 17:03:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:30,469 INFO L225 Difference]: With dead ends: 100 [2018-12-03 17:03:30,469 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 17:03:30,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-12-03 17:03:30,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 17:03:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 17:03:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 17:03:30,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 17:03:30,472 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-12-03 17:03:30,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:30,472 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 17:03:30,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 17:03:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 17:03:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 17:03:30,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:30,472 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-12-03 17:03:30,473 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:30,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2018-12-03 17:03:30,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:30,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:30,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:30,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:30,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:33,813 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:33,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:33,813 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:33,813 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:33,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 17:03:33,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:33,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 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:33,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:33,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:33,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:33,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:43,749 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:43,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:43,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2018-12-03 17:03:43,767 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:43,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-12-03 17:03:43,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-12-03 17:03:43,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:03:43,769 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-12-03 17:03:43,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:43,946 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 17:03:43,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:03:43,946 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-12-03 17:03:43,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:43,947 INFO L225 Difference]: With dead ends: 101 [2018-12-03 17:03:43,947 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 17:03:43,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:03:43,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 17:03:43,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 17:03:43,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 17:03:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-12-03 17:03:43,951 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-12-03 17:03:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:43,951 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-12-03 17:03:43,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-12-03 17:03:43,951 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-12-03 17:03:43,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 17:03:43,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:43,951 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-12-03 17:03:43,952 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:43,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:43,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2018-12-03 17:03:43,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:43,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:43,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:43,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:43,953 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:43,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:47,207 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:47,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:47,207 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:47,207 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:47,207 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:03:47,207 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:47,208 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:03:47,215 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:47,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:47,305 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2018-12-03 17:03:47,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:47,308 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:47,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:47,326 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:57,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:57,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:57,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2018-12-03 17:03:57,191 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:57,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 17:03:57,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 17:03:57,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:03:57,193 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-12-03 17:03:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:57,363 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-03 17:03:57,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 17:03:57,363 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-12-03 17:03:57,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:57,364 INFO L225 Difference]: With dead ends: 102 [2018-12-03 17:03:57,364 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 17:03:57,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 17:03:57,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 17:03:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 17:03:57,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 17:03:57,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 17:03:57,369 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-12-03 17:03:57,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:57,369 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 17:03:57,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 17:03:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 17:03:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 17:03:57,370 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:57,370 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-12-03 17:03:57,370 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:57,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:57,370 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2018-12-03 17:03:57,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:57,371 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:57,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:57,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:00,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:00,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:00,986 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:00,986 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:00,986 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:00,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:00,987 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:00,996 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:00,997 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:01,069 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:01,069 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:01,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:01,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:01,091 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:11,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:11,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2018-12-03 17:04:11,184 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:11,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-12-03 17:04:11,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-12-03 17:04:11,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:04:11,186 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-12-03 17:04:11,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:11,331 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 17:04:11,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 17:04:11,332 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-12-03 17:04:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:11,333 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:04:11,333 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 17:04:11,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-12-03 17:04:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 17:04:11,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 17:04:11,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 17:04:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-12-03 17:04:11,336 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-12-03 17:04:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:11,337 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-12-03 17:04:11,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-12-03 17:04:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-12-03 17:04:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 17:04:11,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:11,337 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-12-03 17:04:11,338 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:11,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:11,338 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2018-12-03 17:04:11,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:11,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:11,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:11,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:11,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:15,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:15,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:15,033 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:15,033 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:15,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:15,034 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:15,034 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:15,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:15,042 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:15,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:15,098 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:15,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:25,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:25,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:25,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2018-12-03 17:04:25,407 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:25,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 17:04:25,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 17:04:25,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:04:25,409 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-12-03 17:04:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:25,639 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-12-03 17:04:25,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-03 17:04:25,640 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-12-03 17:04:25,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:25,640 INFO L225 Difference]: With dead ends: 104 [2018-12-03 17:04:25,641 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 17:04:25,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:04:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 17:04:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 17:04:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 17:04:25,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 17:04:25,645 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-12-03 17:04:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:25,645 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 17:04:25,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 17:04:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 17:04:25,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 17:04:25,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:25,646 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-12-03 17:04:25,646 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:25,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:25,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2018-12-03 17:04:25,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:25,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:25,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:25,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:25,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:29,295 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:29,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:29,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:29,295 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:29,295 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:29,295 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:29,296 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:29,303 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:04:29,304 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:04:29,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 17:04:29,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:29,400 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:29,418 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:39,757 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:39,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:39,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2018-12-03 17:04:39,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:39,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 17:04:39,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 17:04:39,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:04:39,778 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-12-03 17:04:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:40,075 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 17:04:40,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 17:04:40,075 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-12-03 17:04:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:40,076 INFO L225 Difference]: With dead ends: 105 [2018-12-03 17:04:40,076 INFO L226 Difference]: Without dead ends: 103 [2018-12-03 17:04:40,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 17:04:40,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-03 17:04:40,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-12-03 17:04:40,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-03 17:04:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-03 17:04:40,081 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-12-03 17:04:40,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:40,081 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-03 17:04:40,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 17:04:40,082 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-03 17:04:40,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 17:04:40,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:40,082 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-12-03 17:04:40,082 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:40,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2018-12-03 17:04:40,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:40,083 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:40,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:40,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:43,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:43,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:43,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:43,553 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:43,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:43,553 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:43,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:04:43,561 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:04:43,619 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:04:43,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:04:43,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:43,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:53,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:53,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:53,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2018-12-03 17:04:53,964 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:53,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 17:04:53,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 17:04:53,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:04:53,966 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-12-03 17:04:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:54,127 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-12-03 17:04:54,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:04:54,128 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-12-03 17:04:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:54,129 INFO L225 Difference]: With dead ends: 106 [2018-12-03 17:04:54,129 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 17:04:54,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-12-03 17:04:54,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 17:04:54,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 17:04:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 17:04:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 17:04:54,133 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-12-03 17:04:54,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:54,134 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 17:04:54,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 17:04:54,134 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 17:04:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 17:04:54,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:54,135 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-12-03 17:04:54,135 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:54,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:54,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2018-12-03 17:04:54,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:54,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:54,136 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:54,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:54,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:57,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:57,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:57,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:04:57,839 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:04:57,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:04:57,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:04:57,839 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:04:57,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:04:57,848 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:04:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:04:57,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:04:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:57,925 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:08,515 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:08,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:08,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2018-12-03 17:05:08,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:08,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-03 17:05:08,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-03 17:05:08,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:05:08,536 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-12-03 17:05:08,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:08,855 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 17:05:08,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 17:05:08,856 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-12-03 17:05:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:08,857 INFO L225 Difference]: With dead ends: 107 [2018-12-03 17:05:08,857 INFO L226 Difference]: Without dead ends: 105 [2018-12-03 17:05:08,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:05:08,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-03 17:05:08,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-03 17:05:08,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 17:05:08,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-12-03 17:05:08,861 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-12-03 17:05:08,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:08,862 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-12-03 17:05:08,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-03 17:05:08,862 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-12-03 17:05:08,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 17:05:08,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:08,863 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-12-03 17:05:08,863 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:08,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:08,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2018-12-03 17:05:08,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:08,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:08,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:08,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:08,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:12,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:12,502 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:12,502 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:12,503 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:12,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:12,503 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:12,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:12,511 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:12,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 17:05:12,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:12,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:12,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:23,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:23,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2018-12-03 17:05:23,278 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:23,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 17:05:23,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 17:05:23,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:05:23,280 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-12-03 17:05:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:23,527 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-03 17:05:23,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-12-03 17:05:23,527 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-12-03 17:05:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:23,529 INFO L225 Difference]: With dead ends: 108 [2018-12-03 17:05:23,529 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 17:05:23,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 17:05:23,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 17:05:23,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 17:05:23,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 17:05:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 17:05:23,534 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-12-03 17:05:23,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:23,534 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 17:05:23,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 17:05:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 17:05:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 17:05:23,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:23,535 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-12-03 17:05:23,535 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:23,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:23,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2018-12-03 17:05:23,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:23,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:23,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:23,536 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:27,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:27,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:27,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:27,227 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:27,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:27,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:27,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:27,235 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:05:27,235 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:05:27,298 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:05:27,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:27,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:27,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:27,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:38,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:38,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2018-12-03 17:05:38,240 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:38,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-12-03 17:05:38,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-12-03 17:05:38,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:05:38,244 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-12-03 17:05:38,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:38,494 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 17:05:38,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 17:05:38,495 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-12-03 17:05:38,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:38,496 INFO L225 Difference]: With dead ends: 109 [2018-12-03 17:05:38,496 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:05:38,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-12-03 17:05:38,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:05:38,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 17:05:38,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 17:05:38,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-12-03 17:05:38,500 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-12-03 17:05:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:38,500 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-12-03 17:05:38,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-12-03 17:05:38,500 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-12-03 17:05:38,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 17:05:38,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:38,501 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-12-03 17:05:38,501 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:38,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:38,501 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2018-12-03 17:05:38,502 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:38,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:38,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:05:38,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:38,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:42,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:42,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:42,288 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:42,288 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:42,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 17:05:42,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:42,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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:42,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:42,297 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:05:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:42,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:42,386 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:05:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:53,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:05:53,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2018-12-03 17:05:53,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:05:53,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 17:05:53,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 17:05:53,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:05:53,444 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-12-03 17:05:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:05:53,759 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-12-03 17:05:53,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 17:05:53,759 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-12-03 17:05:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:05:53,760 INFO L225 Difference]: With dead ends: 110 [2018-12-03 17:05:53,760 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 17:05:53,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:05:53,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 17:05:53,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 17:05:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 17:05:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 17:05:53,764 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-12-03 17:05:53,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:05:53,764 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 17:05:53,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 17:05:53,764 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 17:05:53,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 17:05:53,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:05:53,765 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-12-03 17:05:53,765 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:05:53,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:05:53,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2018-12-03 17:05:53,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:05:53,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:53,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:05:53,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:05:53,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:05:53,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:05:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:57,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:57,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:05:57,736 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:05:57,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:05:57,737 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:05:57,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:05:57,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:05:57,747 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:05:57,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2018-12-03 17:05:57,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:05:57,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:05:57,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:05:57,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:09,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:09,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:09,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2018-12-03 17:06:09,030 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:09,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 17:06:09,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 17:06:09,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:06:09,032 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-12-03 17:06:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:09,348 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 17:06:09,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 17:06:09,349 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-12-03 17:06:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:09,350 INFO L225 Difference]: With dead ends: 111 [2018-12-03 17:06:09,350 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:06:09,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 17:06:09,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:06:09,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 17:06:09,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 17:06:09,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-03 17:06:09,354 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-12-03 17:06:09,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:09,354 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-03 17:06:09,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 17:06:09,355 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-03 17:06:09,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 17:06:09,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:09,355 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-12-03 17:06:09,355 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:09,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:09,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2018-12-03 17:06:09,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:09,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:09,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:09,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:13,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:13,232 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:13,232 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:13,232 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:13,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:13,233 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:13,240 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:06:13,241 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:06:13,306 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:06:13,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:13,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:13,331 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:13,332 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:24,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:24,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:24,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2018-12-03 17:06:24,850 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:24,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 17:06:24,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 17:06:24,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:06:24,852 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-12-03 17:06:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:25,181 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-12-03 17:06:25,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-12-03 17:06:25,181 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-12-03 17:06:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:25,182 INFO L225 Difference]: With dead ends: 112 [2018-12-03 17:06:25,182 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 17:06:25,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-12-03 17:06:25,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 17:06:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 17:06:25,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 17:06:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 17:06:25,186 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-12-03 17:06:25,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:25,186 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 17:06:25,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 17:06:25,186 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 17:06:25,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 17:06:25,187 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:25,187 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-12-03 17:06:25,187 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:25,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:25,187 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2018-12-03 17:06:25,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:25,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:25,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:25,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:25,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:29,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:29,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:29,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:29,159 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:29,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:29,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:29,159 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:29,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:29,175 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:06:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:29,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:29,265 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:29,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:40,963 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:40,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:40,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2018-12-03 17:06:40,982 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:40,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-12-03 17:06:40,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-12-03 17:06:40,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:06:40,984 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-12-03 17:06:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:41,291 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 17:06:41,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 17:06:41,291 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-12-03 17:06:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:41,292 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:06:41,292 INFO L226 Difference]: Without dead ends: 111 [2018-12-03 17:06:41,294 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-12-03 17:06:41,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-03 17:06:41,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-12-03 17:06:41,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-12-03 17:06:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-12-03 17:06:41,297 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-12-03 17:06:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:41,297 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-12-03 17:06:41,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-12-03 17:06:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-12-03 17:06:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-03 17:06:41,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:41,298 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-12-03 17:06:41,298 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:41,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:41,298 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2018-12-03 17:06:41,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:41,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:41,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:06:41,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:41,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:06:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:45,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:45,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:06:45,347 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:06:45,347 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:06:45,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:06:45,347 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:06:45,355 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:06:45,355 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:06:45,455 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2018-12-03 17:06:45,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:06:45,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:06:45,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:45,479 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:06:57,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:06:57,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:06:57,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2018-12-03 17:06:57,194 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:06:57,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 17:06:57,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 17:06:57,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:06:57,197 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-12-03 17:06:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:06:57,473 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-03 17:06:57,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 17:06:57,473 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-12-03 17:06:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:06:57,474 INFO L225 Difference]: With dead ends: 114 [2018-12-03 17:06:57,474 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 17:06:57,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 17:06:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 17:06:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 17:06:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 17:06:57,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 17:06:57,477 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-12-03 17:06:57,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:06:57,477 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 17:06:57,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 17:06:57,477 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 17:06:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 17:06:57,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:06:57,478 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-12-03 17:06:57,478 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:06:57,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:06:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2018-12-03 17:06:57,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:06:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:57,479 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:06:57,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:06:57,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:06:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:01,504 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:01,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:01,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:01,505 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:01,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:01,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:01,505 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:01,513 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:07:01,513 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:07:01,579 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:07:01,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:01,583 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:01,603 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:13,438 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:13,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:13,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2018-12-03 17:07:13,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:13,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-12-03 17:07:13,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-12-03 17:07:13,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:07:13,460 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-12-03 17:07:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:13,729 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 17:07:13,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 17:07:13,730 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-12-03 17:07:13,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:13,730 INFO L225 Difference]: With dead ends: 115 [2018-12-03 17:07:13,730 INFO L226 Difference]: Without dead ends: 113 [2018-12-03 17:07:13,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-12-03 17:07:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-03 17:07:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-12-03 17:07:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 17:07:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-12-03 17:07:13,735 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-12-03 17:07:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:13,735 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-12-03 17:07:13,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-12-03 17:07:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-12-03 17:07:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 17:07:13,735 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:13,736 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-12-03 17:07:13,736 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:13,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2018-12-03 17:07:13,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:13,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:13,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:17,859 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:17,859 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:17,859 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:17,860 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:17,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:17,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:17,860 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:17,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:17,869 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:07:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:17,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:17,952 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:30,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:30,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:30,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2018-12-03 17:07:30,101 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:30,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 17:07:30,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 17:07:30,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:07:30,104 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-12-03 17:07:30,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:30,465 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-12-03 17:07:30,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-12-03 17:07:30,466 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-12-03 17:07:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:30,466 INFO L225 Difference]: With dead ends: 116 [2018-12-03 17:07:30,466 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 17:07:30,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-12-03 17:07:30,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 17:07:30,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 17:07:30,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 17:07:30,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 17:07:30,471 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-12-03 17:07:30,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:30,471 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 17:07:30,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 17:07:30,472 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 17:07:30,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 17:07:30,472 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:30,472 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-12-03 17:07:30,472 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:30,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:30,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2018-12-03 17:07:30,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:30,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:30,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:07:30,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:30,474 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:34,697 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:34,697 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:34,698 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:34,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:34,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:34,698 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:34,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:07:34,707 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:07:34,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 17:07:34,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:34,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:34,839 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:07:47,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:47,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:07:47,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2018-12-03 17:07:47,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:07:47,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 17:07:47,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 17:07:47,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 17:07:47,188 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-12-03 17:07:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:07:47,396 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 17:07:47,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 17:07:47,396 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-12-03 17:07:47,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:07:47,397 INFO L225 Difference]: With dead ends: 117 [2018-12-03 17:07:47,397 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 17:07:47,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 17:07:47,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 17:07:47,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 17:07:47,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 17:07:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-03 17:07:47,402 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-12-03 17:07:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:07:47,402 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-03 17:07:47,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 17:07:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-03 17:07:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 17:07:47,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:07:47,403 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-12-03 17:07:47,403 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:07:47,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:07:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2018-12-03 17:07:47,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:07:47,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:47,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:07:47,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:07:47,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:07:47,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:07:51,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:51,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:51,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:07:51,696 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:07:51,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:07:51,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:07:51,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:07:51,704 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:07:51,704 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:07:51,772 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:07:51,772 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:07:51,775 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:07:51,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:07:51,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:08:04,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:04,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:08:04,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113, 113, 113] total 225 [2018-12-03 17:08:04,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:08:04,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 17:08:04,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 17:08:04,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 17:08:04,330 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-12-03 17:08:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:08:04,692 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-12-03 17:08:04,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 17:08:04,692 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-12-03 17:08:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:08:04,692 INFO L225 Difference]: With dead ends: 118 [2018-12-03 17:08:04,693 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 17:08:04,694 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-12-03 17:08:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 17:08:04,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 17:08:04,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 17:08:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 17:08:04,697 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-12-03 17:08:04,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:08:04,697 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 17:08:04,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 17:08:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 17:08:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 17:08:04,698 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:08:04,698 INFO L402 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-12-03 17:08:04,698 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:08:04,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:08:04,698 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2018-12-03 17:08:04,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:08:04,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:04,699 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:08:04,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:08:04,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:08:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:09,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:09,024 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:08:09,024 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:08:09,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:08:09,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:08:09,025 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 113 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:08:09,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:08:09,032 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:08:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:08:09,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:08:09,120 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:08:09,120 INFO L316 TraceCheckSpWp]: Computing backward predicates...