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/LexIndexValue-Pointer-Reduced.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:51:22,765 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:51:22,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:51:22,780 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:51:22,780 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:51:22,781 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:51:22,783 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:51:22,785 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:51:22,786 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:51:22,787 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:51:22,788 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:51:22,789 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:51:22,790 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:51:22,791 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:51:22,792 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:51:22,793 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:51:22,794 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:51:22,796 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:51:22,798 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:51:22,800 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:51:22,801 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:51:22,802 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:51:22,805 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:51:22,805 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:51:22,805 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:51:22,806 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:51:22,807 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:51:22,808 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:51:22,809 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:51:22,812 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:51:22,812 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:51:22,813 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:51:22,814 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:51:22,814 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:51:22,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:51:22,818 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:51:22,819 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:51:22,842 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:51:22,842 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:51:22,845 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:51:22,845 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:51:22,845 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:51:22,845 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:51:22,846 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:51:22,848 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:51:22,848 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:51:22,849 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:51:22,849 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:51:22,849 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:51:22,849 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:51:22,849 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:51:22,850 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:51:22,850 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:51:22,852 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:51:22,852 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:51:22,852 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:51:22,853 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:51:22,853 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:51:22,853 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:51:22,853 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:51:22,853 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:51:22,853 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:51:22,855 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:51:22,855 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:51:22,855 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:51:22,855 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:51:22,857 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:51:22,857 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:51:22,857 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:51:22,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:51:22,858 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:51:22,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:51:22,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:51:22,858 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:51:22,859 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:51:22,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:51:22,859 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:51:22,859 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:51:22,917 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:51:22,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:51:22,940 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:51:22,941 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:51:22,942 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:51:22,943 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LexIndexValue-Pointer-Reduced.bpl [2018-12-03 16:51:22,944 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/LexIndexValue-Pointer-Reduced.bpl' [2018-12-03 16:51:22,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:51:22,987 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:51:22,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:51:22,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:51:22,988 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:51:23,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:51:22" (1/1) ... [2018-12-03 16:51:23,018 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:51:22" (1/1) ... [2018-12-03 16:51:23,025 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:51:23,026 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:51:23,026 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:51:23,028 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:51:23,030 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:51:23,030 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:51:23,030 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:51:23,044 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:51:22" (1/1) ... [2018-12-03 16:51:23,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:51:22" (1/1) ... [2018-12-03 16:51:23,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:51:22" (1/1) ... [2018-12-03 16:51:23,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:51:22" (1/1) ... [2018-12-03 16:51:23,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:51:22" (1/1) ... [2018-12-03 16:51:23,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:51:22" (1/1) ... [2018-12-03 16:51:23,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:51:22" (1/1) ... [2018-12-03 16:51:23,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:51:23,059 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:51:23,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:51:23,060 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:51:23,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:51:22" (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:51:23,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 16:51:23,129 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 16:51:23,347 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:51:23,347 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:51:23,347 INFO L202 PluginConnector]: Adding new model LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:51:23 BoogieIcfgContainer [2018-12-03 16:51:23,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:51:23,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:51:23,350 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:51:23,355 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:51:23,355 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:51:22" (1/2) ... [2018-12-03 16:51:23,356 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2992fd05 and model type LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:51:23, skipping insertion in model container [2018-12-03 16:51:23,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "LexIndexValue-Pointer-Reduced.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:51:23" (2/2) ... [2018-12-03 16:51:23,359 INFO L112 eAbstractionObserver]: Analyzing ICFG LexIndexValue-Pointer-Reduced.bpl [2018-12-03 16:51:23,370 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:51:23,380 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:51:23,399 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:51:23,438 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:51:23,438 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:51:23,438 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:51:23,438 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:51:23,439 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:51:23,439 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:51:23,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:51:23,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:51:23,455 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:51:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 16:51:23,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:23,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 16:51:23,466 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:23,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:23,473 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-12-03 16:51:23,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:23,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:23,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:23,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:23,531 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:23,639 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:51:23,643 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:51:23,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-03 16:51:23,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:51:23,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 16:51:23,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 16:51:23,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:51:23,665 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 16:51:23,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:23,738 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:51:23,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 16:51:23,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 16:51:23,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:23,754 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:51:23,754 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:51:23,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 16:51:23,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:51:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:51:23,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:51:23,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:51:23,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-12-03 16:51:23,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:23,810 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:51:23,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 16:51:23,810 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:51:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:51:23,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:23,811 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 16:51:23,811 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:23,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:23,812 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-12-03 16:51:23,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:23,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:23,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:23,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:23,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:23,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:23,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:23,932 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:23,932 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:23,933 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 16:51:23,935 INFO L205 CegarAbsIntRunner]: [0], [4], [5], [6] [2018-12-03 16:51:23,978 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:51:23,978 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:51:24,149 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:51:24,151 INFO L272 AbstractInterpreter]: Visited 4 different actions 16 times. Merged at 3 different actions 10 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:51:24,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:24,168 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:51:24,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:24,168 INFO 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:51:24,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:24,181 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:24,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:24,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:24,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:24,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-03 16:51:24,365 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:24,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 16:51:24,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 16:51:24,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:51:24,367 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 6 states. [2018-12-03 16:51:24,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:24,425 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:51:24,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 16:51:24,426 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 5 [2018-12-03 16:51:24,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:24,426 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:51:24,427 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 16:51:24,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:51:24,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 16:51:24,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 16:51:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 16:51:24,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 16:51:24,432 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-12-03 16:51:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:24,432 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 16:51:24,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 16:51:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 16:51:24,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 16:51:24,433 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:24,433 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-12-03 16:51:24,434 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:24,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:24,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-12-03 16:51:24,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:24,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:24,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:24,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:24,436 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:24,517 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:51:24,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:24,518 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:24,518 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:24,519 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:24,519 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:24,519 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:24,530 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:24,530 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:24,577 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 16:51:24,577 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:24,579 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:24,698 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:51:24,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:24,902 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:51:24,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:24,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-03 16:51:24,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:24,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:51:24,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:51:24,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:51:24,929 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 8 states. [2018-12-03 16:51:24,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:24,969 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 16:51:24,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:51:24,970 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2018-12-03 16:51:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:24,971 INFO L225 Difference]: With dead ends: 11 [2018-12-03 16:51:24,972 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 16:51:24,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-03 16:51:24,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 16:51:24,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 16:51:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 16:51:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 16:51:24,976 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-12-03 16:51:24,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:24,976 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 16:51:24,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:51:24,977 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 16:51:24,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 16:51:24,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:24,978 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-12-03 16:51:24,978 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:24,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:24,978 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-12-03 16:51:24,979 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:24,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:24,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:24,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:24,980 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:25,069 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:25,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:25,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:25,071 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:25,071 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:25,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:25,071 INFO 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:51:25,080 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:25,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:25,092 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:25,092 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:25,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:25,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:25,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:25,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:25,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-03 16:51:25,342 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:25,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:51:25,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:51:25,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:51:25,343 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 10 states. [2018-12-03 16:51:25,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:25,391 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 16:51:25,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:51:25,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2018-12-03 16:51:25,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:25,393 INFO L225 Difference]: With dead ends: 13 [2018-12-03 16:51:25,393 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 16:51:25,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:51:25,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 16:51:25,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 16:51:25,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 16:51:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 16:51:25,398 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-12-03 16:51:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:25,399 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 16:51:25,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:51:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 16:51:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 16:51:25,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:25,399 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-12-03 16:51:25,400 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:25,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:25,400 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-12-03 16:51:25,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:25,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:25,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:25,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:25,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:25,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:25,552 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:25,552 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:25,552 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:25,552 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:25,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 16:51:25,553 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:25,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 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:51:25,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:25,562 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:25,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:25,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:25,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:25,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:26,127 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:26,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:26,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-03 16:51:26,146 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:26,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 16:51:26,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 16:51:26,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:51:26,148 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 12 states. [2018-12-03 16:51:26,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:26,220 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-03 16:51:26,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 16:51:26,220 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 11 [2018-12-03 16:51:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:26,221 INFO L225 Difference]: With dead ends: 15 [2018-12-03 16:51:26,221 INFO L226 Difference]: Without dead ends: 14 [2018-12-03 16:51:26,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-03 16:51:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-03 16:51:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-12-03 16:51:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-12-03 16:51:26,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-12-03 16:51:26,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-12-03 16:51:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:26,226 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-12-03 16:51:26,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 16:51:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-12-03 16:51:26,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 16:51:26,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:26,227 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-12-03 16:51:26,228 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:26,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-12-03 16:51:26,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:26,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:26,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:26,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:26,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:26,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:26,375 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:26,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:26,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:26,376 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:26,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:26,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:26,376 INFO 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:51:26,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:26,385 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:26,395 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 16:51:26,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:26,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:26,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:26,649 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:26,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:26,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-03 16:51:26,673 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:26,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:51:26,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:51:26,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:51:26,675 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 14 states. [2018-12-03 16:51:26,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:26,745 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-12-03 16:51:26,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 16:51:26,747 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 13 [2018-12-03 16:51:26,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:26,749 INFO L225 Difference]: With dead ends: 17 [2018-12-03 16:51:26,749 INFO L226 Difference]: Without dead ends: 16 [2018-12-03 16:51:26,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-03 16:51:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-03 16:51:26,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-03 16:51:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-03 16:51:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-03 16:51:26,754 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-12-03 16:51:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:26,754 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-03 16:51:26,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:51:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-03 16:51:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 16:51:26,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:26,755 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-12-03 16:51:26,755 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:26,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:26,756 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-12-03 16:51:26,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:26,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:26,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:26,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:26,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:26,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:26,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:26,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:26,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:26,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 16:51:26,873 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:26,873 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:26,886 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:26,887 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:26,905 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:26,906 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:26,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:27,029 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:27,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:27,186 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:27,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:27,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-03 16:51:27,206 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:27,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 16:51:27,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 16:51:27,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:51:27,207 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 16 states. [2018-12-03 16:51:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:27,298 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-12-03 16:51:27,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:51:27,299 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 15 [2018-12-03 16:51:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:27,300 INFO L225 Difference]: With dead ends: 19 [2018-12-03 16:51:27,300 INFO L226 Difference]: Without dead ends: 18 [2018-12-03 16:51:27,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:51:27,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-12-03 16:51:27,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-12-03 16:51:27,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-12-03 16:51:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-12-03 16:51:27,306 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-12-03 16:51:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:27,306 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-12-03 16:51:27,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 16:51:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-12-03 16:51:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 16:51:27,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:27,307 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-12-03 16:51:27,307 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:27,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:27,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-12-03 16:51:27,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:27,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:27,309 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:27,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:27,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:27,421 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:27,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:27,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:27,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:27,422 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:27,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:27,423 INFO 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:51:27,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:27,433 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:27,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:27,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:27,625 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:27,625 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:27,811 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:27,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:27,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2018-12-03 16:51:27,830 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:27,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 16:51:27,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 16:51:27,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:51:27,832 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 18 states. [2018-12-03 16:51:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:27,885 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-03 16:51:27,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 16:51:27,886 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 17 [2018-12-03 16:51:27,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:27,887 INFO L225 Difference]: With dead ends: 21 [2018-12-03 16:51:27,887 INFO L226 Difference]: Without dead ends: 20 [2018-12-03 16:51:27,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-03 16:51:27,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-03 16:51:27,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-03 16:51:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-03 16:51:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-12-03 16:51:27,893 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-12-03 16:51:27,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:27,893 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-12-03 16:51:27,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 16:51:27,894 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-12-03 16:51:27,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 16:51:27,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:27,894 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-12-03 16:51:27,895 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:27,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:27,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-12-03 16:51:27,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:27,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:27,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:27,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:27,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:28,123 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:28,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:28,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:28,124 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:28,124 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:28,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:28,124 INFO 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:51:28,134 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:28,134 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:28,145 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 16:51:28,145 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:28,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:28,331 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:28,536 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:28,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:28,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2018-12-03 16:51:28,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:28,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 16:51:28,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 16:51:28,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:51:28,559 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 20 states. [2018-12-03 16:51:28,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:28,634 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-12-03 16:51:28,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 16:51:28,635 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 19 [2018-12-03 16:51:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:28,636 INFO L225 Difference]: With dead ends: 23 [2018-12-03 16:51:28,636 INFO L226 Difference]: Without dead ends: 22 [2018-12-03 16:51:28,638 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-03 16:51:28,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-03 16:51:28,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-03 16:51:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-03 16:51:28,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-03 16:51:28,642 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-12-03 16:51:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:28,643 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-03 16:51:28,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 16:51:28,643 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-03 16:51:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 16:51:28,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:28,644 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-12-03 16:51:28,644 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:28,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:28,645 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-12-03 16:51:28,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:28,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:28,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:28,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:28,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:28,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:28,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:28,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:28,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:28,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:28,824 INFO 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:51:28,841 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:28,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:28,852 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:28,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:28,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:29,115 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:29,116 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:29,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:29,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-03 16:51:29,591 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:29,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:51:29,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:51:29,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:51:29,594 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 22 states. [2018-12-03 16:51:29,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:29,809 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-12-03 16:51:29,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 16:51:29,810 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 21 [2018-12-03 16:51:29,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:29,810 INFO L225 Difference]: With dead ends: 25 [2018-12-03 16:51:29,813 INFO L226 Difference]: Without dead ends: 24 [2018-12-03 16:51:29,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-03 16:51:29,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-12-03 16:51:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-12-03 16:51:29,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-03 16:51:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-12-03 16:51:29,822 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-12-03 16:51:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:29,822 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-12-03 16:51:29,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:51:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-12-03 16:51:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 16:51:29,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:29,823 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-12-03 16:51:29,823 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:29,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-12-03 16:51:29,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:29,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:29,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:29,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:29,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:29,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:30,124 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:30,124 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:30,124 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:30,125 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:30,125 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:30,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:30,125 INFO 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:51:30,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:30,135 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:30,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:30,327 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:30,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:30,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:30,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2018-12-03 16:51:30,785 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:30,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 16:51:30,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 16:51:30,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:51:30,787 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 24 states. [2018-12-03 16:51:31,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:31,145 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-03 16:51:31,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:51:31,145 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 23 [2018-12-03 16:51:31,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:31,146 INFO L225 Difference]: With dead ends: 27 [2018-12-03 16:51:31,146 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 16:51:31,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 16:51:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 16:51:31,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 16:51:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 16:51:31,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-12-03 16:51:31,152 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-12-03 16:51:31,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:31,153 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-12-03 16:51:31,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 16:51:31,153 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-12-03 16:51:31,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-03 16:51:31,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:31,154 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-12-03 16:51:31,154 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:31,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:31,154 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-12-03 16:51:31,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:31,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:31,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:31,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:31,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:31,356 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:31,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:31,356 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:31,357 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:31,357 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:31,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:31,357 INFO 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:51:31,367 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:31,367 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:31,396 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 16:51:31,396 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:31,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:31,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:32,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:32,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2018-12-03 16:51:32,162 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:32,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 16:51:32,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 16:51:32,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:51:32,164 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 26 states. [2018-12-03 16:51:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:32,234 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-12-03 16:51:32,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 16:51:32,235 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 25 [2018-12-03 16:51:32,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:32,235 INFO L225 Difference]: With dead ends: 29 [2018-12-03 16:51:32,236 INFO L226 Difference]: Without dead ends: 28 [2018-12-03 16:51:32,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:51:32,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-12-03 16:51:32,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-12-03 16:51:32,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-03 16:51:32,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-03 16:51:32,242 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-12-03 16:51:32,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:32,242 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-03 16:51:32,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 16:51:32,242 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-03 16:51:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-03 16:51:32,243 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:32,243 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-12-03 16:51:32,243 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:32,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:32,244 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-12-03 16:51:32,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:32,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:32,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:32,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:32,245 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:32,399 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:32,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:32,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:32,399 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:32,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:32,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:32,399 INFO 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:51:32,410 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:32,410 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:32,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:32,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:32,432 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:32,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:33,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:33,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2018-12-03 16:51:33,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:33,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 16:51:33,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 16:51:33,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:51:33,013 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 28 states. [2018-12-03 16:51:33,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:33,088 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-12-03 16:51:33,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 16:51:33,088 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 27 [2018-12-03 16:51:33,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:33,089 INFO L225 Difference]: With dead ends: 31 [2018-12-03 16:51:33,089 INFO L226 Difference]: Without dead ends: 30 [2018-12-03 16:51:33,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 16:51:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-03 16:51:33,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-03 16:51:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-03 16:51:33,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-12-03 16:51:33,095 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-12-03 16:51:33,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:33,095 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-12-03 16:51:33,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 16:51:33,096 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-12-03 16:51:33,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-03 16:51:33,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:33,097 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-12-03 16:51:33,097 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:33,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:33,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-12-03 16:51:33,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:33,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:33,098 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:33,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:33,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:33,292 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:33,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:33,292 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:33,293 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:33,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:33,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:33,293 INFO 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:51:33,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:33,303 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:33,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:33,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:33,547 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:34,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:34,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2018-12-03 16:51:34,538 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:34,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 16:51:34,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 16:51:34,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:51:34,540 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 30 states. [2018-12-03 16:51:34,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:34,613 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-03 16:51:34,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 16:51:34,613 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 29 [2018-12-03 16:51:34,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:34,614 INFO L225 Difference]: With dead ends: 33 [2018-12-03 16:51:34,615 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 16:51:34,616 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 16:51:34,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 16:51:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 16:51:34,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 16:51:34,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-12-03 16:51:34,622 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-12-03 16:51:34,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:34,622 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-12-03 16:51:34,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 16:51:34,622 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-12-03 16:51:34,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-03 16:51:34,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:34,623 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-12-03 16:51:34,623 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:34,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:34,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-12-03 16:51:34,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:34,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:34,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:34,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:34,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:34,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:34,823 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:51:34,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:34,823 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:34,824 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:34,824 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:34,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:34,824 INFO 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:51:34,841 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:34,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:34,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-03 16:51:34,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:34,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:35,795 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:51:35,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:36,410 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:51:36,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:36,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2018-12-03 16:51:36,431 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:36,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 16:51:36,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 16:51:36,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:51:36,433 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 32 states. [2018-12-03 16:51:36,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:36,600 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-12-03 16:51:36,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 16:51:36,600 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 31 [2018-12-03 16:51:36,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:36,601 INFO L225 Difference]: With dead ends: 35 [2018-12-03 16:51:36,602 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 16:51:36,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 16:51:36,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 16:51:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 16:51:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 16:51:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-03 16:51:36,609 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-12-03 16:51:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:36,610 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-03 16:51:36,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 16:51:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-03 16:51:36,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-03 16:51:36,611 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:36,611 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-12-03 16:51:36,611 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:36,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:36,612 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-12-03 16:51:36,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:36,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:36,613 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:36,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:36,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:36,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:36,886 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:36,886 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:36,886 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:36,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:36,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:51:36,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:36,887 INFO 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:51:36,896 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:36,897 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:36,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:36,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:36,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:37,367 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:37,367 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:37,764 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:37,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:37,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2018-12-03 16:51:37,785 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:37,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 16:51:37,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 16:51:37,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:51:37,787 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 34 states. [2018-12-03 16:51:37,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:37,926 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-12-03 16:51:37,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 16:51:37,927 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 33 [2018-12-03 16:51:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:37,928 INFO L225 Difference]: With dead ends: 37 [2018-12-03 16:51:37,928 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 16:51:37,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-03 16:51:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 16:51:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-12-03 16:51:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 16:51:37,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-12-03 16:51:37,934 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-12-03 16:51:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:37,934 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-12-03 16:51:37,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 16:51:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-12-03 16:51:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-03 16:51:37,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:37,935 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-12-03 16:51:37,935 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:37,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-12-03 16:51:37,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:37,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:37,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:37,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:37,936 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:38,473 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:38,474 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:38,474 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:38,474 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:38,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:38,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:38,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 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:51:38,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:38,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:38,498 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:38,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:39,171 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:39,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:39,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2018-12-03 16:51:39,190 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:39,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 16:51:39,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 16:51:39,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:51:39,192 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 36 states. [2018-12-03 16:51:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:39,276 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-03 16:51:39,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 16:51:39,276 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 35 [2018-12-03 16:51:39,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:39,277 INFO L225 Difference]: With dead ends: 39 [2018-12-03 16:51:39,277 INFO L226 Difference]: Without dead ends: 38 [2018-12-03 16:51:39,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 16:51:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-03 16:51:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-12-03 16:51:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-12-03 16:51:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-12-03 16:51:39,284 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-12-03 16:51:39,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:39,285 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-12-03 16:51:39,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 16:51:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-12-03 16:51:39,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 16:51:39,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:39,286 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-12-03 16:51:39,286 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:39,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:39,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-12-03 16:51:39,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:39,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:39,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:39,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:39,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:39,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:39,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:39,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:39,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:39,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:39,569 INFO 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:51:39,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:39,578 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:39,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 16:51:39,593 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:39,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:39,903 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:40,321 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:40,340 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:40,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2018-12-03 16:51:40,341 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:40,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:51:40,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:51:40,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:51:40,343 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 38 states. [2018-12-03 16:51:40,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:40,576 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-12-03 16:51:40,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 16:51:40,576 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 37 [2018-12-03 16:51:40,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:40,577 INFO L225 Difference]: With dead ends: 41 [2018-12-03 16:51:40,577 INFO L226 Difference]: Without dead ends: 40 [2018-12-03 16:51:40,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 16:51:40,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-12-03 16:51:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-03 16:51:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-03 16:51:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-03 16:51:40,585 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-12-03 16:51:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:40,585 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-03 16:51:40,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:51:40,585 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-03 16:51:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 16:51:40,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:40,586 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-12-03 16:51:40,586 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:40,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:40,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-12-03 16:51:40,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:40,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:40,588 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:40,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:40,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:40,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:41,037 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:41,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:41,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:41,038 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:41,038 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:41,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:41,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:41,047 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:41,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:41,061 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:41,061 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:41,063 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:41,328 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:41,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:41,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:41,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2018-12-03 16:51:41,891 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:41,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 16:51:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 16:51:41,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:51:41,893 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 40 states. [2018-12-03 16:51:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:42,164 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-12-03 16:51:42,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:51:42,165 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 39 [2018-12-03 16:51:42,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:42,165 INFO L225 Difference]: With dead ends: 43 [2018-12-03 16:51:42,166 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 16:51:42,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 16:51:42,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 16:51:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-03 16:51:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-03 16:51:42,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-12-03 16:51:42,170 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-12-03 16:51:42,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:42,170 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-12-03 16:51:42,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 16:51:42,171 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-12-03 16:51:42,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 16:51:42,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:42,171 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-12-03 16:51:42,172 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:42,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:42,172 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-12-03 16:51:42,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:42,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:42,173 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:42,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:42,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:42,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:42,444 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:42,444 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:42,445 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:42,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:42,445 INFO 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:51:42,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:42,453 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:42,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:42,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:43,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:43,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2018-12-03 16:51:43,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:43,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 16:51:43,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 16:51:43,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:51:43,585 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 42 states. [2018-12-03 16:51:43,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:43,686 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-03 16:51:43,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 16:51:43,687 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 41 [2018-12-03 16:51:43,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:43,688 INFO L225 Difference]: With dead ends: 45 [2018-12-03 16:51:43,688 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 16:51:43,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-03 16:51:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 16:51:43,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-12-03 16:51:43,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-03 16:51:43,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-12-03 16:51:43,695 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-12-03 16:51:43,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:43,695 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-12-03 16:51:43,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 16:51:43,695 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-12-03 16:51:43,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 16:51:43,696 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:43,696 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-12-03 16:51:43,696 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:43,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:43,697 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-12-03 16:51:43,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:43,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:43,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:43,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:43,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:43,968 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:43,968 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:43,968 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:43,969 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:43,969 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:43,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:43,969 INFO 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:51:43,978 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:43,978 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:43,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-03 16:51:43,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:44,001 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:44,330 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:44,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:44,878 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:44,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:44,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2018-12-03 16:51:44,897 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:44,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 16:51:44,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 16:51:44,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:51:44,899 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 44 states. [2018-12-03 16:51:44,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:44,989 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-12-03 16:51:44,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 16:51:44,990 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 43 [2018-12-03 16:51:44,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:44,990 INFO L225 Difference]: With dead ends: 47 [2018-12-03 16:51:44,990 INFO L226 Difference]: Without dead ends: 46 [2018-12-03 16:51:44,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 16:51:44,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-03 16:51:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-12-03 16:51:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 16:51:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-03 16:51:44,998 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-12-03 16:51:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:44,998 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-03 16:51:44,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 16:51:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-03 16:51:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 16:51:44,999 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:44,999 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-12-03 16:51:45,000 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:45,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:45,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-12-03 16:51:45,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:45,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:45,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:45,001 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:45,896 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:45,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:45,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:45,897 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:45,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:45,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:45,898 INFO 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:51:45,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:45,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:45,919 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:45,919 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:45,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:46,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:47,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:47,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-03 16:51:47,144 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:47,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 16:51:47,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 16:51:47,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:51:47,146 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 46 states. [2018-12-03 16:51:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:47,249 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-12-03 16:51:47,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-03 16:51:47,253 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 45 [2018-12-03 16:51:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:47,253 INFO L225 Difference]: With dead ends: 49 [2018-12-03 16:51:47,253 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 16:51:47,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 16:51:47,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 16:51:47,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-12-03 16:51:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-12-03 16:51:47,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-12-03 16:51:47,258 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-12-03 16:51:47,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:47,259 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-12-03 16:51:47,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 16:51:47,259 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-12-03 16:51:47,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 16:51:47,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:47,260 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-12-03 16:51:47,260 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:47,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:47,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-12-03 16:51:47,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:47,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:47,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:47,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:47,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:47,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:47,610 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:47,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:47,610 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:47,611 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:47,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:47,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:47,611 INFO 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:51:47,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:47,621 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:47,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:49,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:49,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:49,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2018-12-03 16:51:49,952 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:49,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 16:51:49,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 16:51:49,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:51:49,954 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 48 states. [2018-12-03 16:51:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:50,068 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-03 16:51:50,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 16:51:50,068 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 47 [2018-12-03 16:51:50,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:50,069 INFO L225 Difference]: With dead ends: 51 [2018-12-03 16:51:50,069 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 16:51:50,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:51:50,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 16:51:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 16:51:50,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 16:51:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-12-03 16:51:50,075 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-12-03 16:51:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:50,075 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-12-03 16:51:50,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 16:51:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-12-03 16:51:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 16:51:50,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:50,076 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-12-03 16:51:50,076 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:50,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:50,076 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-12-03 16:51:50,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:50,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:50,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:50,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:50,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:50,533 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:50,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:50,534 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:50,534 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:50,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:50,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:50,534 INFO 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:51:50,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:50,543 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:50,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 16:51:50,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:50,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:50,965 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:50,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:51,949 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:51,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:51,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2018-12-03 16:51:51,968 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:51,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 16:51:51,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 16:51:51,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:51:51,970 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 50 states. [2018-12-03 16:51:52,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:52,119 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-12-03 16:51:52,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 16:51:52,120 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 49 [2018-12-03 16:51:52,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:52,121 INFO L225 Difference]: With dead ends: 53 [2018-12-03 16:51:52,121 INFO L226 Difference]: Without dead ends: 52 [2018-12-03 16:51:52,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 16:51:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-12-03 16:51:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-12-03 16:51:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-03 16:51:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-03 16:51:52,127 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-12-03 16:51:52,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:52,127 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-03 16:51:52,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 16:51:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-03 16:51:52,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 16:51:52,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:52,128 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-12-03 16:51:52,129 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:52,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:52,129 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-12-03 16:51:52,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:52,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:52,130 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:52,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:52,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:52,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:52,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:52,598 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:52,598 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:52,598 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:52,598 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:52,606 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:52,607 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:52,620 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:52,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:52,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:53,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:53,868 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:53,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:53,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2018-12-03 16:51:53,888 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:53,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 16:51:53,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 16:51:53,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:51:53,889 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 52 states. [2018-12-03 16:51:54,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:54,011 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-12-03 16:51:54,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 16:51:54,012 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 51 [2018-12-03 16:51:54,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:54,013 INFO L225 Difference]: With dead ends: 55 [2018-12-03 16:51:54,013 INFO L226 Difference]: Without dead ends: 54 [2018-12-03 16:51:54,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-03 16:51:54,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-03 16:51:54,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-03 16:51:54,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 16:51:54,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-12-03 16:51:54,019 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-12-03 16:51:54,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:54,019 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-12-03 16:51:54,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 16:51:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-12-03 16:51:54,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 16:51:54,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:54,020 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-12-03 16:51:54,021 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:54,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:54,021 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-12-03 16:51:54,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:54,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:54,022 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:54,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:54,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:54,398 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:54,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:54,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:54,399 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:54,399 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:54,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:54,399 INFO 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:51:54,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:54,407 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:51:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:54,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:54,983 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:54,983 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:56,440 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:56,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:56,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2018-12-03 16:51:56,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:56,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 16:51:56,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 16:51:56,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:51:56,462 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 54 states. [2018-12-03 16:51:56,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:56,662 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-03 16:51:56,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-03 16:51:56,663 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 53 [2018-12-03 16:51:56,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:56,663 INFO L225 Difference]: With dead ends: 57 [2018-12-03 16:51:56,663 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 16:51:56,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 16:51:56,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 16:51:56,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-03 16:51:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-03 16:51:56,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-12-03 16:51:56,670 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-12-03 16:51:56,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:56,670 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-12-03 16:51:56,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 16:51:56,670 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-12-03 16:51:56,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 16:51:56,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:56,671 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-12-03 16:51:56,672 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:56,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:56,672 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-12-03 16:51:56,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:56,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:56,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:51:56,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:56,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:57,194 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:57,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:57,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:57,195 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:57,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:57,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:57,195 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:51:57,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:51:57,205 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:51:57,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-03 16:51:57,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:57,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:57,692 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:51:58,561 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:58,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:51:58,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2018-12-03 16:51:58,582 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:51:58,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 16:51:58,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 16:51:58,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:51:58,583 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 56 states. [2018-12-03 16:51:58,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:51:58,698 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-12-03 16:51:58,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 16:51:58,699 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 55 [2018-12-03 16:51:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:51:58,699 INFO L225 Difference]: With dead ends: 59 [2018-12-03 16:51:58,700 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 16:51:58,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-03 16:51:58,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 16:51:58,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-12-03 16:51:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-03 16:51:58,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-03 16:51:58,704 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-12-03 16:51:58,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:51:58,705 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-03 16:51:58,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 16:51:58,705 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-03 16:51:58,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-03 16:51:58,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:51:58,705 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-12-03 16:51:58,706 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:51:58,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:51:58,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-12-03 16:51:58,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:51:58,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:58,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:51:58,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:51:58,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:51:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:51:59,193 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:59,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:59,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:51:59,194 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:51:59,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:51:59,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:51:59,194 INFO 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:51:59,203 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:51:59,203 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:51:59,220 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:51:59,220 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:51:59,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:51:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:51:59,702 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:00,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:00,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-03 16:52:00,629 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:00,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 16:52:00,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 16:52:00,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:52:00,631 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 58 states. [2018-12-03 16:52:00,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:00,789 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-12-03 16:52:00,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 16:52:00,790 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 57 [2018-12-03 16:52:00,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:00,791 INFO L225 Difference]: With dead ends: 61 [2018-12-03 16:52:00,791 INFO L226 Difference]: Without dead ends: 60 [2018-12-03 16:52:00,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-03 16:52:00,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-03 16:52:00,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-12-03 16:52:00,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-12-03 16:52:00,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-12-03 16:52:00,796 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-12-03 16:52:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:00,796 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-12-03 16:52:00,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 16:52:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-12-03 16:52:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 16:52:00,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:00,797 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-12-03 16:52:00,797 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:00,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:00,798 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-12-03 16:52:00,798 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:00,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:00,799 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:00,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:00,799 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:01,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:01,653 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:01,653 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:01,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:01,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:01,654 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:01,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:01,663 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:01,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:01,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:02,229 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:02,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:03,302 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:03,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:03,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2018-12-03 16:52:03,321 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:03,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 16:52:03,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 16:52:03,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 16:52:03,322 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 60 states. [2018-12-03 16:52:03,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:03,496 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-03 16:52:03,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 16:52:03,496 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2018-12-03 16:52:03,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:03,497 INFO L225 Difference]: With dead ends: 63 [2018-12-03 16:52:03,497 INFO L226 Difference]: Without dead ends: 62 [2018-12-03 16:52:03,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-03 16:52:03,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-03 16:52:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-12-03 16:52:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-12-03 16:52:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-12-03 16:52:03,503 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-12-03 16:52:03,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:03,503 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-12-03 16:52:03,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 16:52:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-12-03 16:52:03,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 16:52:03,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:03,504 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-12-03 16:52:03,504 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:03,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:03,504 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-12-03 16:52:03,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:03,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:03,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:03,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:04,011 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:04,011 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:04,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:04,011 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:04,011 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:04,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:04,012 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:04,020 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:04,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:04,048 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 16:52:04,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:04,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:04,683 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:04,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:05,762 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:05,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:05,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2018-12-03 16:52:05,781 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:05,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 16:52:05,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 16:52:05,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:52:05,783 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 62 states. [2018-12-03 16:52:05,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:05,968 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-12-03 16:52:05,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-03 16:52:05,969 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 61 [2018-12-03 16:52:05,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:05,970 INFO L225 Difference]: With dead ends: 65 [2018-12-03 16:52:05,970 INFO L226 Difference]: Without dead ends: 64 [2018-12-03 16:52:05,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 16:52:05,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-03 16:52:05,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-12-03 16:52:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 16:52:05,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-03 16:52:05,975 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-12-03 16:52:05,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:05,975 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-03 16:52:05,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 16:52:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-03 16:52:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-03 16:52:05,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:05,976 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-12-03 16:52:05,976 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:05,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-12-03 16:52:05,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:05,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:05,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:05,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:05,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:06,624 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:06,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:06,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:06,624 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:06,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:06,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:06,625 INFO 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:52:06,634 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:06,635 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:06,651 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:06,651 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:06,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:07,289 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:07,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:08,541 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:08,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:08,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2018-12-03 16:52:08,561 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:08,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 16:52:08,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 16:52:08,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 16:52:08,563 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 64 states. [2018-12-03 16:52:08,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:08,714 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-12-03 16:52:08,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 16:52:08,714 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 63 [2018-12-03 16:52:08,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:08,715 INFO L225 Difference]: With dead ends: 67 [2018-12-03 16:52:08,716 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 16:52:08,717 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 16:52:08,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 16:52:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-03 16:52:08,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-03 16:52:08,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-12-03 16:52:08,721 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-12-03 16:52:08,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:08,721 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-12-03 16:52:08,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 16:52:08,722 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-12-03 16:52:08,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 16:52:08,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:08,723 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-12-03 16:52:08,723 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:08,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:08,723 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-12-03 16:52:08,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:08,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:08,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:08,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:08,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:09,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:09,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:09,493 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:09,493 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:09,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:09,493 INFO 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:52:09,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:09,504 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:09,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:10,127 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:10,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:11,392 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:11,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:11,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2018-12-03 16:52:11,410 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:11,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 16:52:11,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 16:52:11,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:52:11,412 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 66 states. [2018-12-03 16:52:11,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:11,608 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-03 16:52:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 16:52:11,609 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 65 [2018-12-03 16:52:11,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:11,609 INFO L225 Difference]: With dead ends: 69 [2018-12-03 16:52:11,610 INFO L226 Difference]: Without dead ends: 68 [2018-12-03 16:52:11,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-03 16:52:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-03 16:52:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-12-03 16:52:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-03 16:52:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-12-03 16:52:11,614 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-12-03 16:52:11,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:11,615 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-12-03 16:52:11,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 16:52:11,615 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-12-03 16:52:11,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 16:52:11,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:11,616 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-12-03 16:52:11,616 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:11,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:11,616 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-12-03 16:52:11,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:11,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:11,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:11,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:11,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:11,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:12,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:12,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:12,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:12,218 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:12,218 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:12,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:12,218 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:12,227 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:12,228 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:12,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-03 16:52:12,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:12,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:13,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:13,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:14,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:14,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:14,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2018-12-03 16:52:14,433 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:14,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 16:52:14,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 16:52:14,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 16:52:14,435 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 68 states. [2018-12-03 16:52:14,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:14,564 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-12-03 16:52:14,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 16:52:14,565 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 67 [2018-12-03 16:52:14,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:14,566 INFO L225 Difference]: With dead ends: 71 [2018-12-03 16:52:14,566 INFO L226 Difference]: Without dead ends: 70 [2018-12-03 16:52:14,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-03 16:52:14,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-03 16:52:14,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-12-03 16:52:14,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-03 16:52:14,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-03 16:52:14,570 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-12-03 16:52:14,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:14,570 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-03 16:52:14,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 16:52:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-03 16:52:14,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-03 16:52:14,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:14,571 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-12-03 16:52:14,571 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:14,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:14,572 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-12-03 16:52:14,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:14,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:14,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:14,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:14,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:15,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:15,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:15,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:15,336 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:15,336 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:15,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:15,336 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:15,346 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:15,346 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:15,367 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:15,367 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:15,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:16,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:16,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:17,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:17,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-03 16:52:17,977 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:17,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:52:17,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:52:17,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:52:17,978 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 70 states. [2018-12-03 16:52:18,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:18,158 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-12-03 16:52:18,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-03 16:52:18,158 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 69 [2018-12-03 16:52:18,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:18,159 INFO L225 Difference]: With dead ends: 73 [2018-12-03 16:52:18,160 INFO L226 Difference]: Without dead ends: 72 [2018-12-03 16:52:18,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 16:52:18,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-03 16:52:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-12-03 16:52:18,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-03 16:52:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-12-03 16:52:18,164 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-12-03 16:52:18,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:18,164 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-12-03 16:52:18,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:52:18,164 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-12-03 16:52:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-03 16:52:18,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:18,165 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-12-03 16:52:18,165 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:18,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:18,165 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-12-03 16:52:18,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:18,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:18,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:18,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:18,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:18,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:18,945 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:18,946 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:18,946 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:18,946 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:18,946 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:18,946 INFO 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:52:18,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:18,955 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:18,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:19,657 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:21,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:21,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:21,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2018-12-03 16:52:21,103 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:21,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 16:52:21,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 16:52:21,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 16:52:21,105 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 72 states. [2018-12-03 16:52:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:21,247 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-03 16:52:21,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:52:21,248 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 71 [2018-12-03 16:52:21,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:21,249 INFO L225 Difference]: With dead ends: 75 [2018-12-03 16:52:21,249 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 16:52:21,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-03 16:52:21,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 16:52:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 16:52:21,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 16:52:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-12-03 16:52:21,254 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-12-03 16:52:21,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:21,254 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-12-03 16:52:21,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 16:52:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-12-03 16:52:21,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 16:52:21,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:21,255 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-12-03 16:52:21,255 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:21,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:21,256 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-12-03 16:52:21,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:21,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:21,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:21,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:21,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:22,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:22,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:22,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:22,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:22,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:22,484 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:22,493 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:22,493 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:22,526 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 16:52:22,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:22,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:23,337 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:24,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:24,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2018-12-03 16:52:24,947 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:24,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-03 16:52:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-03 16:52:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:52:24,949 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 74 states. [2018-12-03 16:52:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:25,274 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-12-03 16:52:25,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 16:52:25,274 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 73 [2018-12-03 16:52:25,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:25,275 INFO L225 Difference]: With dead ends: 77 [2018-12-03 16:52:25,276 INFO L226 Difference]: Without dead ends: 76 [2018-12-03 16:52:25,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-03 16:52:25,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-03 16:52:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-12-03 16:52:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-03 16:52:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-03 16:52:25,280 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-12-03 16:52:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:25,281 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-03 16:52:25,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-03 16:52:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-03 16:52:25,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 16:52:25,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:25,282 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-12-03 16:52:25,282 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:25,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:25,282 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-12-03 16:52:25,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:25,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:25,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:25,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:25,283 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:26,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:26,013 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:26,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:26,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:26,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:26,014 INFO 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:52:26,024 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:26,024 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:26,047 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:26,047 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:26,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:26,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:28,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:28,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:28,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2018-12-03 16:52:28,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:28,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-03 16:52:28,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-03 16:52:28,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 16:52:28,868 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 76 states. [2018-12-03 16:52:29,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:29,026 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-12-03 16:52:29,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 16:52:29,027 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 75 [2018-12-03 16:52:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:29,028 INFO L225 Difference]: With dead ends: 79 [2018-12-03 16:52:29,028 INFO L226 Difference]: Without dead ends: 78 [2018-12-03 16:52:29,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-03 16:52:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-03 16:52:29,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-12-03 16:52:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-12-03 16:52:29,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-12-03 16:52:29,033 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-12-03 16:52:29,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:29,033 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-12-03 16:52:29,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-03 16:52:29,033 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-12-03 16:52:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-03 16:52:29,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:29,034 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-12-03 16:52:29,034 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:29,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-12-03 16:52:29,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:29,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:29,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:29,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:29,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:30,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:30,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:30,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:30,088 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:30,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:52:30,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:30,088 INFO 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:52:30,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:30,098 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:30,120 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:31,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:31,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:33,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:33,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2018-12-03 16:52:33,046 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:33,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 16:52:33,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 16:52:33,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:52:33,048 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 78 states. [2018-12-03 16:52:33,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:33,209 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-03 16:52:33,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-03 16:52:33,209 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 77 [2018-12-03 16:52:33,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:33,210 INFO L225 Difference]: With dead ends: 81 [2018-12-03 16:52:33,211 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 16:52:33,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 16:52:33,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 16:52:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 16:52:33,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 16:52:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-12-03 16:52:33,216 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-12-03 16:52:33,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:33,216 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-12-03 16:52:33,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 16:52:33,216 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-12-03 16:52:33,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 16:52:33,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:33,217 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-12-03 16:52:33,217 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:33,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:33,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-12-03 16:52:33,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:33,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:33,219 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:34,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:34,663 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:34,663 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:34,663 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:34,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:34,663 INFO 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:52:34,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:34,673 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:34,708 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-03 16:52:34,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:34,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:35,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:37,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:37,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2018-12-03 16:52:37,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:37,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-03 16:52:37,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-03 16:52:37,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 16:52:37,868 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 80 states. [2018-12-03 16:52:38,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:38,049 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-12-03 16:52:38,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 16:52:38,050 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 79 [2018-12-03 16:52:38,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:38,051 INFO L225 Difference]: With dead ends: 83 [2018-12-03 16:52:38,051 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 16:52:38,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 16:52:38,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 16:52:38,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-12-03 16:52:38,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-03 16:52:38,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-03 16:52:38,056 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-12-03 16:52:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:38,056 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-03 16:52:38,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-03 16:52:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-03 16:52:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 16:52:38,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:38,057 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-12-03 16:52:38,057 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:38,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:38,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-12-03 16:52:38,058 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:38,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:38,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:38,059 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:38,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:38,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:38,898 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:38,898 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:38,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:38,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:38,899 INFO 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:52:38,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:38,907 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:38,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:38,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:38,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:39,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:39,916 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:41,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:41,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-03 16:52:41,855 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:41,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-03 16:52:41,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-03 16:52:41,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:52:41,857 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 82 states. [2018-12-03 16:52:42,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:42,023 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-12-03 16:52:42,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 16:52:42,023 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 81 [2018-12-03 16:52:42,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:42,024 INFO L225 Difference]: With dead ends: 85 [2018-12-03 16:52:42,024 INFO L226 Difference]: Without dead ends: 84 [2018-12-03 16:52:42,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-03 16:52:42,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-12-03 16:52:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-12-03 16:52:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-12-03 16:52:42,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-12-03 16:52:42,029 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-12-03 16:52:42,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:42,029 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-12-03 16:52:42,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-03 16:52:42,029 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-12-03 16:52:42,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-03 16:52:42,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:42,030 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-12-03 16:52:42,030 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:42,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:42,031 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-12-03 16:52:42,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:42,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:42,032 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:42,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:42,032 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:43,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:43,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:43,058 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:43,058 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:43,058 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:43,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:43,058 INFO 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:52:43,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:43,067 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:43,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:44,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:46,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:46,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:46,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2018-12-03 16:52:46,183 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:46,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 16:52:46,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 16:52:46,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 16:52:46,185 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 84 states. [2018-12-03 16:52:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:46,416 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-03 16:52:46,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 16:52:46,417 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 83 [2018-12-03 16:52:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:46,418 INFO L225 Difference]: With dead ends: 87 [2018-12-03 16:52:46,418 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 16:52:46,419 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-03 16:52:46,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 16:52:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-12-03 16:52:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 16:52:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-12-03 16:52:46,423 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-12-03 16:52:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:46,423 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-12-03 16:52:46,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 16:52:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-12-03 16:52:46,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 16:52:46,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:46,424 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-12-03 16:52:46,424 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:46,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:46,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-12-03 16:52:46,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:46,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:46,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:46,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:46,425 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:46,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:47,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:47,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:47,251 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:47,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:47,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:47,251 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:52:47,260 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:52:47,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:52:47,297 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 16:52:47,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:47,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:48,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:48,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:50,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:50,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2018-12-03 16:52:50,737 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:50,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-03 16:52:50,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-03 16:52:50,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:52:50,740 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 86 states. [2018-12-03 16:52:51,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:51,030 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-12-03 16:52:51,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-03 16:52:51,030 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 85 [2018-12-03 16:52:51,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:51,031 INFO L225 Difference]: With dead ends: 89 [2018-12-03 16:52:51,032 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 16:52:51,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 16:52:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 16:52:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-12-03 16:52:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 16:52:51,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-03 16:52:51,037 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-12-03 16:52:51,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:51,037 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-03 16:52:51,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-03 16:52:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-03 16:52:51,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-03 16:52:51,039 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:51,039 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-12-03 16:52:51,039 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:51,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:51,039 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-12-03 16:52:51,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:51,040 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:51,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:51,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:51,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:51,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:51,995 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:51,995 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:51,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:51,995 INFO 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:52:52,003 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:52:52,003 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:52:52,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:52:52,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:52:52,027 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:53,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:53,384 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:52:55,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:55,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:52:55,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2018-12-03 16:52:55,874 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:52:55,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-03 16:52:55,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-03 16:52:55,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 16:52:55,876 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 88 states. [2018-12-03 16:52:56,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:52:56,099 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-12-03 16:52:56,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 16:52:56,099 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 87 [2018-12-03 16:52:56,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:52:56,100 INFO L225 Difference]: With dead ends: 91 [2018-12-03 16:52:56,101 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 16:52:56,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-03 16:52:56,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 16:52:56,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-12-03 16:52:56,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-03 16:52:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-12-03 16:52:56,106 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-12-03 16:52:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:52:56,107 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-12-03 16:52:56,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-03 16:52:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-12-03 16:52:56,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-03 16:52:56,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:52:56,108 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-12-03 16:52:56,108 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:52:56,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:52:56,108 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-12-03 16:52:56,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:52:56,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:56,109 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:52:56,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:52:56,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:52:56,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:57,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:57,121 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:52:57,121 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:52:57,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:52:57,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:52:57,121 INFO 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:52:57,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:52:57,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:52:57,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:52:57,153 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:52:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:52:58,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:00,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:00,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2018-12-03 16:53:00,806 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:00,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 16:53:00,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 16:53:00,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:53:00,809 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 90 states. [2018-12-03 16:53:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:01,070 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-03 16:53:01,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 16:53:01,070 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 89 [2018-12-03 16:53:01,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:01,071 INFO L225 Difference]: With dead ends: 93 [2018-12-03 16:53:01,071 INFO L226 Difference]: Without dead ends: 92 [2018-12-03 16:53:01,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:53:01,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-03 16:53:01,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-12-03 16:53:01,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-03 16:53:01,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-12-03 16:53:01,076 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-12-03 16:53:01,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:01,076 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-12-03 16:53:01,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 16:53:01,076 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-12-03 16:53:01,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-03 16:53:01,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:01,077 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-12-03 16:53:01,077 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:01,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:01,077 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-12-03 16:53:01,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:01,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:01,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:01,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:02,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:02,095 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:02,095 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:02,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:53:02,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:02,096 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:02,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:02,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:02,163 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-03 16:53:02,163 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:02,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:03,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:03,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:05,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:05,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:05,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2018-12-03 16:53:05,983 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:05,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-03 16:53:05,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-03 16:53:05,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 16:53:05,985 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 92 states. [2018-12-03 16:53:06,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:06,186 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-12-03 16:53:06,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 16:53:06,186 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 91 [2018-12-03 16:53:06,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:06,187 INFO L225 Difference]: With dead ends: 95 [2018-12-03 16:53:06,188 INFO L226 Difference]: Without dead ends: 94 [2018-12-03 16:53:06,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-03 16:53:06,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-12-03 16:53:06,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-12-03 16:53:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-03 16:53:06,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-03 16:53:06,193 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-12-03 16:53:06,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:06,193 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-03 16:53:06,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-03 16:53:06,194 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-03 16:53:06,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-03 16:53:06,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:06,194 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-12-03 16:53:06,195 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:06,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:06,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-12-03 16:53:06,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:06,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:06,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:06,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:06,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:06,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:07,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:07,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:07,258 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:07,259 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:07,259 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:07,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:07,259 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:07,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:07,270 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:07,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:07,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:07,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:08,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:08,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:11,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:11,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:11,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-03 16:53:11,584 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:11,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-03 16:53:11,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-03 16:53:11,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:53:11,586 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 94 states. [2018-12-03 16:53:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:11,790 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-12-03 16:53:11,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-03 16:53:11,790 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 93 [2018-12-03 16:53:11,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:11,791 INFO L225 Difference]: With dead ends: 97 [2018-12-03 16:53:11,791 INFO L226 Difference]: Without dead ends: 96 [2018-12-03 16:53:11,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-03 16:53:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-03 16:53:11,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-12-03 16:53:11,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-12-03 16:53:11,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-12-03 16:53:11,795 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-12-03 16:53:11,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:11,795 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-12-03 16:53:11,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-03 16:53:11,795 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-12-03 16:53:11,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-03 16:53:11,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:11,796 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-12-03 16:53:11,796 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:11,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:11,796 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-12-03 16:53:11,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:11,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:11,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:11,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:11,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:11,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:13,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:13,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:13,589 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:13,589 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:13,589 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:13,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:13,589 INFO 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:53:13,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:13,598 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:13,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:14,968 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:17,604 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:17,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:17,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2018-12-03 16:53:17,624 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:17,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 16:53:17,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 16:53:17,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 16:53:17,631 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 96 states. [2018-12-03 16:53:17,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:17,843 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-03 16:53:17,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 16:53:17,843 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 95 [2018-12-03 16:53:17,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:17,845 INFO L225 Difference]: With dead ends: 99 [2018-12-03 16:53:17,845 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 16:53:17,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 16:53:17,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 16:53:17,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-12-03 16:53:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-03 16:53:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-12-03 16:53:17,851 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-12-03 16:53:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:17,852 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-12-03 16:53:17,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 16:53:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-12-03 16:53:17,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-03 16:53:17,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:17,853 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-12-03 16:53:17,853 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:17,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:17,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-12-03 16:53:17,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:17,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:17,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:17,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:17,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:19,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:19,302 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:19,302 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:19,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:19,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:19,303 INFO 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:53:19,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:19,335 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:19,833 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 16:53:19,833 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:19,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:21,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:24,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:24,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2018-12-03 16:53:24,229 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:24,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-03 16:53:24,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-03 16:53:24,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:53:24,232 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 98 states. [2018-12-03 16:53:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:24,432 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-12-03 16:53:24,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 16:53:24,433 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 97 [2018-12-03 16:53:24,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:24,433 INFO L225 Difference]: With dead ends: 101 [2018-12-03 16:53:24,433 INFO L226 Difference]: Without dead ends: 100 [2018-12-03 16:53:24,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 16:53:24,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-03 16:53:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-12-03 16:53:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-03 16:53:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-03 16:53:24,439 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-12-03 16:53:24,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:24,439 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-03 16:53:24,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-03 16:53:24,439 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-03 16:53:24,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-03 16:53:24,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:24,440 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-12-03 16:53:24,440 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:24,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:24,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-12-03 16:53:24,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:24,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:24,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:24,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:24,442 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:25,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:25,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:25,575 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:25,575 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:25,575 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:25,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:25,575 INFO 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:53:25,583 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:25,583 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:25,607 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:25,608 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:25,610 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:26,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:26,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:30,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:30,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:30,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2018-12-03 16:53:30,110 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:30,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-03 16:53:30,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-03 16:53:30,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 16:53:30,113 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 100 states. [2018-12-03 16:53:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:30,315 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-12-03 16:53:30,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 16:53:30,316 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 99 [2018-12-03 16:53:30,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:30,317 INFO L225 Difference]: With dead ends: 103 [2018-12-03 16:53:30,317 INFO L226 Difference]: Without dead ends: 102 [2018-12-03 16:53:30,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-03 16:53:30,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-03 16:53:30,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-12-03 16:53:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-12-03 16:53:30,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-12-03 16:53:30,321 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-12-03 16:53:30,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:30,322 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-12-03 16:53:30,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-03 16:53:30,322 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-12-03 16:53:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-03 16:53:30,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:30,322 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-12-03 16:53:30,323 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:30,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:30,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-12-03 16:53:30,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:30,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:30,324 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:30,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:30,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:30,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:31,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,429 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:31,430 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:31,430 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:31,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:31,430 INFO 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:53:31,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:31,439 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:31,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:34,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:34,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:37,250 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:37,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:37,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2018-12-03 16:53:37,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:37,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 16:53:37,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 16:53:37,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:53:37,270 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 102 states. [2018-12-03 16:53:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:37,509 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-03 16:53:37,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-03 16:53:37,509 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 101 [2018-12-03 16:53:37,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:37,514 INFO L225 Difference]: With dead ends: 105 [2018-12-03 16:53:37,514 INFO L226 Difference]: Without dead ends: 104 [2018-12-03 16:53:37,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-03 16:53:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-03 16:53:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-12-03 16:53:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-03 16:53:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-12-03 16:53:37,519 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-12-03 16:53:37,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:37,519 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-12-03 16:53:37,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 16:53:37,520 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-12-03 16:53:37,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-03 16:53:37,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:37,520 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-12-03 16:53:37,521 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:37,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:37,521 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-12-03 16:53:37,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:37,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:37,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:37,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:37,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:39,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:39,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:39,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:39,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:53:39,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:39,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 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:53:39,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:53:39,187 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:53:39,255 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-03 16:53:39,255 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:39,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:40,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:44,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:44,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:44,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 153 [2018-12-03 16:53:44,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:44,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-03 16:53:44,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-03 16:53:44,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10660, Invalid=13210, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 16:53:44,120 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 104 states. [2018-12-03 16:53:45,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:45,217 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-12-03 16:53:45,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 16:53:45,217 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 103 [2018-12-03 16:53:45,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:45,218 INFO L225 Difference]: With dead ends: 107 [2018-12-03 16:53:45,219 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 16:53:45,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10302 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10660, Invalid=13210, Unknown=0, NotChecked=0, Total=23870 [2018-12-03 16:53:45,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 16:53:45,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-03 16:53:45,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-03 16:53:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-03 16:53:45,224 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-12-03 16:53:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:45,225 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-03 16:53:45,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-03 16:53:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-03 16:53:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-03 16:53:45,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:45,226 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-12-03 16:53:45,226 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:45,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:45,226 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-12-03 16:53:45,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:45,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:45,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:45,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:45,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:46,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:46,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:46,835 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:46,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:46,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:46,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:46,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:53:46,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:53:46,872 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:53:46,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:53:46,875 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:48,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:48,375 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:51,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:51,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 156 [2018-12-03 16:53:51,926 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:51,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-03 16:53:51,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-03 16:53:51,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11077, Invalid=13729, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:53:51,929 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 106 states. [2018-12-03 16:53:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:52,179 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-12-03 16:53:52,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 16:53:52,180 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 105 [2018-12-03 16:53:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:52,181 INFO L225 Difference]: With dead ends: 109 [2018-12-03 16:53:52,181 INFO L226 Difference]: Without dead ends: 108 [2018-12-03 16:53:52,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10712 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=11077, Invalid=13729, Unknown=0, NotChecked=0, Total=24806 [2018-12-03 16:53:52,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-03 16:53:52,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-12-03 16:53:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-12-03 16:53:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-12-03 16:53:52,189 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-12-03 16:53:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:52,189 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-12-03 16:53:52,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-03 16:53:52,189 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-12-03 16:53:52,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-12-03 16:53:52,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:52,190 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-12-03 16:53:52,190 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:52,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:52,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-12-03 16:53:52,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:52,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:52,191 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:53:52,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:52,192 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:53,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:53,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:53,476 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:53:53,476 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:53:53,477 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:53:53,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:53:53,477 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:53:53,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:53,486 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:53:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:53:53,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:53:55,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:55,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:53:58,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:53:58,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:53:58,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 159 [2018-12-03 16:53:58,841 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:53:58,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 16:53:58,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 16:53:58,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11502, Invalid=14258, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 16:53:58,845 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 108 states. [2018-12-03 16:53:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:53:59,166 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-03 16:53:59,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 16:53:59,166 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 107 [2018-12-03 16:53:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:53:59,167 INFO L225 Difference]: With dead ends: 111 [2018-12-03 16:53:59,167 INFO L226 Difference]: Without dead ends: 110 [2018-12-03 16:53:59,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11130 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=11502, Invalid=14258, Unknown=0, NotChecked=0, Total=25760 [2018-12-03 16:53:59,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-03 16:53:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-03 16:53:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-03 16:53:59,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-12-03 16:53:59,172 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-12-03 16:53:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:53:59,172 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-12-03 16:53:59,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 16:53:59,173 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-12-03 16:53:59,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-12-03 16:53:59,173 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:53:59,173 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-12-03 16:53:59,174 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:53:59,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:53:59,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-12-03 16:53:59,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:53:59,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:59,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:53:59,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:53:59,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:53:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:00,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:00,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:00,590 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:00,590 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:00,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:00,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:00,590 INFO 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:54:00,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:00,604 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:00,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 16:54:00,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:00,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:02,273 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:02,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:05,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:05,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:05,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 162 [2018-12-03 16:54:05,988 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:05,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-03 16:54:05,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-03 16:54:05,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=14797, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:54:05,991 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 110 states. [2018-12-03 16:54:06,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:06,218 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-12-03 16:54:06,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-03 16:54:06,218 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 109 [2018-12-03 16:54:06,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:06,219 INFO L225 Difference]: With dead ends: 113 [2018-12-03 16:54:06,219 INFO L226 Difference]: Without dead ends: 112 [2018-12-03 16:54:06,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11556 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=11935, Invalid=14797, Unknown=0, NotChecked=0, Total=26732 [2018-12-03 16:54:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-03 16:54:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-12-03 16:54:06,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-03 16:54:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-03 16:54:06,224 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-12-03 16:54:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:06,224 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-03 16:54:06,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-03 16:54:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-03 16:54:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-03 16:54:06,225 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:06,225 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-12-03 16:54:06,225 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:06,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:06,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-12-03 16:54:06,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:06,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:06,226 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:06,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:06,226 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:07,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:07,643 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:07,643 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:07,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:07,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:07,643 INFO 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:54:07,654 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:07,654 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:07,685 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:07,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:07,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:09,447 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:13,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:13,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:13,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 165 [2018-12-03 16:54:13,165 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:13,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-03 16:54:13,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-03 16:54:13,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12376, Invalid=15346, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 16:54:13,167 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 112 states. [2018-12-03 16:54:14,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:14,510 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-12-03 16:54:14,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 16:54:14,510 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 111 [2018-12-03 16:54:14,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:14,511 INFO L225 Difference]: With dead ends: 115 [2018-12-03 16:54:14,511 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 16:54:14,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11990 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=12376, Invalid=15346, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 16:54:14,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 16:54:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-12-03 16:54:14,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-12-03 16:54:14,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-12-03 16:54:14,517 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-12-03 16:54:14,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:14,518 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-12-03 16:54:14,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-03 16:54:14,518 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-12-03 16:54:14,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-03 16:54:14,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:14,519 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-12-03 16:54:14,519 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:14,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:14,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-12-03 16:54:14,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:14,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:14,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:14,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:14,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:16,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:16,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:16,065 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:16,065 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:16,065 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:16,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:16,066 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:16,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:16,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:16,104 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:17,792 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:21,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:21,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:21,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 168 [2018-12-03 16:54:21,725 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:21,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 16:54:21,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 16:54:21,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12825, Invalid=15905, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:54:21,727 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 114 states. [2018-12-03 16:54:21,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:21,989 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-03 16:54:21,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 16:54:21,990 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 113 [2018-12-03 16:54:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:21,991 INFO L225 Difference]: With dead ends: 117 [2018-12-03 16:54:21,991 INFO L226 Difference]: Without dead ends: 116 [2018-12-03 16:54:21,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12432 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=12825, Invalid=15905, Unknown=0, NotChecked=0, Total=28730 [2018-12-03 16:54:21,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-03 16:54:21,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-12-03 16:54:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-12-03 16:54:21,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-12-03 16:54:21,997 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-12-03 16:54:21,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:21,997 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-12-03 16:54:21,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 16:54:21,997 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-12-03 16:54:21,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-03 16:54:21,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:21,998 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-12-03 16:54:21,998 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:21,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:21,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-12-03 16:54:21,999 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:21,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:21,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:22,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:22,000 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:23,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:23,381 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:23,381 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:23,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:23,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:23,382 INFO 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:54:23,390 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:23,390 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:23,451 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-03 16:54:23,451 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:23,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:25,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:25,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:29,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:29,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 171 [2018-12-03 16:54:29,387 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:29,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-03 16:54:29,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-03 16:54:29,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13282, Invalid=16474, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 16:54:29,389 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 116 states. [2018-12-03 16:54:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:29,711 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-12-03 16:54:29,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 16:54:29,712 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 115 [2018-12-03 16:54:29,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:29,713 INFO L225 Difference]: With dead ends: 119 [2018-12-03 16:54:29,713 INFO L226 Difference]: Without dead ends: 118 [2018-12-03 16:54:29,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=13282, Invalid=16474, Unknown=0, NotChecked=0, Total=29756 [2018-12-03 16:54:29,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-03 16:54:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-03 16:54:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-03 16:54:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-03 16:54:29,717 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-12-03 16:54:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:29,718 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-03 16:54:29,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-03 16:54:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-03 16:54:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-03 16:54:29,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:29,718 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-12-03 16:54:29,719 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:29,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-12-03 16:54:29,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:29,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:29,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:29,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:29,720 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:31,413 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:31,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:31,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:31,413 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:31,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:31,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:31,414 INFO 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:54:31,421 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:31,421 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:31,453 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:31,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:31,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:33,421 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:33,421 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:37,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:37,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:37,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 174 [2018-12-03 16:54:37,647 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:37,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-03 16:54:37,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-03 16:54:37,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13747, Invalid=17053, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:54:37,650 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 118 states. [2018-12-03 16:54:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:37,946 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-12-03 16:54:37,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-03 16:54:37,947 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 117 [2018-12-03 16:54:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:37,947 INFO L225 Difference]: With dead ends: 121 [2018-12-03 16:54:37,947 INFO L226 Difference]: Without dead ends: 120 [2018-12-03 16:54:37,949 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13340 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=13747, Invalid=17053, Unknown=0, NotChecked=0, Total=30800 [2018-12-03 16:54:37,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-03 16:54:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-12-03 16:54:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 16:54:37,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-12-03 16:54:37,952 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-12-03 16:54:37,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:37,952 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-12-03 16:54:37,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-03 16:54:37,953 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-12-03 16:54:37,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-03 16:54:37,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:37,953 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-12-03 16:54:37,953 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:37,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:37,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-12-03 16:54:37,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:37,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:37,954 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:37,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:37,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:39,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:39,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:39,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:39,497 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:39,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:39,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:39,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:54:39,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:39,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:54:39,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:39,540 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:41,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:41,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:46,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:46,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 177 [2018-12-03 16:54:46,245 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:46,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-03 16:54:46,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-03 16:54:46,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14220, Invalid=17642, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 16:54:46,248 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 120 states. [2018-12-03 16:54:46,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:46,510 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-12-03 16:54:46,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 16:54:46,511 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 119 [2018-12-03 16:54:46,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:46,511 INFO L225 Difference]: With dead ends: 123 [2018-12-03 16:54:46,511 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 16:54:46,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13806 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=14220, Invalid=17642, Unknown=0, NotChecked=0, Total=31862 [2018-12-03 16:54:46,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 16:54:46,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-12-03 16:54:46,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-12-03 16:54:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-12-03 16:54:46,517 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-12-03 16:54:46,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:46,517 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-12-03 16:54:46,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-03 16:54:46,517 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-12-03 16:54:46,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-03 16:54:46,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:46,518 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-12-03 16:54:46,519 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:46,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:46,519 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-12-03 16:54:46,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:46,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:46,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:54:46,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:46,520 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:48,212 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:48,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:48,213 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:48,213 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:48,213 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:48,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:48,213 INFO 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:54:48,222 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:54:48,223 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:54:48,283 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 16:54:48,283 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:48,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:50,508 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:50,508 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:54:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:54,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:54:54,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 180 [2018-12-03 16:54:54,811 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:54:54,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-03 16:54:54,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-03 16:54:54,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14701, Invalid=18241, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:54:54,814 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 122 states. [2018-12-03 16:54:55,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:54:55,084 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-12-03 16:54:55,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 16:54:55,085 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 121 [2018-12-03 16:54:55,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:54:55,086 INFO L225 Difference]: With dead ends: 125 [2018-12-03 16:54:55,086 INFO L226 Difference]: Without dead ends: 124 [2018-12-03 16:54:55,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14280 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=14701, Invalid=18241, Unknown=0, NotChecked=0, Total=32942 [2018-12-03 16:54:55,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-12-03 16:54:55,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-12-03 16:54:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-03 16:54:55,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-12-03 16:54:55,092 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-12-03 16:54:55,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:54:55,093 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-12-03 16:54:55,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-03 16:54:55,093 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-12-03 16:54:55,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-03 16:54:55,094 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:54:55,094 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-12-03 16:54:55,094 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:54:55,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:54:55,094 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-12-03 16:54:55,095 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:54:55,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:55,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:54:55,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:54:55,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:54:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:54:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:57,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:57,419 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:54:57,419 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:54:57,419 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:54:57,419 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:54:57,419 INFO 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:54:57,428 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:54:57,428 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:54:57,461 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:54:57,461 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:54:57,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:54:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:54:59,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:04,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:04,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 183 [2018-12-03 16:55:04,104 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:04,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-03 16:55:04,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-03 16:55:04,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15190, Invalid=18850, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 16:55:04,106 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 124 states. [2018-12-03 16:55:04,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:04,378 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-12-03 16:55:04,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 16:55:04,379 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 123 [2018-12-03 16:55:04,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:04,380 INFO L225 Difference]: With dead ends: 127 [2018-12-03 16:55:04,380 INFO L226 Difference]: Without dead ends: 126 [2018-12-03 16:55:04,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14762 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=15190, Invalid=18850, Unknown=0, NotChecked=0, Total=34040 [2018-12-03 16:55:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-12-03 16:55:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-12-03 16:55:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-12-03 16:55:04,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-12-03 16:55:04,384 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-12-03 16:55:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:04,385 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-12-03 16:55:04,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-03 16:55:04,385 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-12-03 16:55:04,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-03 16:55:04,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:04,385 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-12-03 16:55:04,385 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:04,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:04,386 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-12-03 16:55:04,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:04,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:04,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:04,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:04,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:06,291 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:06,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:06,291 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:06,291 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:06,291 INFO 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:06,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:06,292 INFO 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:55:06,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:06,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:06,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:06,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:08,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:08,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:13,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:13,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:13,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 186 [2018-12-03 16:55:13,195 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:13,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 16:55:13,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 16:55:13,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15687, Invalid=19469, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:55:13,197 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 126 states. [2018-12-03 16:55:13,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:13,493 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-12-03 16:55:13,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-03 16:55:13,493 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 125 [2018-12-03 16:55:13,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:13,495 INFO L225 Difference]: With dead ends: 129 [2018-12-03 16:55:13,495 INFO L226 Difference]: Without dead ends: 128 [2018-12-03 16:55:13,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15252 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=15687, Invalid=19469, Unknown=0, NotChecked=0, Total=35156 [2018-12-03 16:55:13,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-03 16:55:13,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-12-03 16:55:13,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-03 16:55:13,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-12-03 16:55:13,500 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-12-03 16:55:13,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:13,500 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-12-03 16:55:13,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 16:55:13,500 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-12-03 16:55:13,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-03 16:55:13,501 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:13,501 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-12-03 16:55:13,501 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:13,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:13,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-12-03 16:55:13,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:13,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:13,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:13,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:13,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:15,227 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:15,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:15,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:15,228 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:15,228 INFO 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:15,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:15,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:55:15,237 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:15,238 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:15,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-03 16:55:15,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:15,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:17,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:22,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:22,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:22,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 189 [2018-12-03 16:55:22,653 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:22,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-03 16:55:22,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-03 16:55:22,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16192, Invalid=20098, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 16:55:22,657 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 128 states. [2018-12-03 16:55:22,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:22,995 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-12-03 16:55:22,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 16:55:22,996 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 127 [2018-12-03 16:55:22,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:22,997 INFO L225 Difference]: With dead ends: 131 [2018-12-03 16:55:22,997 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 16:55:22,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15750 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=16192, Invalid=20098, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 16:55:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 16:55:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-12-03 16:55:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-03 16:55:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-12-03 16:55:23,003 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-12-03 16:55:23,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:23,003 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-12-03 16:55:23,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-03 16:55:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-12-03 16:55:23,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-03 16:55:23,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:23,005 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-12-03 16:55:23,005 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:23,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:23,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-12-03 16:55:23,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:23,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:23,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:23,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:23,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:23,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:24,767 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:24,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:24,768 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:24,768 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:24,768 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:24,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:24,768 INFO 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:55:24,778 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:24,778 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:24,812 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:24,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:24,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:27,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:27,293 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:32,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:32,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 192 [2018-12-03 16:55:32,273 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:32,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-03 16:55:32,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-03 16:55:32,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16705, Invalid=20737, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:55:32,277 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 130 states. [2018-12-03 16:55:32,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:32,649 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-12-03 16:55:32,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 16:55:32,649 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 129 [2018-12-03 16:55:32,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:32,650 INFO L225 Difference]: With dead ends: 133 [2018-12-03 16:55:32,650 INFO L226 Difference]: Without dead ends: 132 [2018-12-03 16:55:32,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16256 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=16705, Invalid=20737, Unknown=0, NotChecked=0, Total=37442 [2018-12-03 16:55:32,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-12-03 16:55:32,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-12-03 16:55:32,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-12-03 16:55:32,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-12-03 16:55:32,656 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-12-03 16:55:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:32,656 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-12-03 16:55:32,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-03 16:55:32,657 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-12-03 16:55:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-03 16:55:32,657 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:32,658 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-12-03 16:55:32,658 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:32,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:32,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-12-03 16:55:32,658 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:32,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:32,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:32,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:32,659 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:32,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:34,622 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:34,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:34,622 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:34,622 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:34,622 INFO 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:34,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:34,623 INFO 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:55:34,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:34,632 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:55:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:34,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:37,153 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:42,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:42,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:42,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 195 [2018-12-03 16:55:42,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:42,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-03 16:55:42,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-03 16:55:42,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17226, Invalid=21386, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 16:55:42,366 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 132 states. [2018-12-03 16:55:42,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:42,687 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-12-03 16:55:42,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 16:55:42,687 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 131 [2018-12-03 16:55:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:42,688 INFO L225 Difference]: With dead ends: 135 [2018-12-03 16:55:42,688 INFO L226 Difference]: Without dead ends: 134 [2018-12-03 16:55:42,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16770 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=17226, Invalid=21386, Unknown=0, NotChecked=0, Total=38612 [2018-12-03 16:55:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-03 16:55:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-12-03 16:55:42,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-12-03 16:55:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-12-03 16:55:42,694 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-12-03 16:55:42,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:42,694 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-12-03 16:55:42,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-03 16:55:42,694 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-12-03 16:55:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-12-03 16:55:42,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:42,695 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-12-03 16:55:42,695 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:42,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:42,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-12-03 16:55:42,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:42,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:55:42,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:42,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:44,496 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:44,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:44,496 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:44,496 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:44,496 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:55:44,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:44,497 INFO 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:55:44,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:55:44,505 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:55:44,579 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 16:55:44,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:44,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:47,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:47,698 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:55:53,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:53,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:55:53,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 198 [2018-12-03 16:55:53,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:55:53,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 16:55:53,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 16:55:53,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17755, Invalid=22045, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:55:53,151 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 134 states. [2018-12-03 16:55:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:55:53,516 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-12-03 16:55:53,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-03 16:55:53,516 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 133 [2018-12-03 16:55:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:55:53,517 INFO L225 Difference]: With dead ends: 137 [2018-12-03 16:55:53,517 INFO L226 Difference]: Without dead ends: 136 [2018-12-03 16:55:53,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17292 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=17755, Invalid=22045, Unknown=0, NotChecked=0, Total=39800 [2018-12-03 16:55:53,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-12-03 16:55:53,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-12-03 16:55:53,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-03 16:55:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-03 16:55:53,525 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-12-03 16:55:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:55:53,525 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-03 16:55:53,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 16:55:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-03 16:55:53,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-03 16:55:53,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:55:53,526 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-12-03 16:55:53,526 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:55:53,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:55:53,527 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-12-03 16:55:53,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:55:53,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:53,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:55:53,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:55:53,528 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:55:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:55:55,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:55,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:55,437 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:55:55,437 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:55:55,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:55:55,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:55:55,438 INFO 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:55:55,448 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:55:55,448 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:55:55,487 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:55:55,487 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:55:55,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:55:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:55:58,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:03,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:03,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:03,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 201 [2018-12-03 16:56:03,621 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:03,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-03 16:56:03,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-03 16:56:03,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18292, Invalid=22714, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 16:56:03,625 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 136 states. [2018-12-03 16:56:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:04,010 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-12-03 16:56:04,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:56:04,011 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 135 [2018-12-03 16:56:04,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:04,012 INFO L225 Difference]: With dead ends: 139 [2018-12-03 16:56:04,012 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 16:56:04,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17822 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=18292, Invalid=22714, Unknown=0, NotChecked=0, Total=41006 [2018-12-03 16:56:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 16:56:04,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-12-03 16:56:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-12-03 16:56:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-12-03 16:56:04,018 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2018-12-03 16:56:04,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:04,018 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-12-03 16:56:04,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-03 16:56:04,018 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-12-03 16:56:04,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-12-03 16:56:04,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:04,019 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2018-12-03 16:56:04,019 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:04,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:04,020 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2018-12-03 16:56:04,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:04,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:04,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:04,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:04,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:05,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:05,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:05,990 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:05,990 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:56:05,990 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:05,990 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:56:05,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:05,998 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:06,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:08,736 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:08,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:14,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:14,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 204 [2018-12-03 16:56:14,461 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:14,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 16:56:14,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 16:56:14,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18837, Invalid=23393, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:56:14,464 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 138 states. [2018-12-03 16:56:14,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:14,821 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-12-03 16:56:14,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 16:56:14,821 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 137 [2018-12-03 16:56:14,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:14,822 INFO L225 Difference]: With dead ends: 141 [2018-12-03 16:56:14,822 INFO L226 Difference]: Without dead ends: 140 [2018-12-03 16:56:14,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18360 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=18837, Invalid=23393, Unknown=0, NotChecked=0, Total=42230 [2018-12-03 16:56:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-03 16:56:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-03 16:56:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-03 16:56:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-12-03 16:56:14,828 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2018-12-03 16:56:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:14,828 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-12-03 16:56:14,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 16:56:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-12-03 16:56:14,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-12-03 16:56:14,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:14,828 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2018-12-03 16:56:14,829 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:14,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:14,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2018-12-03 16:56:14,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:14,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:14,830 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:16,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:16,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:16,864 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:16,864 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:16,864 INFO 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:16,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:16,865 INFO 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:56:16,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:16,873 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:16,948 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-03 16:56:16,948 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:16,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:19,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:25,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:25,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 207 [2018-12-03 16:56:25,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:25,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-03 16:56:25,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-03 16:56:25,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19390, Invalid=24082, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 16:56:25,494 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 140 states. [2018-12-03 16:56:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:25,832 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-12-03 16:56:25,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 16:56:25,833 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 139 [2018-12-03 16:56:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:25,834 INFO L225 Difference]: With dead ends: 143 [2018-12-03 16:56:25,834 INFO L226 Difference]: Without dead ends: 142 [2018-12-03 16:56:25,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18906 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=19390, Invalid=24082, Unknown=0, NotChecked=0, Total=43472 [2018-12-03 16:56:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-03 16:56:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-12-03 16:56:25,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-03 16:56:25,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-12-03 16:56:25,841 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2018-12-03 16:56:25,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:25,841 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-12-03 16:56:25,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-03 16:56:25,841 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-12-03 16:56:25,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-03 16:56:25,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:25,842 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2018-12-03 16:56:25,842 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:25,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:25,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2018-12-03 16:56:25,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:25,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:25,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:25,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:25,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:28,162 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:28,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:28,162 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:28,162 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:28,162 INFO 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:28,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:28,162 INFO 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:56:28,170 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:56:28,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:56:28,210 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:56:28,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:28,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:30,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:30,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:36,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:36,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 210 [2018-12-03 16:56:36,966 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:36,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-03 16:56:36,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-03 16:56:36,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19951, Invalid=24781, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:56:36,969 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 142 states. [2018-12-03 16:56:37,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:37,370 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-12-03 16:56:37,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-03 16:56:37,370 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 141 [2018-12-03 16:56:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:37,371 INFO L225 Difference]: With dead ends: 145 [2018-12-03 16:56:37,371 INFO L226 Difference]: Without dead ends: 144 [2018-12-03 16:56:37,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19460 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=19951, Invalid=24781, Unknown=0, NotChecked=0, Total=44732 [2018-12-03 16:56:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-12-03 16:56:37,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-12-03 16:56:37,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-12-03 16:56:37,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-12-03 16:56:37,377 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2018-12-03 16:56:37,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:37,377 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-12-03 16:56:37,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-03 16:56:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-12-03 16:56:37,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-12-03 16:56:37,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:37,378 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2018-12-03 16:56:37,378 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:37,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:37,378 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2018-12-03 16:56:37,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:37,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:37,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:56:37,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:37,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:37,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:39,826 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:39,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:39,827 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:39,827 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:39,827 INFO 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,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:39,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 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:56:39,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:39,836 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:56:39,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:39,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:42,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:42,557 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:56:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:48,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:56:48,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 213 [2018-12-03 16:56:48,982 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:56:48,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-03 16:56:48,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-03 16:56:48,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20520, Invalid=25490, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 16:56:48,986 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 144 states. [2018-12-03 16:56:49,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:56:49,394 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-12-03 16:56:49,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 16:56:49,394 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 143 [2018-12-03 16:56:49,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:56:49,395 INFO L225 Difference]: With dead ends: 147 [2018-12-03 16:56:49,395 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 16:56:49,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20022 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=20520, Invalid=25490, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 16:56:49,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 16:56:49,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-12-03 16:56:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-12-03 16:56:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-12-03 16:56:49,401 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2018-12-03 16:56:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:56:49,401 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-12-03 16:56:49,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-03 16:56:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-12-03 16:56:49,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-12-03 16:56:49,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:56:49,402 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2018-12-03 16:56:49,402 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:56:49,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:56:49,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2018-12-03 16:56:49,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:56:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:49,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:56:49,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:56:49,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:56:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:56:51,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:51,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:51,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:56:51,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:56:51,606 INFO 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:51,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:56:51,606 INFO 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:56:51,616 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:56:51,616 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:56:51,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-03 16:56:51,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:56:51,829 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:56:55,103 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:56:55,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:01,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:01,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 216 [2018-12-03 16:57:01,491 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:01,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-03 16:57:01,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-03 16:57:01,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21097, Invalid=26209, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:57:01,495 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 146 states. [2018-12-03 16:57:01,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:01,922 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-12-03 16:57:01,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 16:57:01,923 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 145 [2018-12-03 16:57:01,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:01,924 INFO L225 Difference]: With dead ends: 149 [2018-12-03 16:57:01,924 INFO L226 Difference]: Without dead ends: 148 [2018-12-03 16:57:01,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20592 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=21097, Invalid=26209, Unknown=0, NotChecked=0, Total=47306 [2018-12-03 16:57:01,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-12-03 16:57:01,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-12-03 16:57:01,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-03 16:57:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-12-03 16:57:01,930 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2018-12-03 16:57:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:01,930 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-12-03 16:57:01,931 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-03 16:57:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-12-03 16:57:01,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-03 16:57:01,931 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:01,932 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2018-12-03 16:57:01,932 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:01,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:01,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2018-12-03 16:57:01,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:01,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:01,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:01,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:01,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:04,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:04,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:04,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:04,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:04,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:04,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:04,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:04,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:04,548 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:04,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:04,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:07,465 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:07,465 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:14,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:14,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:14,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 219 [2018-12-03 16:57:14,328 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:14,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-03 16:57:14,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-03 16:57:14,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21682, Invalid=26938, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 16:57:14,331 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 148 states. [2018-12-03 16:57:14,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:14,754 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-12-03 16:57:14,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 16:57:14,754 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 147 [2018-12-03 16:57:14,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:14,756 INFO L225 Difference]: With dead ends: 151 [2018-12-03 16:57:14,756 INFO L226 Difference]: Without dead ends: 150 [2018-12-03 16:57:14,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21170 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=21682, Invalid=26938, Unknown=0, NotChecked=0, Total=48620 [2018-12-03 16:57:14,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-12-03 16:57:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-12-03 16:57:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-12-03 16:57:14,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-12-03 16:57:14,762 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-12-03 16:57:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:14,763 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-12-03 16:57:14,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-03 16:57:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-12-03 16:57:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-12-03 16:57:14,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:14,764 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2018-12-03 16:57:14,764 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:14,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:14,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2018-12-03 16:57:14,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:14,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:14,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:14,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:14,765 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:17,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:17,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:17,204 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:17,204 INFO 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:17,204 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:17,204 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:57:17,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:17,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:17,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:20,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:20,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:27,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:27,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:27,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 222 [2018-12-03 16:57:27,363 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:27,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-03 16:57:27,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-03 16:57:27,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22275, Invalid=27677, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 16:57:27,366 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 150 states. [2018-12-03 16:57:27,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:27,765 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-12-03 16:57:27,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-03 16:57:27,765 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 149 [2018-12-03 16:57:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:27,766 INFO L225 Difference]: With dead ends: 153 [2018-12-03 16:57:27,767 INFO L226 Difference]: Without dead ends: 152 [2018-12-03 16:57:27,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21756 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=22275, Invalid=27677, Unknown=0, NotChecked=0, Total=49952 [2018-12-03 16:57:27,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-03 16:57:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-03 16:57:27,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-03 16:57:27,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-12-03 16:57:27,773 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2018-12-03 16:57:27,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:27,773 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-12-03 16:57:27,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-03 16:57:27,774 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-12-03 16:57:27,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-03 16:57:27,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:27,775 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2018-12-03 16:57:27,775 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:27,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:27,775 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2018-12-03 16:57:27,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:27,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:27,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:27,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:27,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:30,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:30,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:30,577 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:30,577 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:30,577 INFO 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:30,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:30,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 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:57:30,586 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:57:30,586 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:57:30,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-03 16:57:30,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:30,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:33,697 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:33,697 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:40,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:40,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 225 [2018-12-03 16:57:40,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:40,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-12-03 16:57:41,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-12-03 16:57:41,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22876, Invalid=28426, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 16:57:41,002 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 152 states. [2018-12-03 16:57:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:41,426 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-12-03 16:57:41,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 16:57:41,426 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 151 [2018-12-03 16:57:41,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:41,427 INFO L225 Difference]: With dead ends: 155 [2018-12-03 16:57:41,427 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 16:57:41,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22350 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=22876, Invalid=28426, Unknown=0, NotChecked=0, Total=51302 [2018-12-03 16:57:41,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 16:57:41,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-12-03 16:57:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-03 16:57:41,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-12-03 16:57:41,433 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2018-12-03 16:57:41,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:41,433 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-12-03 16:57:41,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-12-03 16:57:41,433 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-12-03 16:57:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-03 16:57:41,434 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:41,434 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2018-12-03 16:57:41,434 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:41,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:41,434 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2018-12-03 16:57:41,434 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:41,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:41,435 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:41,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:41,435 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:43,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:43,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:43,837 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:43,837 INFO 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,837 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:43,837 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:43,845 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:57:43,845 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:57:43,887 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:57:43,887 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:57:43,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:57:47,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:47,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:57:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:54,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:57:54,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 228 [2018-12-03 16:57:54,277 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:57:54,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-03 16:57:54,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-03 16:57:54,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23485, Invalid=29185, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 16:57:54,281 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 154 states. [2018-12-03 16:57:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:57:54,854 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-12-03 16:57:54,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 16:57:54,855 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 153 [2018-12-03 16:57:54,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:57:54,855 INFO L225 Difference]: With dead ends: 157 [2018-12-03 16:57:54,855 INFO L226 Difference]: Without dead ends: 156 [2018-12-03 16:57:54,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 380 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22952 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=23485, Invalid=29185, Unknown=0, NotChecked=0, Total=52670 [2018-12-03 16:57:54,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-12-03 16:57:54,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-12-03 16:57:54,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-12-03 16:57:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-12-03 16:57:54,861 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2018-12-03 16:57:54,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:57:54,861 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-12-03 16:57:54,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-03 16:57:54,861 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-12-03 16:57:54,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-12-03 16:57:54,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:57:54,862 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2018-12-03 16:57:54,862 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:57:54,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:57:54,862 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2018-12-03 16:57:54,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:57:54,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:54,863 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:57:54,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:57:54,863 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:57:54,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:57,406 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:57:57,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:57,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:57:57,407 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:57:57,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:57:57,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:57:57,407 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:57:57,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:57:57,416 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:57:57,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:57:57,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:00,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:08,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:08,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:08,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 231 [2018-12-03 16:58:08,198 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:08,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-03 16:58:08,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-03 16:58:08,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24102, Invalid=29954, Unknown=0, NotChecked=0, Total=54056 [2018-12-03 16:58:08,201 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 156 states. [2018-12-03 16:58:08,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:08,607 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-12-03 16:58:08,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 16:58:08,607 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 155 [2018-12-03 16:58:08,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:08,608 INFO L225 Difference]: With dead ends: 159 [2018-12-03 16:58:08,608 INFO L226 Difference]: Without dead ends: 158 [2018-12-03 16:58:08,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23562 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=24102, Invalid=29954, Unknown=0, NotChecked=0, Total=54056 [2018-12-03 16:58:08,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-03 16:58:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-12-03 16:58:08,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-03 16:58:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-12-03 16:58:08,613 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2018-12-03 16:58:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:08,614 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-12-03 16:58:08,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-03 16:58:08,614 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-12-03 16:58:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-12-03 16:58:08,614 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:08,614 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2018-12-03 16:58:08,615 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:08,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:08,615 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2018-12-03 16:58:08,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:08,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:08,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:08,616 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:08,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:11,499 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:11,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:11,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:11,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:58:11,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:11,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:11,508 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:11,508 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:11,597 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-03 16:58:11,597 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:11,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:14,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:14,789 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:22,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:22,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:22,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 234 [2018-12-03 16:58:22,459 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:22,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-03 16:58:22,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-03 16:58:22,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24727, Invalid=30733, Unknown=0, NotChecked=0, Total=55460 [2018-12-03 16:58:22,462 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 158 states. [2018-12-03 16:58:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:22,868 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-12-03 16:58:22,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-03 16:58:22,869 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 157 [2018-12-03 16:58:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:22,870 INFO L225 Difference]: With dead ends: 161 [2018-12-03 16:58:22,870 INFO L226 Difference]: Without dead ends: 160 [2018-12-03 16:58:22,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24180 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=24727, Invalid=30733, Unknown=0, NotChecked=0, Total=55460 [2018-12-03 16:58:22,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-12-03 16:58:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-12-03 16:58:22,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 16:58:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-12-03 16:58:22,875 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2018-12-03 16:58:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:22,875 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-12-03 16:58:22,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-03 16:58:22,876 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-12-03 16:58:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-03 16:58:22,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:22,876 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2018-12-03 16:58:22,877 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:22,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:22,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2018-12-03 16:58:22,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:22,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:22,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:22,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:22,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:25,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:25,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:25,802 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:25,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 16:58:25,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:25,803 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:25,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:58:25,811 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:58:25,854 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:58:25,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:25,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:29,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:29,164 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:37,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:37,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:37,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 237 [2018-12-03 16:58:37,113 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:37,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-03 16:58:37,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-03 16:58:37,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25360, Invalid=31522, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 16:58:37,116 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 160 states. [2018-12-03 16:58:37,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:37,581 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-12-03 16:58:37,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 16:58:37,581 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 159 [2018-12-03 16:58:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:37,582 INFO L225 Difference]: With dead ends: 163 [2018-12-03 16:58:37,583 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 16:58:37,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24806 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=25360, Invalid=31522, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 16:58:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 16:58:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-03 16:58:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-03 16:58:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-12-03 16:58:37,591 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2018-12-03 16:58:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:37,591 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-12-03 16:58:37,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-03 16:58:37,591 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-12-03 16:58:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-12-03 16:58:37,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:37,593 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2018-12-03 16:58:37,593 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:37,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:37,593 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2018-12-03 16:58:37,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:37,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:37,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:58:37,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:37,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:37,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:40,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:40,398 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:40,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:40,399 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:40,399 INFO 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:40,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:40,399 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:40,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:40,408 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:58:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:40,454 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:44,097 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:44,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:58:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:52,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:58:52,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 240 [2018-12-03 16:58:52,185 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:58:52,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-03 16:58:52,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-03 16:58:52,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26001, Invalid=32321, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 16:58:52,187 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 162 states. [2018-12-03 16:58:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:58:52,585 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-12-03 16:58:52,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 16:58:52,586 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 161 [2018-12-03 16:58:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:58:52,586 INFO L225 Difference]: With dead ends: 165 [2018-12-03 16:58:52,587 INFO L226 Difference]: Without dead ends: 164 [2018-12-03 16:58:52,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25440 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=26001, Invalid=32321, Unknown=0, NotChecked=0, Total=58322 [2018-12-03 16:58:52,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-03 16:58:52,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-12-03 16:58:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 16:58:52,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-12-03 16:58:52,594 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2018-12-03 16:58:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:58:52,595 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-12-03 16:58:52,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-03 16:58:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-12-03 16:58:52,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-12-03 16:58:52,596 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:58:52,596 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2018-12-03 16:58:52,596 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:58:52,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:58:52,596 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2018-12-03 16:58:52,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:58:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:52,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:58:52,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:58:52,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:58:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:58:55,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:55,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:55,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:58:55,583 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:58:55,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:58:55,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:58:55,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 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:58:55,593 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:58:55,593 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:58:55,690 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-03 16:58:55,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:58:55,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:58:59,343 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:58:59,343 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:07,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:07,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 243 [2018-12-03 16:59:07,543 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:07,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-12-03 16:59:07,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-12-03 16:59:07,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26650, Invalid=33130, Unknown=0, NotChecked=0, Total=59780 [2018-12-03 16:59:07,546 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 164 states. [2018-12-03 16:59:07,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:07,979 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-12-03 16:59:07,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 16:59:07,980 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 163 [2018-12-03 16:59:07,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:07,980 INFO L225 Difference]: With dead ends: 167 [2018-12-03 16:59:07,980 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 16:59:07,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 243 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26082 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=26650, Invalid=33130, Unknown=0, NotChecked=0, Total=59780 [2018-12-03 16:59:07,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 16:59:07,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-12-03 16:59:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-03 16:59:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-12-03 16:59:07,985 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2018-12-03 16:59:07,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:07,985 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-12-03 16:59:07,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-12-03 16:59:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-12-03 16:59:07,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-03 16:59:07,986 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:07,986 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2018-12-03 16:59:07,986 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:07,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:07,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2018-12-03 16:59:07,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:07,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:07,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:07,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:07,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:08,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:10,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:10,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:10,788 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:10,788 INFO 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:10,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:10,788 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:10,796 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:10,796 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:10,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:10,849 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:10,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:14,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:14,666 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:23,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:23,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 246 [2018-12-03 16:59:23,071 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:23,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-03 16:59:23,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-03 16:59:23,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27307, Invalid=33949, Unknown=0, NotChecked=0, Total=61256 [2018-12-03 16:59:23,074 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 166 states. [2018-12-03 16:59:23,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:23,574 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-12-03 16:59:23,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-03 16:59:23,574 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 165 [2018-12-03 16:59:23,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:23,576 INFO L225 Difference]: With dead ends: 169 [2018-12-03 16:59:23,576 INFO L226 Difference]: Without dead ends: 168 [2018-12-03 16:59:23,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26732 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=27307, Invalid=33949, Unknown=0, NotChecked=0, Total=61256 [2018-12-03 16:59:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-12-03 16:59:23,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-12-03 16:59:23,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-03 16:59:23,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-12-03 16:59:23,582 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2018-12-03 16:59:23,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:23,582 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-12-03 16:59:23,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-03 16:59:23,583 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-12-03 16:59:23,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-12-03 16:59:23,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:23,583 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2018-12-03 16:59:23,583 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:23,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:23,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2018-12-03 16:59:23,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:23,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:23,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:23,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:23,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:26,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:26,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:26,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:26,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:26,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:59:26,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:26,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:26,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:26,510 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:59:26,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:26,555 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:30,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:30,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:39,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:39,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 249 [2018-12-03 16:59:39,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:39,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-12-03 16:59:39,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-12-03 16:59:39,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27972, Invalid=34778, Unknown=0, NotChecked=0, Total=62750 [2018-12-03 16:59:39,079 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 168 states. [2018-12-03 16:59:39,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:39,791 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-12-03 16:59:39,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 16:59:39,792 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 167 [2018-12-03 16:59:39,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:39,792 INFO L225 Difference]: With dead ends: 171 [2018-12-03 16:59:39,793 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 16:59:39,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27390 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=27972, Invalid=34778, Unknown=0, NotChecked=0, Total=62750 [2018-12-03 16:59:39,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 16:59:39,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-12-03 16:59:39,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-12-03 16:59:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-12-03 16:59:39,798 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2018-12-03 16:59:39,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:39,798 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-12-03 16:59:39,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-12-03 16:59:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-12-03 16:59:39,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-12-03 16:59:39,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:39,799 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2018-12-03 16:59:39,799 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:39,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:39,800 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2018-12-03 16:59:39,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:39,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:59:39,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:39,800 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:43,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:43,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:43,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:43,087 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:43,087 INFO 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:43,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:43,087 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:43,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:59:43,096 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:59:43,208 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-03 16:59:43,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:43,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:59:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:46,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:59:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:55,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 16:59:55,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 252 [2018-12-03 16:59:55,707 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:59:55,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-03 16:59:55,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-03 16:59:55,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28645, Invalid=35617, Unknown=0, NotChecked=0, Total=64262 [2018-12-03 16:59:55,710 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 170 states. [2018-12-03 16:59:56,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:59:56,142 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-12-03 16:59:56,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 16:59:56,142 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 169 [2018-12-03 16:59:56,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:59:56,143 INFO L225 Difference]: With dead ends: 173 [2018-12-03 16:59:56,144 INFO L226 Difference]: Without dead ends: 172 [2018-12-03 16:59:56,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28056 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=28645, Invalid=35617, Unknown=0, NotChecked=0, Total=64262 [2018-12-03 16:59:56,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-12-03 16:59:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-12-03 16:59:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-03 16:59:56,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-12-03 16:59:56,149 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2018-12-03 16:59:56,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:59:56,150 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-12-03 16:59:56,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-03 16:59:56,150 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-12-03 16:59:56,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-03 16:59:56,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:59:56,150 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2018-12-03 16:59:56,151 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 16:59:56,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:59:56,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2018-12-03 16:59:56,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:59:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:56,152 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:59:56,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:59:56,152 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:59:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:59:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:59:59,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:59,365 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 16:59:59,365 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:59:59,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:59:59,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:59:59,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 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:59:59,373 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:59:59,374 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:59:59,422 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:59:59,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:59:59,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:03,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:12,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:12,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:12,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 255 [2018-12-03 17:00:12,154 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:12,154 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-12-03 17:00:12,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-12-03 17:00:12,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29326, Invalid=36466, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 17:00:12,158 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 172 states. [2018-12-03 17:00:12,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:12,588 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-12-03 17:00:12,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:00:12,589 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 171 [2018-12-03 17:00:12,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:12,589 INFO L225 Difference]: With dead ends: 175 [2018-12-03 17:00:12,589 INFO L226 Difference]: Without dead ends: 174 [2018-12-03 17:00:12,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28730 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=29326, Invalid=36466, Unknown=0, NotChecked=0, Total=65792 [2018-12-03 17:00:12,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-12-03 17:00:12,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-12-03 17:00:12,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-12-03 17:00:12,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-12-03 17:00:12,596 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2018-12-03 17:00:12,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:12,597 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-12-03 17:00:12,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-12-03 17:00:12,597 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-12-03 17:00:12,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-12-03 17:00:12,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:12,598 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2018-12-03 17:00:12,598 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:12,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:12,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2018-12-03 17:00:12,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:12,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:12,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:12,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:12,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:15,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:15,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:15,926 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:15,926 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:15,926 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:15,927 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:15,927 INFO 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:00:15,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:15,937 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:00:15,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:16,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:20,163 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:29,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:29,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:29,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 258 [2018-12-03 17:00:29,326 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:29,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-03 17:00:29,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-03 17:00:29,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30015, Invalid=37325, Unknown=0, NotChecked=0, Total=67340 [2018-12-03 17:00:29,330 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 174 states. [2018-12-03 17:00:29,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:29,769 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-12-03 17:00:29,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-03 17:00:29,770 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 173 [2018-12-03 17:00:29,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:29,771 INFO L225 Difference]: With dead ends: 177 [2018-12-03 17:00:29,771 INFO L226 Difference]: Without dead ends: 176 [2018-12-03 17:00:29,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 258 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29412 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=30015, Invalid=37325, Unknown=0, NotChecked=0, Total=67340 [2018-12-03 17:00:29,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-03 17:00:29,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-12-03 17:00:29,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-12-03 17:00:29,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-12-03 17:00:29,779 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2018-12-03 17:00:29,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:29,779 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-12-03 17:00:29,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-03 17:00:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-12-03 17:00:29,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-12-03 17:00:29,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:29,781 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2018-12-03 17:00:29,781 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:29,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:29,781 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2018-12-03 17:00:29,781 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:29,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:29,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:00:29,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:29,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:32,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:32,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:32,939 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:32,939 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:32,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:32,939 INFO 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:00:32,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:00:32,947 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:00:33,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-03 17:00:33,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:33,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:37,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:00:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:46,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:00:46,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 261 [2018-12-03 17:00:46,653 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:00:46,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-12-03 17:00:46,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-12-03 17:00:46,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30712, Invalid=38194, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 17:00:46,658 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 176 states. [2018-12-03 17:00:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:00:47,202 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-12-03 17:00:47,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:00:47,202 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 175 [2018-12-03 17:00:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:00:47,203 INFO L225 Difference]: With dead ends: 179 [2018-12-03 17:00:47,203 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 17:00:47,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30102 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=30712, Invalid=38194, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 17:00:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 17:00:47,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-12-03 17:00:47,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-03 17:00:47,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-12-03 17:00:47,209 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2018-12-03 17:00:47,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:00:47,209 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-12-03 17:00:47,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-12-03 17:00:47,209 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-12-03 17:00:47,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-03 17:00:47,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:00:47,210 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2018-12-03 17:00:47,210 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:00:47,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:00:47,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2018-12-03 17:00:47,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:00:47,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:47,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:00:47,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:00:47,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:00:47,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:00:50,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:50,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:50,756 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:00:50,756 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:00:50,756 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:50,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:00:50,756 INFO 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:00:50,765 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:00:50,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:00:50,815 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:00:50,815 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:00:50,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:00:55,245 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:00:55,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:04,912 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:04,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:04,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 264 [2018-12-03 17:01:04,934 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:04,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-12-03 17:01:04,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-12-03 17:01:04,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31417, Invalid=39073, Unknown=0, NotChecked=0, Total=70490 [2018-12-03 17:01:04,938 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 178 states. [2018-12-03 17:01:05,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:05,438 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-12-03 17:01:05,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:01:05,438 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 177 [2018-12-03 17:01:05,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:05,439 INFO L225 Difference]: With dead ends: 181 [2018-12-03 17:01:05,439 INFO L226 Difference]: Without dead ends: 180 [2018-12-03 17:01:05,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30800 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=31417, Invalid=39073, Unknown=0, NotChecked=0, Total=70490 [2018-12-03 17:01:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-03 17:01:05,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-12-03 17:01:05,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-12-03 17:01:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-12-03 17:01:05,445 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2018-12-03 17:01:05,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:05,445 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-12-03 17:01:05,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-12-03 17:01:05,445 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-12-03 17:01:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-12-03 17:01:05,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:05,446 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2018-12-03 17:01:05,446 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:05,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:05,446 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2018-12-03 17:01:05,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:05,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:05,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:05,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:05,447 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:08,753 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:08,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:08,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:08,754 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:08,754 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:01:08,754 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:08,754 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:01:08,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:08,763 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:01:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:08,808 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:13,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:23,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:23,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 267 [2018-12-03 17:01:23,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:23,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-12-03 17:01:23,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-12-03 17:01:23,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32130, Invalid=39962, Unknown=0, NotChecked=0, Total=72092 [2018-12-03 17:01:23,145 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 180 states. [2018-12-03 17:01:23,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:23,686 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-12-03 17:01:23,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:01:23,686 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 179 [2018-12-03 17:01:23,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:23,687 INFO L225 Difference]: With dead ends: 183 [2018-12-03 17:01:23,687 INFO L226 Difference]: Without dead ends: 182 [2018-12-03 17:01:23,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 267 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31506 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=32130, Invalid=39962, Unknown=0, NotChecked=0, Total=72092 [2018-12-03 17:01:23,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-03 17:01:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-03 17:01:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-03 17:01:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-12-03 17:01:23,693 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2018-12-03 17:01:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:23,693 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-12-03 17:01:23,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-12-03 17:01:23,693 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-12-03 17:01:23,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-12-03 17:01:23,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:23,694 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2018-12-03 17:01:23,694 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:23,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:23,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2018-12-03 17:01:23,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:23,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:23,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:01:23,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:23,695 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:27,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:27,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:27,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:27,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:27,423 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:27,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:27,423 INFO 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:01:27,430 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:01:27,431 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:01:27,593 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-03 17:01:27,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:27,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:32,085 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:32,085 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:01:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:42,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:01:42,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 270 [2018-12-03 17:01:42,171 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:01:42,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-03 17:01:42,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-03 17:01:42,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32851, Invalid=40861, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 17:01:42,175 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 182 states. [2018-12-03 17:01:42,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:01:42,664 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-12-03 17:01:42,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-03 17:01:42,664 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 181 [2018-12-03 17:01:42,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:01:42,665 INFO L225 Difference]: With dead ends: 185 [2018-12-03 17:01:42,665 INFO L226 Difference]: Without dead ends: 184 [2018-12-03 17:01:42,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32220 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=32851, Invalid=40861, Unknown=0, NotChecked=0, Total=73712 [2018-12-03 17:01:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-03 17:01:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-12-03 17:01:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-03 17:01:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-12-03 17:01:42,671 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2018-12-03 17:01:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:01:42,671 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-12-03 17:01:42,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-03 17:01:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-12-03 17:01:42,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-03 17:01:42,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:01:42,672 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2018-12-03 17:01:42,672 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:01:42,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:01:42,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2018-12-03 17:01:42,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:01:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:42,673 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:01:42,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:01:42,673 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:01:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:01:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:46,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:46,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:01:46,422 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:01:46,423 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:46,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:01:46,423 INFO 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:01:46,431 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:01:46,431 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:01:46,484 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:01:46,484 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:01:46,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:01:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:01:51,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:01,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:01,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 273 [2018-12-03 17:02:01,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:01,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-12-03 17:02:01,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-12-03 17:02:01,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33580, Invalid=41770, Unknown=0, NotChecked=0, Total=75350 [2018-12-03 17:02:01,269 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 184 states. [2018-12-03 17:02:01,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:01,857 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-12-03 17:02:01,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 17:02:01,858 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 183 [2018-12-03 17:02:01,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:01,858 INFO L225 Difference]: With dead ends: 187 [2018-12-03 17:02:01,859 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 17:02:01,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32942 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=33580, Invalid=41770, Unknown=0, NotChecked=0, Total=75350 [2018-12-03 17:02:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 17:02:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-12-03 17:02:01,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-12-03 17:02:01,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-12-03 17:02:01,866 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2018-12-03 17:02:01,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:01,866 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-12-03 17:02:01,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-12-03 17:02:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-12-03 17:02:01,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-12-03 17:02:01,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:01,868 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2018-12-03 17:02:01,868 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:01,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:01,868 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2018-12-03 17:02:01,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:01,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:01,869 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:01,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:01,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:06,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:06,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:06,068 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:06,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:06,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:06,068 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:06,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:06,080 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:02:06,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:06,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:10,509 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:10,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:21,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:21,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 276 [2018-12-03 17:02:21,280 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:21,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-03 17:02:21,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-03 17:02:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34317, Invalid=42689, Unknown=0, NotChecked=0, Total=77006 [2018-12-03 17:02:21,284 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 186 states. [2018-12-03 17:02:21,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:21,760 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-12-03 17:02:21,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:02:21,760 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 185 [2018-12-03 17:02:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:21,761 INFO L225 Difference]: With dead ends: 189 [2018-12-03 17:02:21,761 INFO L226 Difference]: Without dead ends: 188 [2018-12-03 17:02:21,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 276 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33672 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=34317, Invalid=42689, Unknown=0, NotChecked=0, Total=77006 [2018-12-03 17:02:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-03 17:02:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-12-03 17:02:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-12-03 17:02:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-12-03 17:02:21,769 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2018-12-03 17:02:21,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:21,769 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-12-03 17:02:21,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-03 17:02:21,769 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-12-03 17:02:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-12-03 17:02:21,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:21,770 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2018-12-03 17:02:21,771 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:21,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:21,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2018-12-03 17:02:21,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:21,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:02:21,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:21,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:25,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:25,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:25,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:25,462 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:25,462 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:25,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:25,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:02:25,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:02:25,472 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:02:25,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-03 17:02:25,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:25,605 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:30,135 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:02:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:40,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:02:40,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 279 [2018-12-03 17:02:40,769 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:02:40,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-12-03 17:02:40,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-12-03 17:02:40,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35062, Invalid=43618, Unknown=0, NotChecked=0, Total=78680 [2018-12-03 17:02:40,772 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 188 states. [2018-12-03 17:02:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:02:41,443 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-12-03 17:02:41,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 17:02:41,444 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 187 [2018-12-03 17:02:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:02:41,444 INFO L225 Difference]: With dead ends: 191 [2018-12-03 17:02:41,444 INFO L226 Difference]: Without dead ends: 190 [2018-12-03 17:02:41,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34410 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=35062, Invalid=43618, Unknown=0, NotChecked=0, Total=78680 [2018-12-03 17:02:41,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-12-03 17:02:41,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-12-03 17:02:41,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-03 17:02:41,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-12-03 17:02:41,450 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2018-12-03 17:02:41,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:02:41,450 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-12-03 17:02:41,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-12-03 17:02:41,450 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-12-03 17:02:41,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-03 17:02:41,451 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:02:41,451 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2018-12-03 17:02:41,452 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:02:41,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:02:41,452 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2018-12-03 17:02:41,452 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:02:41,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:41,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:02:41,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:02:41,453 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:02:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:02:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:45,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:45,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:02:45,144 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:02:45,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:02:45,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:02:45,145 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:02:45,153 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:02:45,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:02:45,208 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:02:45,208 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:02:45,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:02:50,014 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:02:50,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:00,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:00,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 282 [2018-12-03 17:03:00,925 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:00,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-12-03 17:03:00,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-12-03 17:03:00,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35815, Invalid=44557, Unknown=0, NotChecked=0, Total=80372 [2018-12-03 17:03:00,929 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 190 states. [2018-12-03 17:03:01,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:01,482 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-12-03 17:03:01,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-03 17:03:01,482 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 189 [2018-12-03 17:03:01,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:01,483 INFO L225 Difference]: With dead ends: 193 [2018-12-03 17:03:01,483 INFO L226 Difference]: Without dead ends: 192 [2018-12-03 17:03:01,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35156 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=35815, Invalid=44557, Unknown=0, NotChecked=0, Total=80372 [2018-12-03 17:03:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-12-03 17:03:01,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-12-03 17:03:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-12-03 17:03:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-12-03 17:03:01,490 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2018-12-03 17:03:01,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:01,490 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-12-03 17:03:01,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-12-03 17:03:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-12-03 17:03:01,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-03 17:03:01,491 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:01,491 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2018-12-03 17:03:01,491 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:01,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:01,492 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2018-12-03 17:03:01,492 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:01,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:01,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:01,492 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:01,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:05,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:05,648 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:05,648 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:05,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:05,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:05,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 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:05,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:05,657 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:03:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:05,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:10,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:21,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:21,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 285 [2018-12-03 17:03:21,678 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:21,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-03 17:03:21,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-03 17:03:21,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36576, Invalid=45506, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 17:03:21,683 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 192 states. [2018-12-03 17:03:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:22,186 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-12-03 17:03:22,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:03:22,186 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 191 [2018-12-03 17:03:22,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:22,187 INFO L225 Difference]: With dead ends: 195 [2018-12-03 17:03:22,187 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 17:03:22,189 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35910 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=36576, Invalid=45506, Unknown=0, NotChecked=0, Total=82082 [2018-12-03 17:03:22,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 17:03:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-12-03 17:03:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-03 17:03:22,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-12-03 17:03:22,193 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2018-12-03 17:03:22,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:22,193 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-12-03 17:03:22,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-03 17:03:22,194 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-12-03 17:03:22,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-12-03 17:03:22,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:22,194 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2018-12-03 17:03:22,194 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:22,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:22,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2018-12-03 17:03:22,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:22,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:22,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:03:22,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:22,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:26,141 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:26,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:26,141 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:26,141 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:26,141 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:26,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:26,141 INFO 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:26,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:03:26,150 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:03:26,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-03 17:03:26,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:26,281 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:31,095 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:03:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:42,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:03:42,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 288 [2018-12-03 17:03:42,356 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:03:42,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-03 17:03:42,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-03 17:03:42,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37345, Invalid=46465, Unknown=0, NotChecked=0, Total=83810 [2018-12-03 17:03:42,360 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 194 states. [2018-12-03 17:03:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:03:42,886 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-12-03 17:03:42,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 17:03:42,886 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 193 [2018-12-03 17:03:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:03:42,887 INFO L225 Difference]: With dead ends: 197 [2018-12-03 17:03:42,887 INFO L226 Difference]: Without dead ends: 196 [2018-12-03 17:03:42,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 480 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36672 ImplicationChecksByTransitivity, 19.7s TimeCoverageRelationStatistics Valid=37345, Invalid=46465, Unknown=0, NotChecked=0, Total=83810 [2018-12-03 17:03:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-03 17:03:42,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-12-03 17:03:42,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-03 17:03:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-12-03 17:03:42,892 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2018-12-03 17:03:42,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:03:42,893 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-12-03 17:03:42,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-03 17:03:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-12-03 17:03:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-03 17:03:42,894 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:03:42,894 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2018-12-03 17:03:42,894 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:03:42,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:03:42,894 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2018-12-03 17:03:42,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:03:42,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:42,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:03:42,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:03:42,895 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:03:42,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:03:47,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:47,160 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:47,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:03:47,161 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:03:47,161 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,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:03:47,161 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:03:47,169 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:03:47,170 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:03:47,224 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:03:47,224 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:03:47,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:03:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:03:52,145 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:04:03,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:04:03,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:04:03,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 291 [2018-12-03 17:04:03,694 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:04:03,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-12-03 17:04:03,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-12-03 17:04:03,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38122, Invalid=47434, Unknown=0, NotChecked=0, Total=85556 [2018-12-03 17:04:03,698 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 196 states. [2018-12-03 17:04:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:04:04,247 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-12-03 17:04:04,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 17:04:04,247 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 195 [2018-12-03 17:04:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:04:04,248 INFO L225 Difference]: With dead ends: 199 [2018-12-03 17:04:04,248 INFO L226 Difference]: Without dead ends: 198 [2018-12-03 17:04:04,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37442 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=38122, Invalid=47434, Unknown=0, NotChecked=0, Total=85556 [2018-12-03 17:04:04,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-03 17:04:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-12-03 17:04:04,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-12-03 17:04:04,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-12-03 17:04:04,253 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2018-12-03 17:04:04,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:04:04,253 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-12-03 17:04:04,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-12-03 17:04:04,254 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-12-03 17:04:04,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-03 17:04:04,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:04:04,255 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2018-12-03 17:04:04,255 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:04:04,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:04:04,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2018-12-03 17:04:04,255 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:04:04,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:04,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:04:04,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:04:04,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:04:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat