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_oct_cong.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 17:40:09,670 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 17:40:09,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 17:40:09,692 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 17:40:09,692 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 17:40:09,694 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 17:40:09,696 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 17:40:09,699 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 17:40:09,702 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 17:40:09,703 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 17:40:09,704 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 17:40:09,705 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 17:40:09,706 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 17:40:09,707 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 17:40:09,708 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 17:40:09,709 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 17:40:09,710 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 17:40:09,711 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 17:40:09,713 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 17:40:09,715 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 17:40:09,716 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 17:40:09,718 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 17:40:09,720 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 17:40:09,720 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 17:40:09,720 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 17:40:09,721 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 17:40:09,722 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 17:40:09,723 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 17:40:09,724 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 17:40:09,725 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 17:40:09,725 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 17:40:09,726 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 17:40:09,726 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 17:40:09,726 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 17:40:09,727 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 17:40:09,728 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 17:40:09,728 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_oct_cong.epf [2018-12-03 17:40:09,742 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 17:40:09,742 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 17:40:09,744 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 17:40:09,744 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 17:40:09,744 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 17:40:09,745 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 17:40:09,745 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 17:40:09,745 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 17:40:09,745 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 17:40:09,746 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 17:40:09,746 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 17:40:09,746 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 17:40:09,746 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 17:40:09,747 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 17:40:09,747 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 17:40:09,747 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 17:40:09,749 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 17:40:09,749 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 17:40:09,749 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 17:40:09,749 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 17:40:09,749 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 17:40:09,750 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 17:40:09,750 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 17:40:09,750 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 17:40:09,750 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 17:40:09,750 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 17:40:09,751 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 17:40:09,751 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 17:40:09,751 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 17:40:09,752 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 17:40:09,752 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 17:40:09,752 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 17:40:09,752 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 17:40:09,752 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 17:40:09,753 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 17:40:09,753 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 17:40:09,753 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 17:40:09,753 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 17:40:09,753 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 17:40:09,802 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 17:40:09,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 17:40:09,823 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 17:40:09,825 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 17:40:09,825 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 17:40:09,826 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl [2018-12-03 17:40:09,827 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/fragtest_simple.i_4.bpl' [2018-12-03 17:40:09,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 17:40:09,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 17:40:09,878 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 17:40:09,878 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 17:40:09,878 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 17:40:09,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:09" (1/1) ... [2018-12-03 17:40:09,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:09" (1/1) ... [2018-12-03 17:40:09,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 17:40:09,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 17:40:09,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 17:40:09,914 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 17:40:09,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:09" (1/1) ... [2018-12-03 17:40:09,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:09" (1/1) ... [2018-12-03 17:40:09,927 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:09" (1/1) ... [2018-12-03 17:40:09,927 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:09" (1/1) ... [2018-12-03 17:40:09,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:09" (1/1) ... [2018-12-03 17:40:09,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:09" (1/1) ... [2018-12-03 17:40:09,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:09" (1/1) ... [2018-12-03 17:40:09,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 17:40:09,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 17:40:09,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 17:40:09,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 17:40:09,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:09" (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 17:40:10,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 17:40:10,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 17:40:10,297 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 17:40:10,298 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-03 17:40:10,298 INFO L202 PluginConnector]: Adding new model fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:40:10 BoogieIcfgContainer [2018-12-03 17:40:10,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 17:40:10,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 17:40:10,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 17:40:10,303 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 17:40:10,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 05:40:09" (1/2) ... [2018-12-03 17:40:10,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ef37e00 and model type fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 05:40:10, skipping insertion in model container [2018-12-03 17:40:10,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 05:40:10" (2/2) ... [2018-12-03 17:40:10,306 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple.i_4.bpl [2018-12-03 17:40:10,317 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 17:40:10,326 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 17:40:10,344 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 17:40:10,378 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 17:40:10,378 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 17:40:10,379 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 17:40:10,379 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 17:40:10,379 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 17:40:10,379 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 17:40:10,379 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 17:40:10,380 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 17:40:10,396 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-12-03 17:40:10,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 17:40:10,403 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:10,404 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-12-03 17:40:10,407 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:10,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:10,413 INFO L82 PathProgramCache]: Analyzing trace with hash 889599113, now seen corresponding path program 1 times [2018-12-03 17:40:10,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:10,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:10,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:10,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:10,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:10,651 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 17:40:10,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:40:10,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:40:10,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:40:10,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:40:10,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:40:10,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:40:10,685 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-12-03 17:40:10,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:10,849 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-12-03 17:40:10,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 17:40:10,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-12-03 17:40:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:10,863 INFO L225 Difference]: With dead ends: 14 [2018-12-03 17:40:10,863 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 17:40:10,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:40:10,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 17:40:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2018-12-03 17:40:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 17:40:10,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-12-03 17:40:10,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-12-03 17:40:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:10,903 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-12-03 17:40:10,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:40:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-12-03 17:40:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 17:40:10,904 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:10,904 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:40:10,904 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:10,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:10,905 INFO L82 PathProgramCache]: Analyzing trace with hash 206308035, now seen corresponding path program 1 times [2018-12-03 17:40:10,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:10,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:10,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:10,906 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:10,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 17:40:10,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 17:40:10,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 17:40:10,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 17:40:10,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 17:40:10,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 17:40:10,965 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 4 states. [2018-12-03 17:40:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:11,038 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2018-12-03 17:40:11,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 17:40:11,038 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2018-12-03 17:40:11,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:11,039 INFO L225 Difference]: With dead ends: 17 [2018-12-03 17:40:11,039 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 17:40:11,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 17:40:11,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 17:40:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 17:40:11,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 17:40:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-12-03 17:40:11,045 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-12-03 17:40:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:11,045 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-12-03 17:40:11,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 17:40:11,046 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-12-03 17:40:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 17:40:11,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:11,046 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-03 17:40:11,047 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:11,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:11,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1531170369, now seen corresponding path program 1 times [2018-12-03 17:40:11,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:11,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:11,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:11,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:11,049 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:11,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:11,230 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:11,231 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 11 with the following transitions: [2018-12-03 17:40:11,233 INFO L205 CegarAbsIntRunner]: [0], [2], [6], [8], [10], [14], [16], [18] [2018-12-03 17:40:11,296 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 17:40:11,296 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 17:40:12,178 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 17:40:12,180 INFO L272 AbstractInterpreter]: Visited 8 different actions 59 times. Merged at 7 different actions 38 times. Widened at 5 different actions 14 times. Found 5 fixpoints after 2 different actions. Largest state had 0 variables. [2018-12-03 17:40:12,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:12,209 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 17:40:12,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:12,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:40:12,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:12,222 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:12,258 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:12,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:12,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:12,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2018-12-03 17:40:12,773 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:12,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 17:40:12,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 17:40:12,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-12-03 17:40:12,775 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 9 states. [2018-12-03 17:40:13,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:13,278 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-12-03 17:40:13,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 17:40:13,280 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 10 [2018-12-03 17:40:13,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:13,280 INFO L225 Difference]: With dead ends: 21 [2018-12-03 17:40:13,281 INFO L226 Difference]: Without dead ends: 15 [2018-12-03 17:40:13,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:40:13,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-12-03 17:40:13,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-12-03 17:40:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-12-03 17:40:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-12-03 17:40:13,286 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-12-03 17:40:13,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:13,287 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-12-03 17:40:13,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 17:40:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-12-03 17:40:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 17:40:13,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:13,288 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-12-03 17:40:13,288 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:13,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:13,289 INFO L82 PathProgramCache]: Analyzing trace with hash -587211915, now seen corresponding path program 2 times [2018-12-03 17:40:13,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:13,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:13,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:13,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:13,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:13,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:13,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:13,408 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:13,408 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:13,408 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:40:13,409 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:13,409 INFO 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 17:40:13,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:13,420 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:13,476 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-03 17:40:13,476 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:13,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:13,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:13,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:13,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-12-03 17:40:13,956 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:13,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:40:13,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:40:13,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-12-03 17:40:13,958 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 12 states. [2018-12-03 17:40:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:14,470 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2018-12-03 17:40:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:40:14,470 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 14 [2018-12-03 17:40:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:14,471 INFO L225 Difference]: With dead ends: 27 [2018-12-03 17:40:14,471 INFO L226 Difference]: Without dead ends: 19 [2018-12-03 17:40:14,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:40:14,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-12-03 17:40:14,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-12-03 17:40:14,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-03 17:40:14,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-12-03 17:40:14,477 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-12-03 17:40:14,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:14,478 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-12-03 17:40:14,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:40:14,478 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-12-03 17:40:14,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 17:40:14,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:14,479 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-12-03 17:40:14,479 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:14,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:14,479 INFO L82 PathProgramCache]: Analyzing trace with hash 70717867, now seen corresponding path program 3 times [2018-12-03 17:40:14,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:14,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:14,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:14,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:14,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:14,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:14,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:14,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:14,671 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:14,671 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:14,671 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:14,671 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:40:14,681 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:14,681 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:14,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:14,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:14,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:14,832 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:14,833 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:14,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:14,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 11 [2018-12-03 17:40:14,939 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:14,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:40:14,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:40:14,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 17:40:14,941 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 12 states. [2018-12-03 17:40:15,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:15,147 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-12-03 17:40:15,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 17:40:15,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-12-03 17:40:15,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:15,148 INFO L225 Difference]: With dead ends: 31 [2018-12-03 17:40:15,148 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 17:40:15,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:40:15,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 17:40:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 17:40:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 17:40:15,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-12-03 17:40:15,154 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2018-12-03 17:40:15,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:15,154 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-12-03 17:40:15,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:40:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-12-03 17:40:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 17:40:15,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:15,156 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1] [2018-12-03 17:40:15,156 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:15,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:15,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2045097383, now seen corresponding path program 4 times [2018-12-03 17:40:15,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:15,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:15,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:15,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:15,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:15,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:15,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:15,298 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:15,298 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:40:15,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:15,298 INFO 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 17:40:15,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:15,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:15,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:15,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:15,375 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:15,376 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 20 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:15,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:15,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 10 [2018-12-03 17:40:15,441 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:15,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 17:40:15,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 17:40:15,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2018-12-03 17:40:15,442 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 10 states. [2018-12-03 17:40:15,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:15,566 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-12-03 17:40:15,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 17:40:15,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2018-12-03 17:40:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:15,569 INFO L225 Difference]: With dead ends: 28 [2018-12-03 17:40:15,569 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 17:40:15,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=148, Unknown=0, NotChecked=0, Total=240 [2018-12-03 17:40:15,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 17:40:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-03 17:40:15,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-03 17:40:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-12-03 17:40:15,578 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 20 [2018-12-03 17:40:15,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:15,578 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-12-03 17:40:15,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 17:40:15,579 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-12-03 17:40:15,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-03 17:40:15,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:15,580 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-12-03 17:40:15,580 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:15,580 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:15,580 INFO L82 PathProgramCache]: Analyzing trace with hash 37022875, now seen corresponding path program 5 times [2018-12-03 17:40:15,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:15,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:15,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:15,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:15,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:15,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:15,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:15,765 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:15,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:15,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:15,765 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:40:15,774 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:15,774 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:15,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-03 17:40:15,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:15,817 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:15,949 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:15,949 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:16,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:16,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 18 [2018-12-03 17:40:16,045 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:16,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-03 17:40:16,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-03 17:40:16,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:40:16,047 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 17 states. [2018-12-03 17:40:16,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:16,163 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-12-03 17:40:16,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 17:40:16,165 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-12-03 17:40:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:16,166 INFO L225 Difference]: With dead ends: 41 [2018-12-03 17:40:16,166 INFO L226 Difference]: Without dead ends: 27 [2018-12-03 17:40:16,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 32 SyntacticMatches, 8 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:40:16,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-03 17:40:16,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-12-03 17:40:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-03 17:40:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-03 17:40:16,173 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-12-03 17:40:16,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:16,174 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-03 17:40:16,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-03 17:40:16,174 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-03 17:40:16,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-03 17:40:16,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:16,175 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-12-03 17:40:16,175 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:16,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:16,176 INFO L82 PathProgramCache]: Analyzing trace with hash -1480612969, now seen corresponding path program 6 times [2018-12-03 17:40:16,176 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:16,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:16,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:16,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:16,177 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:16,392 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:16,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:16,393 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:16,393 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:16,393 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:40:16,393 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:16,394 INFO 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 17:40:16,403 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:16,403 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:16,430 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:16,431 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:16,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:16,681 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:16,816 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:16,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:16,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 17 [2018-12-03 17:40:16,836 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:16,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:40:16,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:40:16,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-12-03 17:40:16,837 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 18 states. [2018-12-03 17:40:17,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:17,360 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-12-03 17:40:17,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 17:40:17,360 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2018-12-03 17:40:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:17,362 INFO L225 Difference]: With dead ends: 43 [2018-12-03 17:40:17,362 INFO L226 Difference]: Without dead ends: 29 [2018-12-03 17:40:17,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=148, Invalid=358, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:40:17,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-03 17:40:17,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-03 17:40:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 17:40:17,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-12-03 17:40:17,370 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-12-03 17:40:17,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:17,370 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-12-03 17:40:17,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:40:17,370 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-12-03 17:40:17,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-03 17:40:17,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:17,372 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-12-03 17:40:17,372 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:17,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:17,372 INFO L82 PathProgramCache]: Analyzing trace with hash 360221587, now seen corresponding path program 7 times [2018-12-03 17:40:17,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:17,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:17,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:17,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:17,374 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:17,516 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:17,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:17,517 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:17,517 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:17,517 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:40:17,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:17,518 INFO 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 17:40:17,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:17,527 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:17,562 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:17,731 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:17,732 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:17,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:17,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 12 [2018-12-03 17:40:17,901 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:17,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 17:40:17,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 17:40:17,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2018-12-03 17:40:17,902 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 12 states. [2018-12-03 17:40:18,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:18,071 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-12-03 17:40:18,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 17:40:18,073 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-12-03 17:40:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:18,074 INFO L225 Difference]: With dead ends: 36 [2018-12-03 17:40:18,075 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 17:40:18,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 10 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=235, Unknown=0, NotChecked=0, Total=380 [2018-12-03 17:40:18,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 17:40:18,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-03 17:40:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 17:40:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-12-03 17:40:18,083 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2018-12-03 17:40:18,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:18,084 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-12-03 17:40:18,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 17:40:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-12-03 17:40:18,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-03 17:40:18,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:18,085 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 1, 1, 1, 1] [2018-12-03 17:40:18,085 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:18,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1263725703, now seen corresponding path program 8 times [2018-12-03 17:40:18,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:18,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:18,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:18,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:18,459 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:18,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:18,459 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:18,459 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:18,460 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:40:18,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:18,460 INFO 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 17:40:18,473 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:18,473 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:18,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-12-03 17:40:18,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:18,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:18,731 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:18,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:18,839 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 56 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:18,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:18,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 24 [2018-12-03 17:40:18,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:18,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-03 17:40:18,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-03 17:40:18,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:40:18,860 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 23 states. [2018-12-03 17:40:19,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:19,033 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2018-12-03 17:40:19,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 17:40:19,034 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2018-12-03 17:40:19,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:19,035 INFO L225 Difference]: With dead ends: 53 [2018-12-03 17:40:19,035 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 17:40:19,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 42 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:40:19,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 17:40:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 17:40:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 17:40:19,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-12-03 17:40:19,042 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2018-12-03 17:40:19,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:19,043 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-12-03 17:40:19,043 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-03 17:40:19,043 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-12-03 17:40:19,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 17:40:19,044 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:19,044 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-12-03 17:40:19,045 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:19,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:19,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1629808515, now seen corresponding path program 9 times [2018-12-03 17:40:19,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:19,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:19,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:19,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:19,414 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:19,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:19,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:19,415 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:19,415 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:40:19,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:19,415 INFO 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 17:40:19,424 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:19,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:19,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:19,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:19,459 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:19,671 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:19,671 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:19,823 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 56 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:19,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:19,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 23 [2018-12-03 17:40:19,843 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:19,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:40:19,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:40:19,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:40:19,844 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 24 states. [2018-12-03 17:40:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:20,009 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2018-12-03 17:40:20,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 17:40:20,009 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 34 [2018-12-03 17:40:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:20,010 INFO L225 Difference]: With dead ends: 55 [2018-12-03 17:40:20,010 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 17:40:20,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 45 SyntacticMatches, 15 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=668, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:40:20,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 17:40:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 17:40:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 17:40:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2018-12-03 17:40:20,017 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 34 [2018-12-03 17:40:20,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:20,017 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2018-12-03 17:40:20,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:40:20,018 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2018-12-03 17:40:20,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 17:40:20,019 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:20,019 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 1, 1, 1, 1] [2018-12-03 17:40:20,019 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:20,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:20,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1248072575, now seen corresponding path program 10 times [2018-12-03 17:40:20,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:20,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:20,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:20,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:20,021 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:20,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:20,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:20,227 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:20,227 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:20,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 17:40:20,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:20,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 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 17:40:20,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:20,236 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:20,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:20,264 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:20,305 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:20,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:20,396 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 72 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:20,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:20,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 14 [2018-12-03 17:40:20,416 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:20,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 17:40:20,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 17:40:20,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2018-12-03 17:40:20,417 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 14 states. [2018-12-03 17:40:20,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:20,760 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-12-03 17:40:20,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-03 17:40:20,761 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2018-12-03 17:40:20,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:20,762 INFO L225 Difference]: With dead ends: 44 [2018-12-03 17:40:20,762 INFO L226 Difference]: Without dead ends: 42 [2018-12-03 17:40:20,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 62 SyntacticMatches, 14 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=210, Invalid=342, Unknown=0, NotChecked=0, Total=552 [2018-12-03 17:40:20,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-03 17:40:20,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-12-03 17:40:20,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-03 17:40:20,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-12-03 17:40:20,770 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2018-12-03 17:40:20,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:20,770 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-12-03 17:40:20,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 17:40:20,770 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-12-03 17:40:20,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-03 17:40:20,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:20,771 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-12-03 17:40:20,771 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:20,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:20,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1910464909, now seen corresponding path program 11 times [2018-12-03 17:40:20,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:20,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:20,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:20,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:20,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:21,139 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 90 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:21,139 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:21,139 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:21,139 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:21,140 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:40:21,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:21,140 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:40:21,152 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:21,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:21,196 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-03 17:40:21,196 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:21,200 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:21,423 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 90 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:21,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 90 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:21,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:21,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 30 [2018-12-03 17:40:21,621 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:21,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-12-03 17:40:21,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-12-03 17:40:21,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:40:21,623 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 29 states. [2018-12-03 17:40:21,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:21,807 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2018-12-03 17:40:21,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 17:40:21,807 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 40 [2018-12-03 17:40:21,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:21,808 INFO L225 Difference]: With dead ends: 65 [2018-12-03 17:40:21,808 INFO L226 Difference]: Without dead ends: 43 [2018-12-03 17:40:21,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 16 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=407, Invalid=1075, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:40:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-03 17:40:21,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-12-03 17:40:21,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-03 17:40:21,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-12-03 17:40:21,814 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-12-03 17:40:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:21,815 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-12-03 17:40:21,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-12-03 17:40:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-12-03 17:40:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 17:40:21,816 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:21,816 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-12-03 17:40:21,816 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:21,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:21,817 INFO L82 PathProgramCache]: Analyzing trace with hash 179690863, now seen corresponding path program 12 times [2018-12-03 17:40:21,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:21,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:21,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:21,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:21,818 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:22,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:22,102 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:22,102 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:22,103 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:40:22,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:22,103 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:40:22,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:22,119 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:22,151 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:22,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:22,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:22,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:22,726 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 90 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:22,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:22,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 29 [2018-12-03 17:40:22,746 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:22,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:40:22,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:40:22,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=651, Unknown=0, NotChecked=0, Total=870 [2018-12-03 17:40:22,747 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 30 states. [2018-12-03 17:40:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:23,267 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-12-03 17:40:23,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 17:40:23,267 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2018-12-03 17:40:23,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:23,268 INFO L225 Difference]: With dead ends: 67 [2018-12-03 17:40:23,268 INFO L226 Difference]: Without dead ends: 45 [2018-12-03 17:40:23,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 55 SyntacticMatches, 19 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=408, Invalid=1074, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:40:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-03 17:40:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-12-03 17:40:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-03 17:40:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-12-03 17:40:23,276 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-12-03 17:40:23,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:23,276 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-12-03 17:40:23,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:40:23,276 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-12-03 17:40:23,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 17:40:23,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:23,277 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-12-03 17:40:23,278 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:23,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:23,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1225306773, now seen corresponding path program 13 times [2018-12-03 17:40:23,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:23,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:23,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:23,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:23,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:23,482 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:23,483 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:23,483 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:23,483 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:23,483 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:23,483 INFO 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 17:40:23,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:23,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:23,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:23,612 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 110 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:23,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:23,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 16 [2018-12-03 17:40:23,745 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:23,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 17:40:23,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 17:40:23,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2018-12-03 17:40:23,746 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 16 states. [2018-12-03 17:40:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:23,993 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2018-12-03 17:40:23,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-03 17:40:23,994 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-12-03 17:40:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:23,995 INFO L225 Difference]: With dead ends: 52 [2018-12-03 17:40:23,995 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 17:40:23,996 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 76 SyntacticMatches, 18 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=287, Invalid=469, Unknown=0, NotChecked=0, Total=756 [2018-12-03 17:40:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 17:40:24,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-03 17:40:24,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 17:40:24,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-12-03 17:40:24,005 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 44 [2018-12-03 17:40:24,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:24,005 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-12-03 17:40:24,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 17:40:24,006 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-12-03 17:40:24,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 17:40:24,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:24,007 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 1, 1, 1, 1] [2018-12-03 17:40:24,007 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:24,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:24,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1452473761, now seen corresponding path program 14 times [2018-12-03 17:40:24,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:24,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:24,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:24,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:24,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:24,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 132 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:24,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:24,535 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:24,535 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:24,536 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:40:24,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:24,536 INFO 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 17:40:24,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:24,544 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:24,588 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-03 17:40:24,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:24,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:24,973 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 132 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:24,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 132 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:25,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:25,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 36 [2018-12-03 17:40:25,518 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:25,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-12-03 17:40:25,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-12-03 17:40:25,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=997, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:40:25,520 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 35 states. [2018-12-03 17:40:26,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:26,125 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2018-12-03 17:40:26,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-03 17:40:26,127 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 48 [2018-12-03 17:40:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:26,128 INFO L225 Difference]: With dead ends: 77 [2018-12-03 17:40:26,128 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 17:40:26,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 62 SyntacticMatches, 20 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=585, Invalid=1577, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:40:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 17:40:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-12-03 17:40:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-03 17:40:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-12-03 17:40:26,139 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2018-12-03 17:40:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:26,139 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-12-03 17:40:26,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-12-03 17:40:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-12-03 17:40:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 17:40:26,141 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:26,141 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-12-03 17:40:26,141 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:26,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:26,141 INFO L82 PathProgramCache]: Analyzing trace with hash 1195476315, now seen corresponding path program 15 times [2018-12-03 17:40:26,142 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:26,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:26,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:26,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:26,143 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:26,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:27,136 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:27,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:27,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:27,137 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:27,137 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:40:27,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:27,137 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:40:27,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:27,146 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:27,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:27,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:27,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:27,748 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:27,974 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 132 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:27,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:27,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 35 [2018-12-03 17:40:27,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:27,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:40:27,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:40:27,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:40:27,996 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 36 states. [2018-12-03 17:40:28,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:28,233 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2018-12-03 17:40:28,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-03 17:40:28,233 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 50 [2018-12-03 17:40:28,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:28,234 INFO L225 Difference]: With dead ends: 79 [2018-12-03 17:40:28,234 INFO L226 Difference]: Without dead ends: 53 [2018-12-03 17:40:28,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 65 SyntacticMatches, 23 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 695 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=586, Invalid=1576, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:40:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-03 17:40:28,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-03 17:40:28,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 17:40:28,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-12-03 17:40:28,244 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 50 [2018-12-03 17:40:28,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:28,244 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-12-03 17:40:28,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:40:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-12-03 17:40:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 17:40:28,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:28,246 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 11, 1, 1, 1, 1] [2018-12-03 17:40:28,246 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:28,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:28,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1040107177, now seen corresponding path program 16 times [2018-12-03 17:40:28,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:28,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:28,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:28,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:28,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:28,583 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:28,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:28,583 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:28,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 17:40:28,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:28,584 INFO 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 17:40:28,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:28,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:28,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:28,699 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:28,838 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 156 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:28,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:28,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 18 [2018-12-03 17:40:28,858 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:28,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-03 17:40:28,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-03 17:40:28,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=201, Unknown=0, NotChecked=0, Total=342 [2018-12-03 17:40:28,859 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 18 states. [2018-12-03 17:40:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:29,094 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2018-12-03 17:40:29,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-03 17:40:29,095 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2018-12-03 17:40:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:29,096 INFO L225 Difference]: With dead ends: 60 [2018-12-03 17:40:29,096 INFO L226 Difference]: Without dead ends: 58 [2018-12-03 17:40:29,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 90 SyntacticMatches, 22 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 374 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=376, Invalid=616, Unknown=0, NotChecked=0, Total=992 [2018-12-03 17:40:29,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-03 17:40:29,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-12-03 17:40:29,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 17:40:29,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-12-03 17:40:29,105 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2018-12-03 17:40:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:29,106 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-12-03 17:40:29,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-03 17:40:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-12-03 17:40:29,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-03 17:40:29,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:29,107 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 1, 1, 1, 1] [2018-12-03 17:40:29,107 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:29,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:29,107 INFO L82 PathProgramCache]: Analyzing trace with hash 75962443, now seen corresponding path program 17 times [2018-12-03 17:40:29,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:29,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:29,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 182 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:29,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:29,500 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:29,500 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:29,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 17:40:29,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:29,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 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 17:40:29,509 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:29,509 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:29,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2018-12-03 17:40:29,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:29,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 182 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:30,023 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 182 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:30,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:30,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 42 [2018-12-03 17:40:30,279 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:30,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-12-03 17:40:30,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-12-03 17:40:30,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=1359, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:40:30,281 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 41 states. [2018-12-03 17:40:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:30,608 INFO L93 Difference]: Finished difference Result 89 states and 91 transitions. [2018-12-03 17:40:30,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 17:40:30,608 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 56 [2018-12-03 17:40:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:30,609 INFO L225 Difference]: With dead ends: 89 [2018-12-03 17:40:30,609 INFO L226 Difference]: Without dead ends: 59 [2018-12-03 17:40:30,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 72 SyntacticMatches, 24 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1000 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=795, Invalid=2175, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:40:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-03 17:40:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-12-03 17:40:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 17:40:30,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-12-03 17:40:30,620 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2018-12-03 17:40:30,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:30,620 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-12-03 17:40:30,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-12-03 17:40:30,620 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-12-03 17:40:30,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-03 17:40:30,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:30,621 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-12-03 17:40:30,622 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:30,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:30,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1108795207, now seen corresponding path program 18 times [2018-12-03 17:40:30,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:30,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:30,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:30,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 182 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:31,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:31,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:31,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:31,029 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:40:31,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:31,029 INFO 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 17:40:31,041 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:31,041 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:31,096 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:31,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:31,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 182 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:31,437 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:32,969 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 182 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:32,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:32,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 41 [2018-12-03 17:40:32,989 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:32,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:40:32,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:40:32,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=1303, Unknown=0, NotChecked=0, Total=1722 [2018-12-03 17:40:32,990 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 42 states. [2018-12-03 17:40:33,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:33,299 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-12-03 17:40:33,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-03 17:40:33,299 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 58 [2018-12-03 17:40:33,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:33,300 INFO L225 Difference]: With dead ends: 91 [2018-12-03 17:40:33,300 INFO L226 Difference]: Without dead ends: 61 [2018-12-03 17:40:33,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 75 SyntacticMatches, 27 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 977 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=796, Invalid=2174, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:40:33,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-03 17:40:33,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-03 17:40:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-03 17:40:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-12-03 17:40:33,309 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-12-03 17:40:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:33,309 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-12-03 17:40:33,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:40:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-12-03 17:40:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-03 17:40:33,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:33,310 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-12-03 17:40:33,311 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:33,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1523636035, now seen corresponding path program 19 times [2018-12-03 17:40:33,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:33,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:33,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:33,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:33,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 210 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:34,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:34,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:34,038 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:34,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 17:40:34,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:34,039 INFO 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 17:40:34,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:34,048 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:34,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:34,115 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 210 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:34,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 210 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:34,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:34,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 20 [2018-12-03 17:40:34,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:34,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-03 17:40:34,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-03 17:40:34,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=244, Unknown=0, NotChecked=0, Total=420 [2018-12-03 17:40:34,303 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 20 states. [2018-12-03 17:40:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:34,638 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2018-12-03 17:40:34,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-03 17:40:34,638 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 60 [2018-12-03 17:40:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:34,639 INFO L225 Difference]: With dead ends: 68 [2018-12-03 17:40:34,639 INFO L226 Difference]: Without dead ends: 66 [2018-12-03 17:40:34,640 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 104 SyntacticMatches, 26 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=477, Invalid=783, Unknown=0, NotChecked=0, Total=1260 [2018-12-03 17:40:34,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-03 17:40:34,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-12-03 17:40:34,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-03 17:40:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-12-03 17:40:34,661 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 60 [2018-12-03 17:40:34,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:34,661 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-12-03 17:40:34,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-03 17:40:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-12-03 17:40:34,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 17:40:34,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:34,662 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 14, 1, 1, 1, 1] [2018-12-03 17:40:34,662 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:34,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:34,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1329455159, now seen corresponding path program 20 times [2018-12-03 17:40:34,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:34,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:34,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:34,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:34,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:35,747 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 240 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:35,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:35,747 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:35,748 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:35,748 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:40:35,748 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:35,748 INFO 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 17:40:35,765 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:35,765 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:35,829 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-12-03 17:40:35,829 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:35,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:36,255 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 240 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:36,255 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:36,644 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 240 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:36,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:36,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 48 [2018-12-03 17:40:36,664 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:36,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-12-03 17:40:36,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-12-03 17:40:36,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1777, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:40:36,666 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 47 states. [2018-12-03 17:40:37,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:37,029 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-12-03 17:40:37,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-03 17:40:37,032 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 64 [2018-12-03 17:40:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:37,032 INFO L225 Difference]: With dead ends: 101 [2018-12-03 17:40:37,032 INFO L226 Difference]: Without dead ends: 67 [2018-12-03 17:40:37,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 82 SyntacticMatches, 28 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1037, Invalid=2869, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:40:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-12-03 17:40:37,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-12-03 17:40:37,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-03 17:40:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-12-03 17:40:37,041 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2018-12-03 17:40:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:37,042 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-12-03 17:40:37,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-12-03 17:40:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-12-03 17:40:37,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-03 17:40:37,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:37,043 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-12-03 17:40:37,043 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:37,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:37,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1862593331, now seen corresponding path program 21 times [2018-12-03 17:40:37,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:37,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:37,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:37,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:37,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:37,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:37,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:37,652 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:37,652 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:40:37,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:37,652 INFO 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 17:40:37,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:37,660 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:37,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:37,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:37,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:38,161 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 240 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:39,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:39,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 47 [2018-12-03 17:40:39,857 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:39,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:40:39,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:40:39,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=1713, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:40:39,858 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 48 states. [2018-12-03 17:40:40,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:40,332 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2018-12-03 17:40:40,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 17:40:40,332 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 66 [2018-12-03 17:40:40,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:40,333 INFO L225 Difference]: With dead ends: 103 [2018-12-03 17:40:40,333 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 17:40:40,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 85 SyntacticMatches, 31 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1038, Invalid=2868, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:40:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 17:40:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 17:40:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 17:40:40,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-12-03 17:40:40,340 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 66 [2018-12-03 17:40:40,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:40,340 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-12-03 17:40:40,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:40:40,341 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-12-03 17:40:40,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 17:40:40,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:40,341 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 15, 1, 1, 1, 1] [2018-12-03 17:40:40,341 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:40,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1187698897, now seen corresponding path program 22 times [2018-12-03 17:40:40,342 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:40,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:40,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:40,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:40,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:40,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 272 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:41,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:41,735 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:41,735 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:41,735 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:40:41,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:41,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:40:41,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:41,744 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:41,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:41,826 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 272 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:41,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:42,073 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 272 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:42,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:42,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 22 [2018-12-03 17:40:42,093 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:42,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 17:40:42,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 17:40:42,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=291, Unknown=0, NotChecked=0, Total=506 [2018-12-03 17:40:42,094 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 22 states. [2018-12-03 17:40:42,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:42,446 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-12-03 17:40:42,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-03 17:40:42,446 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2018-12-03 17:40:42,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:42,447 INFO L225 Difference]: With dead ends: 76 [2018-12-03 17:40:42,447 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 17:40:42,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 118 SyntacticMatches, 30 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=590, Invalid=970, Unknown=0, NotChecked=0, Total=1560 [2018-12-03 17:40:42,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 17:40:42,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-12-03 17:40:42,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-03 17:40:42,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-12-03 17:40:42,458 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 68 [2018-12-03 17:40:42,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:42,458 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-12-03 17:40:42,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 17:40:42,458 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-12-03 17:40:42,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-03 17:40:42,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:42,459 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 16, 1, 1, 1, 1] [2018-12-03 17:40:42,459 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:42,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:42,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1105222179, now seen corresponding path program 23 times [2018-12-03 17:40:42,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:42,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:42,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:42,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:42,461 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 306 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:42,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:42,943 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:42,943 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:42,943 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:40:42,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:42,943 INFO 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 17:40:42,952 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:42,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:43,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-03 17:40:43,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:43,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:43,560 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 306 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:43,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 306 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:44,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:44,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 54 [2018-12-03 17:40:44,010 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:44,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-12-03 17:40:44,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-12-03 17:40:44,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=719, Invalid=2251, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:40:44,012 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 53 states. [2018-12-03 17:40:44,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:44,736 INFO L93 Difference]: Finished difference Result 113 states and 115 transitions. [2018-12-03 17:40:44,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-03 17:40:44,737 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 72 [2018-12-03 17:40:44,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:44,738 INFO L225 Difference]: With dead ends: 113 [2018-12-03 17:40:44,738 INFO L226 Difference]: Without dead ends: 75 [2018-12-03 17:40:44,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 92 SyntacticMatches, 32 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1716 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1311, Invalid=3659, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:40:44,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-03 17:40:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-12-03 17:40:44,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-03 17:40:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-12-03 17:40:44,748 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2018-12-03 17:40:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:44,748 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-12-03 17:40:44,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-12-03 17:40:44,749 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-12-03 17:40:44,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-03 17:40:44,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:44,749 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-12-03 17:40:44,750 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:44,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:44,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1247455519, now seen corresponding path program 24 times [2018-12-03 17:40:44,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:44,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:44,751 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:44,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:44,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:44,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:45,497 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 306 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:45,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:45,497 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:45,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:45,498 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:40:45,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:45,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 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 17:40:45,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:45,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:45,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:45,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:45,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:46,096 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 306 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:46,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:46,496 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 306 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:46,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:46,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 53 [2018-12-03 17:40:46,516 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:46,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:40:46,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:40:46,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2179, Unknown=0, NotChecked=0, Total=2862 [2018-12-03 17:40:46,518 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 54 states. [2018-12-03 17:40:46,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:46,921 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-12-03 17:40:46,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 17:40:46,922 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 74 [2018-12-03 17:40:46,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:46,922 INFO L225 Difference]: With dead ends: 115 [2018-12-03 17:40:46,923 INFO L226 Difference]: Without dead ends: 77 [2018-12-03 17:40:46,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 95 SyntacticMatches, 35 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1685 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1312, Invalid=3658, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 17:40:46,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-03 17:40:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-12-03 17:40:46,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-12-03 17:40:46,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-12-03 17:40:46,933 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-12-03 17:40:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:46,934 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-12-03 17:40:46,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:40:46,934 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-12-03 17:40:46,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-03 17:40:46,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:46,935 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-12-03 17:40:46,935 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:46,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:46,935 INFO L82 PathProgramCache]: Analyzing trace with hash 494741787, now seen corresponding path program 25 times [2018-12-03 17:40:46,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:46,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:46,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:46,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:47,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:47,321 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:47,321 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:47,322 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:40:47,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:47,322 INFO 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 17:40:47,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:47,331 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:47,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:47,399 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:47,469 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:47,469 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:47,756 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 342 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:47,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:47,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 24 [2018-12-03 17:40:47,775 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:47,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-03 17:40:47,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-03 17:40:47,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2018-12-03 17:40:47,776 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 24 states. [2018-12-03 17:40:48,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:48,158 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2018-12-03 17:40:48,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-03 17:40:48,158 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 76 [2018-12-03 17:40:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:48,159 INFO L225 Difference]: With dead ends: 84 [2018-12-03 17:40:48,159 INFO L226 Difference]: Without dead ends: 82 [2018-12-03 17:40:48,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 132 SyntacticMatches, 34 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 776 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=715, Invalid=1177, Unknown=0, NotChecked=0, Total=1892 [2018-12-03 17:40:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-03 17:40:48,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-12-03 17:40:48,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-12-03 17:40:48,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-12-03 17:40:48,169 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 76 [2018-12-03 17:40:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:48,169 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-12-03 17:40:48,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-03 17:40:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-12-03 17:40:48,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-12-03 17:40:48,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:48,170 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-12-03 17:40:48,170 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:48,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:48,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1564313103, now seen corresponding path program 26 times [2018-12-03 17:40:48,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:48,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:48,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:48,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:48,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:49,344 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 380 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:49,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:49,345 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:49,345 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:49,345 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:49,345 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:49,345 INFO 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 17:40:49,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:49,354 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:49,435 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2018-12-03 17:40:49,435 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:49,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 380 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:50,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 380 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:50,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:50,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 60 [2018-12-03 17:40:50,789 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:50,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-12-03 17:40:50,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-12-03 17:40:50,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=2781, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:40:50,791 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 59 states. [2018-12-03 17:40:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:51,246 INFO L93 Difference]: Finished difference Result 125 states and 127 transitions. [2018-12-03 17:40:51,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-03 17:40:51,246 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 80 [2018-12-03 17:40:51,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:51,247 INFO L225 Difference]: With dead ends: 125 [2018-12-03 17:40:51,247 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 17:40:51,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 102 SyntacticMatches, 36 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2146 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1617, Invalid=4545, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:40:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 17:40:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-12-03 17:40:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-12-03 17:40:51,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-12-03 17:40:51,257 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-12-03 17:40:51,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:51,257 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-12-03 17:40:51,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-12-03 17:40:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-12-03 17:40:51,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 17:40:51,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:51,259 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-12-03 17:40:51,259 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:51,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:51,259 INFO L82 PathProgramCache]: Analyzing trace with hash 417798411, now seen corresponding path program 27 times [2018-12-03 17:40:51,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:51,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:51,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:51,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:51,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:51,936 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 380 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:51,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:51,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:51,936 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:51,936 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:40:51,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:51,937 INFO 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 17:40:51,946 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:51,946 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:52,021 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:52,021 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:52,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 380 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:52,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:53,355 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 380 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:53,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:53,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 59 [2018-12-03 17:40:53,376 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:53,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:40:53,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:40:53,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=839, Invalid=2701, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:40:53,377 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 60 states. [2018-12-03 17:40:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:53,914 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-12-03 17:40:53,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-03 17:40:53,914 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 82 [2018-12-03 17:40:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:53,915 INFO L225 Difference]: With dead ends: 127 [2018-12-03 17:40:53,915 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 17:40:53,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 105 SyntacticMatches, 39 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2111 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1618, Invalid=4544, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:40:53,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 17:40:53,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 17:40:53,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 17:40:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-12-03 17:40:53,926 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 82 [2018-12-03 17:40:53,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:53,926 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-12-03 17:40:53,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:40:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-12-03 17:40:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-03 17:40:53,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:53,927 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 19, 1, 1, 1, 1] [2018-12-03 17:40:53,927 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:53,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:53,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1871192825, now seen corresponding path program 28 times [2018-12-03 17:40:53,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:53,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:53,928 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:53,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:53,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 420 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:54,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:54,290 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:54,290 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:54,290 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:40:54,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:54,290 INFO 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 17:40:54,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:54,300 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:40:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:54,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 420 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:54,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 420 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:54,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:54,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 26 [2018-12-03 17:40:54,729 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:54,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-03 17:40:54,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-03 17:40:54,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=397, Unknown=0, NotChecked=0, Total=702 [2018-12-03 17:40:54,730 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 26 states. [2018-12-03 17:40:55,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:55,344 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2018-12-03 17:40:55,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-03 17:40:55,345 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-12-03 17:40:55,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:55,345 INFO L225 Difference]: With dead ends: 92 [2018-12-03 17:40:55,345 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 17:40:55,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 146 SyntacticMatches, 38 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 942 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=852, Invalid=1404, Unknown=0, NotChecked=0, Total=2256 [2018-12-03 17:40:55,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 17:40:55,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-12-03 17:40:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-03 17:40:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-12-03 17:40:55,354 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 84 [2018-12-03 17:40:55,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:55,354 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-12-03 17:40:55,354 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-03 17:40:55,354 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-12-03 17:40:55,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-03 17:40:55,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:55,355 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 20, 1, 1, 1, 1] [2018-12-03 17:40:55,355 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:55,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:55,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1432067077, now seen corresponding path program 29 times [2018-12-03 17:40:55,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:55,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:55,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:40:55,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:55,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:55,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:56,061 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 462 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:56,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:56,062 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:56,062 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:56,062 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:40:56,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:56,062 INFO 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 17:40:56,070 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:40:56,071 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:40:56,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-12-03 17:40:56,249 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:56,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:40:57,056 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 462 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:57,056 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:40:57,627 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 462 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:57,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:40:57,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 66 [2018-12-03 17:40:57,648 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:40:57,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-12-03 17:40:57,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-12-03 17:40:57,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=3367, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:40:57,650 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 65 states. [2018-12-03 17:40:58,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:40:58,216 INFO L93 Difference]: Finished difference Result 137 states and 139 transitions. [2018-12-03 17:40:58,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-03 17:40:58,216 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 88 [2018-12-03 17:40:58,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:40:58,217 INFO L225 Difference]: With dead ends: 137 [2018-12-03 17:40:58,217 INFO L226 Difference]: Without dead ends: 91 [2018-12-03 17:40:58,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 112 SyntacticMatches, 40 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1955, Invalid=5527, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 17:40:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-03 17:40:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-03 17:40:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 17:40:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-12-03 17:40:58,227 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2018-12-03 17:40:58,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:40:58,227 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-12-03 17:40:58,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-12-03 17:40:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-12-03 17:40:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-03 17:40:58,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:40:58,227 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-12-03 17:40:58,228 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:40:58,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:40:58,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1476838665, now seen corresponding path program 30 times [2018-12-03 17:40:58,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:40:58,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:58,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:40:58,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:40:58,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:40:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:40:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 462 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:40:59,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:59,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:40:59,123 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:40:59,123 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:40:59,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:40:59,123 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:40:59,133 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:40:59,133 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:40:59,214 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:40:59,214 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:40:59,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 462 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:00,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:00,992 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 462 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:01,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:01,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 65 [2018-12-03 17:41:01,012 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:01,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:41:01,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:41:01,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1011, Invalid=3279, Unknown=0, NotChecked=0, Total=4290 [2018-12-03 17:41:01,014 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 66 states. [2018-12-03 17:41:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:01,621 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-12-03 17:41:01,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-03 17:41:01,621 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 90 [2018-12-03 17:41:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:01,622 INFO L225 Difference]: With dead ends: 139 [2018-12-03 17:41:01,622 INFO L226 Difference]: Without dead ends: 93 [2018-12-03 17:41:01,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 115 SyntacticMatches, 43 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2585 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1956, Invalid=5526, Unknown=0, NotChecked=0, Total=7482 [2018-12-03 17:41:01,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-12-03 17:41:01,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-12-03 17:41:01,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-12-03 17:41:01,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-12-03 17:41:01,634 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-12-03 17:41:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:01,634 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-12-03 17:41:01,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:41:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-12-03 17:41:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-03 17:41:01,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:01,635 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-12-03 17:41:01,635 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:01,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:01,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1552661773, now seen corresponding path program 31 times [2018-12-03 17:41:01,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:01,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:01,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:01,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:01,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:02,008 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 506 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:02,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:02,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:02,009 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:02,009 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:41:02,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:02,009 INFO 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 17:41:02,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:02,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:02,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:02,205 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 506 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:02,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:02,556 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 506 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:02,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:02,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 28 [2018-12-03 17:41:02,576 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:02,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-03 17:41:02,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-03 17:41:02,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=456, Unknown=0, NotChecked=0, Total=812 [2018-12-03 17:41:02,577 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 28 states. [2018-12-03 17:41:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:03,017 INFO L93 Difference]: Finished difference Result 100 states and 102 transitions. [2018-12-03 17:41:03,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-03 17:41:03,018 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 92 [2018-12-03 17:41:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:03,019 INFO L225 Difference]: With dead ends: 100 [2018-12-03 17:41:03,019 INFO L226 Difference]: Without dead ends: 98 [2018-12-03 17:41:03,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 160 SyntacticMatches, 42 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1001, Invalid=1651, Unknown=0, NotChecked=0, Total=2652 [2018-12-03 17:41:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-03 17:41:03,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-12-03 17:41:03,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-03 17:41:03,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-12-03 17:41:03,033 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 92 [2018-12-03 17:41:03,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:03,033 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-12-03 17:41:03,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-03 17:41:03,034 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-12-03 17:41:03,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 17:41:03,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:03,034 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-12-03 17:41:03,035 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:03,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:03,035 INFO L82 PathProgramCache]: Analyzing trace with hash 2078536679, now seen corresponding path program 32 times [2018-12-03 17:41:03,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:03,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:03,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:03,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:03,036 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:03,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 552 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:03,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:03,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:03,908 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:03,908 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:03,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:03,908 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:41:03,916 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:03,916 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:04,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-03 17:41:04,032 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:04,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 552 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:04,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:06,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 552 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:06,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:06,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 72 [2018-12-03 17:41:06,169 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:06,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:41:06,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:41:06,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1247, Invalid=4009, Unknown=0, NotChecked=0, Total=5256 [2018-12-03 17:41:06,171 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 71 states. [2018-12-03 17:41:07,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:07,098 INFO L93 Difference]: Finished difference Result 149 states and 151 transitions. [2018-12-03 17:41:07,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-03 17:41:07,098 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 96 [2018-12-03 17:41:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:07,099 INFO L225 Difference]: With dead ends: 149 [2018-12-03 17:41:07,099 INFO L226 Difference]: Without dead ends: 99 [2018-12-03 17:41:07,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 122 SyntacticMatches, 44 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3150 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2325, Invalid=6605, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 17:41:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-03 17:41:07,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-12-03 17:41:07,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-03 17:41:07,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-12-03 17:41:07,111 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-12-03 17:41:07,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:07,112 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-12-03 17:41:07,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:41:07,112 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-12-03 17:41:07,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-03 17:41:07,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:07,112 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-12-03 17:41:07,112 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:07,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:07,113 INFO L82 PathProgramCache]: Analyzing trace with hash 224399075, now seen corresponding path program 33 times [2018-12-03 17:41:07,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:07,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:07,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:07,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:07,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 552 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:07,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:07,995 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:07,995 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:07,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 17:41:07,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:07,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 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 17:41:08,004 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:08,004 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:08,076 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:08,077 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:08,081 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:08,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 552 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:08,960 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:09,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 552 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:09,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:09,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 71 [2018-12-03 17:41:09,709 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:09,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-03 17:41:09,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-03 17:41:09,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1199, Invalid=3913, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:41:09,710 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 72 states. [2018-12-03 17:41:10,646 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-03 17:41:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:11,037 INFO L93 Difference]: Finished difference Result 151 states and 153 transitions. [2018-12-03 17:41:11,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-03 17:41:11,037 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 98 [2018-12-03 17:41:11,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:11,038 INFO L225 Difference]: With dead ends: 151 [2018-12-03 17:41:11,038 INFO L226 Difference]: Without dead ends: 101 [2018-12-03 17:41:11,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 125 SyntacticMatches, 47 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3107 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2326, Invalid=6604, Unknown=0, NotChecked=0, Total=8930 [2018-12-03 17:41:11,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-03 17:41:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-12-03 17:41:11,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-03 17:41:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2018-12-03 17:41:11,049 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 98 [2018-12-03 17:41:11,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:11,050 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2018-12-03 17:41:11,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-03 17:41:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2018-12-03 17:41:11,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 17:41:11,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:11,050 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 23, 1, 1, 1, 1] [2018-12-03 17:41:11,050 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:11,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:11,051 INFO L82 PathProgramCache]: Analyzing trace with hash 809589471, now seen corresponding path program 34 times [2018-12-03 17:41:11,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:11,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:11,051 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:11,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:11,052 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 600 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:11,629 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:11,629 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:11,629 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:11,630 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:11,630 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:11,630 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:41:11,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:11,641 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:11,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:11,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 600 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:11,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 600 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:12,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:12,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 30 [2018-12-03 17:41:12,563 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:12,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-03 17:41:12,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-03 17:41:12,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=519, Unknown=0, NotChecked=0, Total=930 [2018-12-03 17:41:12,564 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 30 states. [2018-12-03 17:41:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:13,061 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2018-12-03 17:41:13,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-03 17:41:13,062 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 100 [2018-12-03 17:41:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:13,063 INFO L225 Difference]: With dead ends: 108 [2018-12-03 17:41:13,063 INFO L226 Difference]: Without dead ends: 106 [2018-12-03 17:41:13,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 174 SyntacticMatches, 46 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1162, Invalid=1918, Unknown=0, NotChecked=0, Total=3080 [2018-12-03 17:41:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-03 17:41:13,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-12-03 17:41:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-03 17:41:13,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-12-03 17:41:13,077 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 100 [2018-12-03 17:41:13,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:13,077 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-12-03 17:41:13,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-03 17:41:13,077 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-12-03 17:41:13,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-03 17:41:13,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:13,078 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 24, 1, 1, 1, 1] [2018-12-03 17:41:13,078 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:13,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:13,079 INFO L82 PathProgramCache]: Analyzing trace with hash 726349267, now seen corresponding path program 35 times [2018-12-03 17:41:13,079 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:13,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:13,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:13,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:13,080 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 650 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:14,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:14,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:14,631 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:14,631 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:14,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:14,631 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:41:14,640 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:14,640 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:14,739 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2018-12-03 17:41:14,740 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:14,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:15,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 650 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:15,979 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:16,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 650 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:16,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:16,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 78 [2018-12-03 17:41:16,866 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:16,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:41:16,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:41:16,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1455, Invalid=4707, Unknown=0, NotChecked=0, Total=6162 [2018-12-03 17:41:16,867 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 77 states. [2018-12-03 17:41:17,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:17,579 INFO L93 Difference]: Finished difference Result 161 states and 163 transitions. [2018-12-03 17:41:17,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-03 17:41:17,579 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 104 [2018-12-03 17:41:17,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:17,580 INFO L225 Difference]: With dead ends: 161 [2018-12-03 17:41:17,580 INFO L226 Difference]: Without dead ends: 107 [2018-12-03 17:41:17,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 132 SyntacticMatches, 48 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3724 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2727, Invalid=7779, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 17:41:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-03 17:41:17,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-12-03 17:41:17,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-12-03 17:41:17,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-12-03 17:41:17,591 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2018-12-03 17:41:17,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:17,591 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-12-03 17:41:17,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:41:17,592 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-12-03 17:41:17,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-12-03 17:41:17,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:17,592 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-12-03 17:41:17,593 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:17,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:17,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1735038159, now seen corresponding path program 36 times [2018-12-03 17:41:17,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:17,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:17,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:17,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:18,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:18,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:18,942 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:18,942 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:18,943 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:41:18,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:18,943 INFO 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 17:41:18,951 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:18,951 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:19,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:19,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:19,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:20,121 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:21,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 650 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:21,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:21,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 77 [2018-12-03 17:41:21,290 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:21,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-03 17:41:21,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-03 17:41:21,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1403, Invalid=4603, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:41:21,291 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 78 states. [2018-12-03 17:41:22,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:22,505 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-12-03 17:41:22,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-03 17:41:22,505 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 106 [2018-12-03 17:41:22,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:22,506 INFO L225 Difference]: With dead ends: 163 [2018-12-03 17:41:22,506 INFO L226 Difference]: Without dead ends: 109 [2018-12-03 17:41:22,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 135 SyntacticMatches, 51 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3677 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=2728, Invalid=7778, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 17:41:22,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-03 17:41:22,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-12-03 17:41:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-03 17:41:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-12-03 17:41:22,518 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-12-03 17:41:22,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:22,518 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-12-03 17:41:22,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-03 17:41:22,518 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-12-03 17:41:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-03 17:41:22,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:22,519 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-12-03 17:41:22,519 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:22,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:22,519 INFO L82 PathProgramCache]: Analyzing trace with hash 422454475, now seen corresponding path program 37 times [2018-12-03 17:41:22,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:22,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:22,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:22,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:22,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:23,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 702 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:23,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:23,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:23,579 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:23,579 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:41:23,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:23,579 INFO 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 17:41:23,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:23,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:23,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:23,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:23,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 702 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:23,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:24,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 702 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:24,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:24,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 32 [2018-12-03 17:41:24,405 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:24,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-03 17:41:24,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-03 17:41:24,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=586, Unknown=0, NotChecked=0, Total=1056 [2018-12-03 17:41:24,406 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 32 states. [2018-12-03 17:41:24,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:24,951 INFO L93 Difference]: Finished difference Result 116 states and 118 transitions. [2018-12-03 17:41:24,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-03 17:41:24,951 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 108 [2018-12-03 17:41:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:24,952 INFO L225 Difference]: With dead ends: 116 [2018-12-03 17:41:24,952 INFO L226 Difference]: Without dead ends: 114 [2018-12-03 17:41:24,953 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 188 SyntacticMatches, 50 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1335, Invalid=2205, Unknown=0, NotChecked=0, Total=3540 [2018-12-03 17:41:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-12-03 17:41:24,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-12-03 17:41:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-12-03 17:41:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-12-03 17:41:24,968 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 108 [2018-12-03 17:41:24,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:24,969 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-12-03 17:41:24,969 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-03 17:41:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-12-03 17:41:24,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-03 17:41:24,970 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:24,970 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-12-03 17:41:24,970 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:24,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:24,970 INFO L82 PathProgramCache]: Analyzing trace with hash -609670721, now seen corresponding path program 38 times [2018-12-03 17:41:24,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:24,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:24,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:24,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:24,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:24,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 756 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:26,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:26,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:26,335 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:26,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:26,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:26,335 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:41:26,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:26,343 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:26,464 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-12-03 17:41:26,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:26,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:27,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 756 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:27,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:28,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 756 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:28,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:28,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 84 [2018-12-03 17:41:28,754 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:28,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-12-03 17:41:28,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-12-03 17:41:28,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1679, Invalid=5461, Unknown=0, NotChecked=0, Total=7140 [2018-12-03 17:41:28,755 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 83 states. [2018-12-03 17:41:29,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:29,808 INFO L93 Difference]: Finished difference Result 173 states and 175 transitions. [2018-12-03 17:41:29,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-03 17:41:29,808 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 112 [2018-12-03 17:41:29,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:29,809 INFO L225 Difference]: With dead ends: 173 [2018-12-03 17:41:29,809 INFO L226 Difference]: Without dead ends: 115 [2018-12-03 17:41:29,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 142 SyntacticMatches, 52 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4346 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3161, Invalid=9049, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 17:41:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-12-03 17:41:29,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-12-03 17:41:29,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-03 17:41:29,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-12-03 17:41:29,822 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-12-03 17:41:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:29,822 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-12-03 17:41:29,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-12-03 17:41:29,822 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-12-03 17:41:29,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-03 17:41:29,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:29,823 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-12-03 17:41:29,823 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:29,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:29,824 INFO L82 PathProgramCache]: Analyzing trace with hash -1662530373, now seen corresponding path program 39 times [2018-12-03 17:41:29,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:29,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:29,825 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:29,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:29,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 756 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:31,029 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:31,029 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:31,029 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:31,030 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:41:31,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:31,030 INFO 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 17:41:31,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:31,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:31,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:31,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:31,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 756 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:33,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:33,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 756 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:34,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:34,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 83 [2018-12-03 17:41:34,001 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:34,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-03 17:41:34,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-03 17:41:34,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1623, Invalid=5349, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:41:34,002 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 84 states. [2018-12-03 17:41:34,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:34,924 INFO L93 Difference]: Finished difference Result 175 states and 177 transitions. [2018-12-03 17:41:34,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-03 17:41:34,924 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 114 [2018-12-03 17:41:34,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:34,925 INFO L225 Difference]: With dead ends: 175 [2018-12-03 17:41:34,925 INFO L226 Difference]: Without dead ends: 117 [2018-12-03 17:41:34,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 145 SyntacticMatches, 55 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4295 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3162, Invalid=9048, Unknown=0, NotChecked=0, Total=12210 [2018-12-03 17:41:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-12-03 17:41:34,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-12-03 17:41:34,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-03 17:41:34,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-12-03 17:41:34,938 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 114 [2018-12-03 17:41:34,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:34,938 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-12-03 17:41:34,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-03 17:41:34,938 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-12-03 17:41:34,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-12-03 17:41:34,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:34,939 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 27, 1, 1, 1, 1] [2018-12-03 17:41:34,939 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:34,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:34,940 INFO L82 PathProgramCache]: Analyzing trace with hash 151625911, now seen corresponding path program 40 times [2018-12-03 17:41:34,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:34,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:34,940 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:34,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:34,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:35,461 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 812 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:35,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:35,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:35,461 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:35,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:35,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:35,461 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:41:35,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:35,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:35,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:35,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 812 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:35,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:36,577 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 812 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:36,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:36,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 34 [2018-12-03 17:41:36,597 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:36,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-03 17:41:36,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-03 17:41:36,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=533, Invalid=657, Unknown=0, NotChecked=0, Total=1190 [2018-12-03 17:41:36,598 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 34 states. [2018-12-03 17:41:37,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:37,213 INFO L93 Difference]: Finished difference Result 124 states and 126 transitions. [2018-12-03 17:41:37,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-03 17:41:37,213 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 116 [2018-12-03 17:41:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:37,215 INFO L225 Difference]: With dead ends: 124 [2018-12-03 17:41:37,215 INFO L226 Difference]: Without dead ends: 122 [2018-12-03 17:41:37,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 202 SyntacticMatches, 54 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1520, Invalid=2512, Unknown=0, NotChecked=0, Total=4032 [2018-12-03 17:41:37,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-03 17:41:37,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-12-03 17:41:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-03 17:41:37,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 122 transitions. [2018-12-03 17:41:37,234 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 122 transitions. Word has length 116 [2018-12-03 17:41:37,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:37,235 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 122 transitions. [2018-12-03 17:41:37,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-03 17:41:37,235 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2018-12-03 17:41:37,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-03 17:41:37,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:37,236 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 28, 1, 1, 1, 1] [2018-12-03 17:41:37,236 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:37,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:37,236 INFO L82 PathProgramCache]: Analyzing trace with hash 944557995, now seen corresponding path program 41 times [2018-12-03 17:41:37,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:37,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:37,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:37,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 870 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:38,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:38,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:38,832 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:38,832 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:41:38,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:38,832 INFO 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 17:41:38,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:38,841 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:39,005 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-03 17:41:39,005 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:39,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:40,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 870 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:40,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 870 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:41,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:41,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 90 [2018-12-03 17:41:41,984 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:41,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-12-03 17:41:41,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-12-03 17:41:41,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1919, Invalid=6271, Unknown=0, NotChecked=0, Total=8190 [2018-12-03 17:41:41,985 INFO L87 Difference]: Start difference. First operand 121 states and 122 transitions. Second operand 89 states. [2018-12-03 17:41:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:43,058 INFO L93 Difference]: Finished difference Result 185 states and 187 transitions. [2018-12-03 17:41:43,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-03 17:41:43,058 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 120 [2018-12-03 17:41:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:43,059 INFO L225 Difference]: With dead ends: 185 [2018-12-03 17:41:43,059 INFO L226 Difference]: Without dead ends: 123 [2018-12-03 17:41:43,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 152 SyntacticMatches, 56 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3627, Invalid=10415, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 17:41:43,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-12-03 17:41:43,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-12-03 17:41:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-12-03 17:41:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-12-03 17:41:43,075 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 120 [2018-12-03 17:41:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:43,075 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-12-03 17:41:43,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-12-03 17:41:43,076 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-12-03 17:41:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-12-03 17:41:43,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:43,076 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-12-03 17:41:43,077 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:43,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:43,077 INFO L82 PathProgramCache]: Analyzing trace with hash 489076391, now seen corresponding path program 42 times [2018-12-03 17:41:43,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:43,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:43,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:43,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:43,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:43,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:44,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:44,278 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:44,278 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:44,278 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:41:44,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:44,279 INFO 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 17:41:44,291 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:44,292 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:44,384 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:44,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:44,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:45,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:45,823 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 870 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:47,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:47,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 89 [2018-12-03 17:41:47,309 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:47,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-03 17:41:47,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-03 17:41:47,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1859, Invalid=6151, Unknown=0, NotChecked=0, Total=8010 [2018-12-03 17:41:47,310 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 90 states. [2018-12-03 17:41:48,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:48,298 INFO L93 Difference]: Finished difference Result 187 states and 189 transitions. [2018-12-03 17:41:48,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-03 17:41:48,298 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 122 [2018-12-03 17:41:48,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:48,299 INFO L225 Difference]: With dead ends: 187 [2018-12-03 17:41:48,299 INFO L226 Difference]: Without dead ends: 125 [2018-12-03 17:41:48,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 155 SyntacticMatches, 59 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=3628, Invalid=10414, Unknown=0, NotChecked=0, Total=14042 [2018-12-03 17:41:48,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-03 17:41:48,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-12-03 17:41:48,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-12-03 17:41:48,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-12-03 17:41:48,315 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 122 [2018-12-03 17:41:48,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:48,315 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-12-03 17:41:48,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-03 17:41:48,316 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-12-03 17:41:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-12-03 17:41:48,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:48,316 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 29, 1, 1, 1, 1] [2018-12-03 17:41:48,317 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:48,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:48,317 INFO L82 PathProgramCache]: Analyzing trace with hash 857919139, now seen corresponding path program 43 times [2018-12-03 17:41:48,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:48,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:48,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:48,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:48,318 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:48,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:48,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 930 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:48,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:48,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:48,876 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:48,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:41:48,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:48,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:41:48,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:48,886 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:41:48,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:48,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:49,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 930 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:49,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:49,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 930 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:49,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:49,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 36 [2018-12-03 17:41:49,835 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:49,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-03 17:41:49,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-03 17:41:49,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=732, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 17:41:49,836 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 36 states. [2018-12-03 17:41:50,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:50,492 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2018-12-03 17:41:50,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-03 17:41:50,492 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 124 [2018-12-03 17:41:50,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:50,494 INFO L225 Difference]: With dead ends: 132 [2018-12-03 17:41:50,494 INFO L226 Difference]: Without dead ends: 130 [2018-12-03 17:41:50,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 340 GetRequests, 216 SyntacticMatches, 58 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2012 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1717, Invalid=2839, Unknown=0, NotChecked=0, Total=4556 [2018-12-03 17:41:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-03 17:41:50,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-12-03 17:41:50,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-12-03 17:41:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-12-03 17:41:50,509 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 124 [2018-12-03 17:41:50,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:50,509 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-12-03 17:41:50,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-03 17:41:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-12-03 17:41:50,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-12-03 17:41:50,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:50,510 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-12-03 17:41:50,510 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:50,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:50,510 INFO L82 PathProgramCache]: Analyzing trace with hash 889530263, now seen corresponding path program 44 times [2018-12-03 17:41:50,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:50,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:41:50,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:50,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:52,219 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 992 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:52,219 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:52,219 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:52,220 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:52,220 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:41:52,220 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:52,220 INFO 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 17:41:52,229 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:41:52,229 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:41:52,366 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-12-03 17:41:52,366 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:52,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 992 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:53,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:41:55,053 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 992 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:55,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:41:55,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 96 [2018-12-03 17:41:55,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:41:55,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-12-03 17:41:55,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-12-03 17:41:55,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2175, Invalid=7137, Unknown=0, NotChecked=0, Total=9312 [2018-12-03 17:41:55,074 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 95 states. [2018-12-03 17:41:56,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:41:56,037 INFO L93 Difference]: Finished difference Result 197 states and 199 transitions. [2018-12-03 17:41:56,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-03 17:41:56,037 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 128 [2018-12-03 17:41:56,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:41:56,038 INFO L225 Difference]: With dead ends: 197 [2018-12-03 17:41:56,038 INFO L226 Difference]: Without dead ends: 131 [2018-12-03 17:41:56,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 162 SyntacticMatches, 60 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5734 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4125, Invalid=11877, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 17:41:56,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-03 17:41:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-12-03 17:41:56,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-12-03 17:41:56,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-12-03 17:41:56,055 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-12-03 17:41:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:41:56,055 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-12-03 17:41:56,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-12-03 17:41:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-12-03 17:41:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-12-03 17:41:56,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:41:56,056 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-12-03 17:41:56,056 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:41:56,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:41:56,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1611246957, now seen corresponding path program 45 times [2018-12-03 17:41:56,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:41:56,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:56,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:41:56,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:41:56,057 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:41:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:41:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 992 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:57,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:57,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:41:57,878 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:41:57,878 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:41:57,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:41:57,879 INFO 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 17:41:57,887 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:41:57,888 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:41:57,984 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:41:57,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:41:57,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:41:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 992 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:41:59,607 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 992 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:00,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:00,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 95 [2018-12-03 17:42:00,790 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:00,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-03 17:42:00,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-03 17:42:00,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2111, Invalid=7009, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:42:00,791 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 96 states. [2018-12-03 17:42:02,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:02,117 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-12-03 17:42:02,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-03 17:42:02,118 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 130 [2018-12-03 17:42:02,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:02,118 INFO L225 Difference]: With dead ends: 199 [2018-12-03 17:42:02,118 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 17:42:02,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 165 SyntacticMatches, 63 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5675 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=4126, Invalid=11876, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 17:42:02,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 17:42:02,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 17:42:02,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 17:42:02,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-12-03 17:42:02,133 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-12-03 17:42:02,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:02,134 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-12-03 17:42:02,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-03 17:42:02,134 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-12-03 17:42:02,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 17:42:02,134 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:02,134 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-12-03 17:42:02,135 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:02,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:02,135 INFO L82 PathProgramCache]: Analyzing trace with hash 323530383, now seen corresponding path program 46 times [2018-12-03 17:42:02,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:02,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:02,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:02,136 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:02,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1056 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:02,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:02,865 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:02,865 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:02,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:42:02,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:02,866 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:42:02,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:02,874 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:02,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:02,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:03,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1056 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:03,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:03,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 1056 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:03,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:03,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 35, 35] total 38 [2018-12-03 17:42:03,987 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:03,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 17:42:03,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 17:42:03,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=811, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 17:42:03,988 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 38 states. [2018-12-03 17:42:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:04,686 INFO L93 Difference]: Finished difference Result 140 states and 142 transitions. [2018-12-03 17:42:04,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-03 17:42:04,687 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 132 [2018-12-03 17:42:04,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:04,688 INFO L225 Difference]: With dead ends: 140 [2018-12-03 17:42:04,689 INFO L226 Difference]: Without dead ends: 138 [2018-12-03 17:42:04,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 230 SyntacticMatches, 62 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2274 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1926, Invalid=3186, Unknown=0, NotChecked=0, Total=5112 [2018-12-03 17:42:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-03 17:42:04,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-12-03 17:42:04,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-12-03 17:42:04,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 138 transitions. [2018-12-03 17:42:04,707 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 138 transitions. Word has length 132 [2018-12-03 17:42:04,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:04,708 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 138 transitions. [2018-12-03 17:42:04,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 17:42:04,708 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2018-12-03 17:42:04,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-12-03 17:42:04,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:04,708 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 32, 1, 1, 1, 1] [2018-12-03 17:42:04,709 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:04,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:04,709 INFO L82 PathProgramCache]: Analyzing trace with hash -836685437, now seen corresponding path program 47 times [2018-12-03 17:42:04,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:04,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:04,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:04,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:04,710 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:04,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 1122 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:06,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:06,229 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:06,229 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:06,229 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:42:06,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:06,229 INFO 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 17:42:06,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:06,238 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:06,397 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-12-03 17:42:06,397 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:06,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:08,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 1122 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:08,431 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:09,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 1122 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:09,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:09,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 102 [2018-12-03 17:42:09,936 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:09,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-12-03 17:42:09,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-12-03 17:42:09,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2447, Invalid=8059, Unknown=0, NotChecked=0, Total=10506 [2018-12-03 17:42:09,937 INFO L87 Difference]: Start difference. First operand 137 states and 138 transitions. Second operand 101 states. [2018-12-03 17:42:10,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:10,939 INFO L93 Difference]: Finished difference Result 209 states and 211 transitions. [2018-12-03 17:42:10,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-03 17:42:10,940 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 136 [2018-12-03 17:42:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:10,940 INFO L225 Difference]: With dead ends: 209 [2018-12-03 17:42:10,940 INFO L226 Difference]: Without dead ends: 139 [2018-12-03 17:42:10,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 172 SyntacticMatches, 64 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6500 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=4655, Invalid=13435, Unknown=0, NotChecked=0, Total=18090 [2018-12-03 17:42:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-03 17:42:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-03 17:42:10,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-03 17:42:10,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-12-03 17:42:10,959 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 136 [2018-12-03 17:42:10,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:10,960 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-12-03 17:42:10,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-12-03 17:42:10,960 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-12-03 17:42:10,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-03 17:42:10,960 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:10,960 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-12-03 17:42:10,961 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:10,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:10,961 INFO L82 PathProgramCache]: Analyzing trace with hash -442130305, now seen corresponding path program 48 times [2018-12-03 17:42:10,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:10,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:10,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:10,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:10,962 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:10,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1122 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:13,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:13,070 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:13,071 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:13,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 17:42:13,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:13,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 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 17:42:13,079 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:13,079 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:13,183 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:13,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:13,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:14,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1122 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:14,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1122 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:16,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:16,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 101 [2018-12-03 17:42:16,397 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:16,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-03 17:42:16,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-03 17:42:16,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2379, Invalid=7923, Unknown=0, NotChecked=0, Total=10302 [2018-12-03 17:42:16,398 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 102 states. [2018-12-03 17:42:17,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:17,885 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-12-03 17:42:17,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 17:42:17,885 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 138 [2018-12-03 17:42:17,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:17,886 INFO L225 Difference]: With dead ends: 211 [2018-12-03 17:42:17,886 INFO L226 Difference]: Without dead ends: 141 [2018-12-03 17:42:17,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 175 SyntacticMatches, 67 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6437 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=4656, Invalid=13434, Unknown=0, NotChecked=0, Total=18090 [2018-12-03 17:42:17,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-03 17:42:17,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-12-03 17:42:17,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-12-03 17:42:17,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-12-03 17:42:17,908 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-12-03 17:42:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:17,908 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-12-03 17:42:17,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-03 17:42:17,909 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-12-03 17:42:17,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-12-03 17:42:17,909 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:17,909 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-12-03 17:42:17,909 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:17,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:17,910 INFO L82 PathProgramCache]: Analyzing trace with hash 768229499, now seen corresponding path program 49 times [2018-12-03 17:42:17,910 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:17,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:17,911 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:17,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:17,911 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:17,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1190 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:18,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:18,579 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:18,579 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:18,579 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:42:18,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:18,579 INFO 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 17:42:18,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:18,588 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:18,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:19,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1190 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:19,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:20,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1190 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:20,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:20,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 40 [2018-12-03 17:42:20,389 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:20,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-03 17:42:20,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-03 17:42:20,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=746, Invalid=894, Unknown=0, NotChecked=0, Total=1640 [2018-12-03 17:42:20,390 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 40 states. [2018-12-03 17:42:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:21,180 INFO L93 Difference]: Finished difference Result 148 states and 150 transitions. [2018-12-03 17:42:21,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-03 17:42:21,182 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 140 [2018-12-03 17:42:21,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:21,183 INFO L225 Difference]: With dead ends: 148 [2018-12-03 17:42:21,183 INFO L226 Difference]: Without dead ends: 146 [2018-12-03 17:42:21,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 244 SyntacticMatches, 66 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2552 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2147, Invalid=3553, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:42:21,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-03 17:42:21,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-12-03 17:42:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-03 17:42:21,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-12-03 17:42:21,206 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 140 [2018-12-03 17:42:21,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:21,207 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-12-03 17:42:21,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-03 17:42:21,207 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-12-03 17:42:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-03 17:42:21,208 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:21,208 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 34, 1, 1, 1, 1] [2018-12-03 17:42:21,208 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:21,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:21,208 INFO L82 PathProgramCache]: Analyzing trace with hash -932188817, now seen corresponding path program 50 times [2018-12-03 17:42:21,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:21,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:21,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:21,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:21,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1260 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:23,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:23,157 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:23,157 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:23,158 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:42:23,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:23,158 INFO 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 17:42:23,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:23,169 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:23,338 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-03 17:42:23,339 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:23,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1260 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:25,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:26,903 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 1260 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:26,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:26,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 108 [2018-12-03 17:42:26,923 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:26,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-12-03 17:42:26,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-12-03 17:42:26,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2735, Invalid=9037, Unknown=0, NotChecked=0, Total=11772 [2018-12-03 17:42:26,924 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 107 states. [2018-12-03 17:42:28,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:28,489 INFO L93 Difference]: Finished difference Result 221 states and 223 transitions. [2018-12-03 17:42:28,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-03 17:42:28,490 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 144 [2018-12-03 17:42:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:28,490 INFO L225 Difference]: With dead ends: 221 [2018-12-03 17:42:28,491 INFO L226 Difference]: Without dead ends: 147 [2018-12-03 17:42:28,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 182 SyntacticMatches, 68 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7314 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5217, Invalid=15089, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 17:42:28,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-12-03 17:42:28,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-12-03 17:42:28,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-12-03 17:42:28,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-12-03 17:42:28,512 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 144 [2018-12-03 17:42:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:28,512 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-12-03 17:42:28,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-12-03 17:42:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-12-03 17:42:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-12-03 17:42:28,513 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:28,513 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 1, 1, 1, 1] [2018-12-03 17:42:28,513 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:28,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1996726379, now seen corresponding path program 51 times [2018-12-03 17:42:28,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:28,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:28,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:28,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:28,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1260 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:30,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:30,143 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:30,143 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:30,143 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:42:30,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:30,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:42:30,154 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:30,154 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:30,264 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:30,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:30,270 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:32,211 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1260 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:32,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:33,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1260 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:34,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:34,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 107 [2018-12-03 17:42:34,018 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:34,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-03 17:42:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-03 17:42:34,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2663, Invalid=8893, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:42:34,020 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 108 states. [2018-12-03 17:42:35,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:35,197 INFO L93 Difference]: Finished difference Result 223 states and 225 transitions. [2018-12-03 17:42:35,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-03 17:42:35,197 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 146 [2018-12-03 17:42:35,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:35,198 INFO L225 Difference]: With dead ends: 223 [2018-12-03 17:42:35,198 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 17:42:35,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 185 SyntacticMatches, 71 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7247 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=5218, Invalid=15088, Unknown=0, NotChecked=0, Total=20306 [2018-12-03 17:42:35,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 17:42:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-12-03 17:42:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-03 17:42:35,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 150 transitions. [2018-12-03 17:42:35,216 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 150 transitions. Word has length 146 [2018-12-03 17:42:35,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:35,216 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 150 transitions. [2018-12-03 17:42:35,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-03 17:42:35,216 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 150 transitions. [2018-12-03 17:42:35,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-12-03 17:42:35,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:35,217 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 35, 1, 1, 1, 1] [2018-12-03 17:42:35,217 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:35,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:35,217 INFO L82 PathProgramCache]: Analyzing trace with hash -814316441, now seen corresponding path program 52 times [2018-12-03 17:42:35,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:35,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:35,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:35,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:35,218 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:35,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:35,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:35,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:35,985 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:35,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:42:35,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:35,985 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:42:35,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:35,994 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:36,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:36,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:36,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:37,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2592 backedges. 1332 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:37,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:37,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 42 [2018-12-03 17:42:37,145 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:37,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-03 17:42:37,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-03 17:42:37,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=825, Invalid=981, Unknown=0, NotChecked=0, Total=1806 [2018-12-03 17:42:37,146 INFO L87 Difference]: Start difference. First operand 149 states and 150 transitions. Second operand 42 states. [2018-12-03 17:42:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:38,247 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2018-12-03 17:42:38,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-03 17:42:38,248 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 148 [2018-12-03 17:42:38,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:38,248 INFO L225 Difference]: With dead ends: 156 [2018-12-03 17:42:38,248 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 17:42:38,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 258 SyntacticMatches, 70 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2846 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2380, Invalid=3940, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:42:38,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 17:42:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-12-03 17:42:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-03 17:42:38,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-12-03 17:42:38,267 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 148 [2018-12-03 17:42:38,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:38,267 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-12-03 17:42:38,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-03 17:42:38,268 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-12-03 17:42:38,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-12-03 17:42:38,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:38,269 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 36, 1, 1, 1, 1] [2018-12-03 17:42:38,269 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:38,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:38,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1900043099, now seen corresponding path program 53 times [2018-12-03 17:42:38,269 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:38,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:38,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:38,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:38,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:40,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1406 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:40,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:40,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:40,008 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:40,008 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:42:40,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:40,009 INFO 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 17:42:40,018 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:40,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:40,199 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2018-12-03 17:42:40,199 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:40,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:42,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1406 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:42,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 2738 backedges. 1406 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:44,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:44,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 114 [2018-12-03 17:42:44,281 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:44,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-12-03 17:42:44,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-12-03 17:42:44,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3039, Invalid=10071, Unknown=0, NotChecked=0, Total=13110 [2018-12-03 17:42:44,282 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 113 states. [2018-12-03 17:42:45,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:45,722 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2018-12-03 17:42:45,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-03 17:42:45,722 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 152 [2018-12-03 17:42:45,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:45,723 INFO L225 Difference]: With dead ends: 233 [2018-12-03 17:42:45,723 INFO L226 Difference]: Without dead ends: 155 [2018-12-03 17:42:45,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 192 SyntacticMatches, 72 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8176 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5811, Invalid=16839, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 17:42:45,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-03 17:42:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-12-03 17:42:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-12-03 17:42:45,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-12-03 17:42:45,746 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 152 [2018-12-03 17:42:45,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:45,746 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-12-03 17:42:45,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-12-03 17:42:45,746 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-12-03 17:42:45,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-03 17:42:45,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:45,747 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 1, 1, 1, 1] [2018-12-03 17:42:45,747 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:45,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:45,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1700745815, now seen corresponding path program 54 times [2018-12-03 17:42:45,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:45,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:45,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:45,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:45,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:47,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1406 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:47,541 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:47,541 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:47,541 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:47,541 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:42:47,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:47,542 INFO 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 17:42:47,550 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:42:47,550 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:42:47,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:42:47,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:47,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:50,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1406 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:50,086 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2812 backedges. 1406 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:51,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:51,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 113 [2018-12-03 17:42:51,748 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:51,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-03 17:42:51,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-03 17:42:51,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2963, Invalid=9919, Unknown=0, NotChecked=0, Total=12882 [2018-12-03 17:42:51,749 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 114 states. [2018-12-03 17:42:53,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:53,571 INFO L93 Difference]: Finished difference Result 235 states and 237 transitions. [2018-12-03 17:42:53,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-03 17:42:53,571 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 154 [2018-12-03 17:42:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:53,572 INFO L225 Difference]: With dead ends: 235 [2018-12-03 17:42:53,572 INFO L226 Difference]: Without dead ends: 157 [2018-12-03 17:42:53,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 195 SyntacticMatches, 75 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8105 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=5812, Invalid=16838, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 17:42:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-12-03 17:42:53,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-12-03 17:42:53,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-03 17:42:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 158 transitions. [2018-12-03 17:42:53,591 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 158 transitions. Word has length 154 [2018-12-03 17:42:53,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:53,592 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 158 transitions. [2018-12-03 17:42:53,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-03 17:42:53,592 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 158 transitions. [2018-12-03 17:42:53,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-03 17:42:53,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:53,593 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 37, 1, 1, 1, 1] [2018-12-03 17:42:53,593 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:53,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:53,593 INFO L82 PathProgramCache]: Analyzing trace with hash -845383085, now seen corresponding path program 55 times [2018-12-03 17:42:53,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:53,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:53,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:42:53,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:53,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:53,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:54,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:54,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:54,339 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:54,339 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:54,339 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:42:54,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:54,339 INFO 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 17:42:54,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:54,348 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:42:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:54,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:42:54,570 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:54,570 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:42:55,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2888 backedges. 1482 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:55,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:42:55,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 41, 41] total 44 [2018-12-03 17:42:55,639 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:42:55,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-03 17:42:55,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-03 17:42:55,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=908, Invalid=1072, Unknown=0, NotChecked=0, Total=1980 [2018-12-03 17:42:55,640 INFO L87 Difference]: Start difference. First operand 157 states and 158 transitions. Second operand 44 states. [2018-12-03 17:42:56,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:42:56,565 INFO L93 Difference]: Finished difference Result 164 states and 166 transitions. [2018-12-03 17:42:56,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-03 17:42:56,566 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 156 [2018-12-03 17:42:56,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:42:56,566 INFO L225 Difference]: With dead ends: 164 [2018-12-03 17:42:56,566 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 17:42:56,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 272 SyntacticMatches, 74 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3156 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2625, Invalid=4347, Unknown=0, NotChecked=0, Total=6972 [2018-12-03 17:42:56,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 17:42:56,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-12-03 17:42:56,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-12-03 17:42:56,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-12-03 17:42:56,587 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 156 [2018-12-03 17:42:56,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:42:56,587 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-12-03 17:42:56,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-03 17:42:56,588 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-12-03 17:42:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-12-03 17:42:56,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:42:56,588 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 38, 1, 1, 1, 1] [2018-12-03 17:42:56,588 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:42:56,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:42:56,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1583446855, now seen corresponding path program 56 times [2018-12-03 17:42:56,589 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:42:56,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:56,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:42:56,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:42:56,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:42:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:42:58,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1560 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:42:58,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:58,798 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:42:58,798 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:42:58,799 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:42:58,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:42:58,799 INFO 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 17:42:58,807 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:42:58,807 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:42:58,991 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-12-03 17:42:58,991 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:42:58,996 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:01,316 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1560 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:01,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3042 backedges. 1560 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:03,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:03,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 120 [2018-12-03 17:43:03,421 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:03,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-12-03 17:43:03,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-12-03 17:43:03,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3359, Invalid=11161, Unknown=0, NotChecked=0, Total=14520 [2018-12-03 17:43:03,422 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 119 states. [2018-12-03 17:43:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:05,017 INFO L93 Difference]: Finished difference Result 245 states and 247 transitions. [2018-12-03 17:43:05,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-03 17:43:05,018 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 160 [2018-12-03 17:43:05,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:05,019 INFO L225 Difference]: With dead ends: 245 [2018-12-03 17:43:05,019 INFO L226 Difference]: Without dead ends: 163 [2018-12-03 17:43:05,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 202 SyntacticMatches, 76 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9086 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=6437, Invalid=18685, Unknown=0, NotChecked=0, Total=25122 [2018-12-03 17:43:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-12-03 17:43:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-12-03 17:43:05,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-03 17:43:05,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2018-12-03 17:43:05,040 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 160 [2018-12-03 17:43:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:05,040 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2018-12-03 17:43:05,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-12-03 17:43:05,041 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2018-12-03 17:43:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-03 17:43:05,041 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:05,041 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 39, 1, 1, 1, 1] [2018-12-03 17:43:05,041 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:05,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:05,042 INFO L82 PathProgramCache]: Analyzing trace with hash 176666179, now seen corresponding path program 57 times [2018-12-03 17:43:05,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:05,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:05,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:05,042 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:05,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1560 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:07,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:07,021 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:07,022 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:07,022 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:07,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:07,022 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:43:07,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:43:07,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:43:07,153 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:43:07,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:07,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:09,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1560 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:09,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1560 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:11,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:11,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 119 [2018-12-03 17:43:11,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:11,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-03 17:43:11,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-03 17:43:11,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3279, Invalid=11001, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:43:11,611 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand 120 states. [2018-12-03 17:43:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:13,286 INFO L93 Difference]: Finished difference Result 247 states and 249 transitions. [2018-12-03 17:43:13,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-03 17:43:13,286 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 162 [2018-12-03 17:43:13,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:13,287 INFO L225 Difference]: With dead ends: 247 [2018-12-03 17:43:13,287 INFO L226 Difference]: Without dead ends: 165 [2018-12-03 17:43:13,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 205 SyntacticMatches, 79 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9011 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=6438, Invalid=18684, Unknown=0, NotChecked=0, Total=25122 [2018-12-03 17:43:13,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-12-03 17:43:13,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-12-03 17:43:13,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-12-03 17:43:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-12-03 17:43:13,308 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 162 [2018-12-03 17:43:13,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:13,308 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-12-03 17:43:13,308 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-03 17:43:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-12-03 17:43:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-12-03 17:43:13,309 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:13,309 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 39, 1, 1, 1, 1] [2018-12-03 17:43:13,309 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:13,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:13,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1175134783, now seen corresponding path program 58 times [2018-12-03 17:43:13,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:13,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:13,327 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:13,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:13,328 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:14,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:14,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:14,359 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:14,360 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:14,360 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:43:14,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:14,360 INFO 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 17:43:14,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:14,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:43:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:14,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:14,561 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:14,561 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3200 backedges. 1640 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:15,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:15,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 46 [2018-12-03 17:43:15,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:15,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-03 17:43:15,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-03 17:43:15,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=995, Invalid=1167, Unknown=0, NotChecked=0, Total=2162 [2018-12-03 17:43:15,698 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 46 states. [2018-12-03 17:43:16,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:16,674 INFO L93 Difference]: Finished difference Result 172 states and 174 transitions. [2018-12-03 17:43:16,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-03 17:43:16,674 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 164 [2018-12-03 17:43:16,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:16,675 INFO L225 Difference]: With dead ends: 172 [2018-12-03 17:43:16,675 INFO L226 Difference]: Without dead ends: 170 [2018-12-03 17:43:16,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 286 SyntacticMatches, 78 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3482 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2882, Invalid=4774, Unknown=0, NotChecked=0, Total=7656 [2018-12-03 17:43:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-03 17:43:16,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-12-03 17:43:16,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-03 17:43:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 170 transitions. [2018-12-03 17:43:16,700 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 170 transitions. Word has length 164 [2018-12-03 17:43:16,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:16,700 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 170 transitions. [2018-12-03 17:43:16,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-03 17:43:16,700 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 170 transitions. [2018-12-03 17:43:16,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-03 17:43:16,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:16,701 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 40, 1, 1, 1, 1] [2018-12-03 17:43:16,702 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:16,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:16,702 INFO L82 PathProgramCache]: Analyzing trace with hash 773999923, now seen corresponding path program 59 times [2018-12-03 17:43:16,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:16,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:16,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:16,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:16,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 1722 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:19,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:19,260 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:19,260 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:19,260 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:43:19,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:19,260 INFO 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 17:43:19,269 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:43:19,269 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:43:19,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-03 17:43:19,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:19,483 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:22,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 1722 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:22,024 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:24,359 INFO L134 CoverageAnalysis]: Checked inductivity of 3362 backedges. 1722 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:24,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:24,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 126 [2018-12-03 17:43:24,379 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:24,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-12-03 17:43:24,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-12-03 17:43:24,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3695, Invalid=12307, Unknown=0, NotChecked=0, Total=16002 [2018-12-03 17:43:24,381 INFO L87 Difference]: Start difference. First operand 169 states and 170 transitions. Second operand 125 states. [2018-12-03 17:43:26,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:26,145 INFO L93 Difference]: Finished difference Result 257 states and 259 transitions. [2018-12-03 17:43:26,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-03 17:43:26,145 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 168 [2018-12-03 17:43:26,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:26,146 INFO L225 Difference]: With dead ends: 257 [2018-12-03 17:43:26,146 INFO L226 Difference]: Without dead ends: 171 [2018-12-03 17:43:26,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 457 GetRequests, 212 SyntacticMatches, 80 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10044 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=7095, Invalid=20627, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 17:43:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-12-03 17:43:26,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-12-03 17:43:26,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-12-03 17:43:26,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-12-03 17:43:26,175 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 168 [2018-12-03 17:43:26,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:26,175 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-12-03 17:43:26,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-12-03 17:43:26,176 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-12-03 17:43:26,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-12-03 17:43:26,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:26,177 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 1, 1, 1, 1] [2018-12-03 17:43:26,177 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:26,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:26,177 INFO L82 PathProgramCache]: Analyzing trace with hash -926168017, now seen corresponding path program 60 times [2018-12-03 17:43:26,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:26,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:26,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:26,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:26,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:28,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1722 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:28,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:28,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:28,343 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:28,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:28,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:28,343 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:43:28,352 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:43:28,352 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:43:28,479 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:43:28,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:28,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1722 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:31,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:33,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3444 backedges. 1722 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:33,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:33,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 125 [2018-12-03 17:43:33,645 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:33,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-03 17:43:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-03 17:43:33,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3611, Invalid=12139, Unknown=0, NotChecked=0, Total=15750 [2018-12-03 17:43:33,647 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 126 states. [2018-12-03 17:43:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:35,564 INFO L93 Difference]: Finished difference Result 259 states and 261 transitions. [2018-12-03 17:43:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-03 17:43:35,564 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 170 [2018-12-03 17:43:35,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:35,565 INFO L225 Difference]: With dead ends: 259 [2018-12-03 17:43:35,565 INFO L226 Difference]: Without dead ends: 173 [2018-12-03 17:43:35,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 215 SyntacticMatches, 83 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9965 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=7096, Invalid=20626, Unknown=0, NotChecked=0, Total=27722 [2018-12-03 17:43:35,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-03 17:43:35,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-12-03 17:43:35,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-12-03 17:43:35,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 174 transitions. [2018-12-03 17:43:35,594 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 174 transitions. Word has length 170 [2018-12-03 17:43:35,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:35,594 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 174 transitions. [2018-12-03 17:43:35,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-03 17:43:35,594 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 174 transitions. [2018-12-03 17:43:35,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-12-03 17:43:35,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:35,595 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 41, 1, 1, 1, 1] [2018-12-03 17:43:35,595 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:35,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:35,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1594981419, now seen corresponding path program 61 times [2018-12-03 17:43:35,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:35,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:35,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:35,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:35,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:35,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:36,567 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 1806 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:36,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:36,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:36,568 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:36,568 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:36,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:36,568 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:43:36,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:36,577 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:43:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:36,710 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 1806 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:36,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:38,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3528 backedges. 1806 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:38,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:38,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 48 [2018-12-03 17:43:38,121 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:38,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-03 17:43:38,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-03 17:43:38,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1086, Invalid=1266, Unknown=0, NotChecked=0, Total=2352 [2018-12-03 17:43:38,122 INFO L87 Difference]: Start difference. First operand 173 states and 174 transitions. Second operand 48 states. [2018-12-03 17:43:39,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:39,429 INFO L93 Difference]: Finished difference Result 180 states and 182 transitions. [2018-12-03 17:43:39,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-03 17:43:39,429 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 172 [2018-12-03 17:43:39,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:39,431 INFO L225 Difference]: With dead ends: 180 [2018-12-03 17:43:39,431 INFO L226 Difference]: Without dead ends: 178 [2018-12-03 17:43:39,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 472 GetRequests, 300 SyntacticMatches, 82 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3824 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3151, Invalid=5221, Unknown=0, NotChecked=0, Total=8372 [2018-12-03 17:43:39,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-12-03 17:43:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-12-03 17:43:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-12-03 17:43:39,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-12-03 17:43:39,462 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 172 [2018-12-03 17:43:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:39,463 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-12-03 17:43:39,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-03 17:43:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-12-03 17:43:39,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-12-03 17:43:39,463 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:39,464 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 42, 1, 1, 1, 1] [2018-12-03 17:43:39,464 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:39,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:39,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1196544287, now seen corresponding path program 62 times [2018-12-03 17:43:39,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:39,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:39,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:43:39,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:39,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:41,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1892 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:41,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:41,793 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:41,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:41,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:43:41,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:41,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:43:41,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:43:41,804 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:43:42,036 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2018-12-03 17:43:42,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:42,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:45,289 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1892 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:45,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3698 backedges. 1892 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:47,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:47,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 132 [2018-12-03 17:43:47,557 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:47,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-12-03 17:43:47,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-12-03 17:43:47,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4047, Invalid=13509, Unknown=0, NotChecked=0, Total=17556 [2018-12-03 17:43:47,559 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 131 states. [2018-12-03 17:43:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:49,422 INFO L93 Difference]: Finished difference Result 269 states and 271 transitions. [2018-12-03 17:43:49,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-03 17:43:49,423 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 176 [2018-12-03 17:43:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:49,423 INFO L225 Difference]: With dead ends: 269 [2018-12-03 17:43:49,423 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 17:43:49,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 479 GetRequests, 222 SyntacticMatches, 84 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11050 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=7785, Invalid=22665, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 17:43:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 17:43:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-12-03 17:43:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-12-03 17:43:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-12-03 17:43:49,448 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 176 [2018-12-03 17:43:49,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:49,448 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-12-03 17:43:49,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-12-03 17:43:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-12-03 17:43:49,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-12-03 17:43:49,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:49,450 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 43, 43, 1, 1, 1, 1] [2018-12-03 17:43:49,450 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:49,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash -889547749, now seen corresponding path program 63 times [2018-12-03 17:43:49,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:49,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:49,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:49,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:49,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:43:51,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1892 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:51,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:51,799 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:43:51,799 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:43:51,799 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:43:51,799 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:43:51,799 INFO 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 17:43:51,809 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:43:51,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:43:51,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:43:51,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:43:51,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:43:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1892 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:55,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:43:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 3784 backedges. 1892 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:43:57,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:43:57,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 131 [2018-12-03 17:43:57,422 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:43:57,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-03 17:43:57,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-03 17:43:57,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3959, Invalid=13333, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:43:57,423 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 132 states. [2018-12-03 17:43:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:43:59,195 INFO L93 Difference]: Finished difference Result 271 states and 273 transitions. [2018-12-03 17:43:59,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-03 17:43:59,195 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 178 [2018-12-03 17:43:59,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:43:59,196 INFO L225 Difference]: With dead ends: 271 [2018-12-03 17:43:59,196 INFO L226 Difference]: Without dead ends: 181 [2018-12-03 17:43:59,197 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 225 SyntacticMatches, 87 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10967 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=7786, Invalid=22664, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 17:43:59,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-12-03 17:43:59,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-12-03 17:43:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-03 17:43:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-12-03 17:43:59,220 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 178 [2018-12-03 17:43:59,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:43:59,220 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-12-03 17:43:59,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-03 17:43:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-12-03 17:43:59,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-03 17:43:59,221 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:43:59,221 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 43, 1, 1, 1, 1] [2018-12-03 17:43:59,222 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:43:59,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:43:59,222 INFO L82 PathProgramCache]: Analyzing trace with hash 125732887, now seen corresponding path program 64 times [2018-12-03 17:43:59,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:43:59,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:59,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:43:59,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:43:59,223 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:43:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:44:00,498 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 1980 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:00,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:00,498 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:44:00,498 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:44:00,498 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:44:00,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:00,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 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 17:44:00,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:44:00,507 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:44:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:44:00,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:44:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 1980 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:00,718 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:44:02,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3872 backedges. 1980 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:02,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:44:02,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 50 [2018-12-03 17:44:02,171 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:44:02,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-03 17:44:02,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-03 17:44:02,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1181, Invalid=1369, Unknown=0, NotChecked=0, Total=2550 [2018-12-03 17:44:02,172 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 50 states. [2018-12-03 17:44:03,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:44:03,350 INFO L93 Difference]: Finished difference Result 188 states and 190 transitions. [2018-12-03 17:44:03,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-03 17:44:03,350 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 180 [2018-12-03 17:44:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:44:03,351 INFO L225 Difference]: With dead ends: 188 [2018-12-03 17:44:03,351 INFO L226 Difference]: Without dead ends: 186 [2018-12-03 17:44:03,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 314 SyntacticMatches, 86 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4182 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3432, Invalid=5688, Unknown=0, NotChecked=0, Total=9120 [2018-12-03 17:44:03,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-03 17:44:03,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-12-03 17:44:03,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-12-03 17:44:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-12-03 17:44:03,376 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 180 [2018-12-03 17:44:03,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:44:03,377 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-12-03 17:44:03,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-03 17:44:03,377 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-12-03 17:44:03,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-12-03 17:44:03,378 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:44:03,378 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 44, 1, 1, 1, 1] [2018-12-03 17:44:03,378 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:44:03,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:44:03,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1723922677, now seen corresponding path program 65 times [2018-12-03 17:44:03,378 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:44:03,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:03,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:44:03,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:03,379 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:44:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:44:06,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 2070 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:06,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:06,404 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:44:06,404 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:44:06,404 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:44:06,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:06,404 INFO 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 17:44:06,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:44:06,415 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:44:06,643 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-12-03 17:44:06,644 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:44:06,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:44:09,932 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 2070 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:09,932 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:44:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4050 backedges. 2070 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:12,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:44:12,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 138 [2018-12-03 17:44:12,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:44:12,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-12-03 17:44:12,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-12-03 17:44:12,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4415, Invalid=14767, Unknown=0, NotChecked=0, Total=19182 [2018-12-03 17:44:12,441 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 137 states. [2018-12-03 17:44:14,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:44:14,173 INFO L93 Difference]: Finished difference Result 281 states and 283 transitions. [2018-12-03 17:44:14,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-03 17:44:14,174 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 184 [2018-12-03 17:44:14,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:44:14,174 INFO L225 Difference]: With dead ends: 281 [2018-12-03 17:44:14,175 INFO L226 Difference]: Without dead ends: 187 [2018-12-03 17:44:14,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 232 SyntacticMatches, 88 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12104 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=8507, Invalid=24799, Unknown=0, NotChecked=0, Total=33306 [2018-12-03 17:44:14,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-12-03 17:44:14,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-12-03 17:44:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-03 17:44:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-12-03 17:44:14,203 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 184 [2018-12-03 17:44:14,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:44:14,203 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-12-03 17:44:14,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-12-03 17:44:14,204 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-12-03 17:44:14,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-03 17:44:14,204 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:44:14,205 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 45, 1, 1, 1, 1] [2018-12-03 17:44:14,205 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:44:14,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:44:14,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1000141305, now seen corresponding path program 66 times [2018-12-03 17:44:14,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:44:14,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:14,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:44:14,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:14,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:44:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:44:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 2070 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:17,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:17,170 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:44:17,170 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:44:17,170 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:44:17,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:17,170 INFO 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 17:44:17,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:44:17,178 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:44:17,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:44:17,319 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:44:17,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:44:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 2070 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:20,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:44:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4140 backedges. 2070 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:23,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:44:23,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 137 [2018-12-03 17:44:23,141 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:44:23,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-03 17:44:23,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-03 17:44:23,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4323, Invalid=14583, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:44:23,143 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 138 states. [2018-12-03 17:44:25,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:44:25,245 INFO L93 Difference]: Finished difference Result 283 states and 285 transitions. [2018-12-03 17:44:25,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-03 17:44:25,246 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 186 [2018-12-03 17:44:25,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:44:25,246 INFO L225 Difference]: With dead ends: 283 [2018-12-03 17:44:25,246 INFO L226 Difference]: Without dead ends: 189 [2018-12-03 17:44:25,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 507 GetRequests, 235 SyntacticMatches, 91 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12017 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=8508, Invalid=24798, Unknown=0, NotChecked=0, Total=33306 [2018-12-03 17:44:25,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-12-03 17:44:25,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-12-03 17:44:25,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-03 17:44:25,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-12-03 17:44:25,281 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 186 [2018-12-03 17:44:25,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:44:25,281 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-12-03 17:44:25,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-03 17:44:25,281 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-12-03 17:44:25,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-12-03 17:44:25,282 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:44:25,282 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 45, 1, 1, 1, 1] [2018-12-03 17:44:25,283 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:44:25,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:44:25,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1230944765, now seen corresponding path program 67 times [2018-12-03 17:44:25,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:44:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:25,284 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:44:25,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:25,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:44:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:44:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 2162 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:26,347 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:26,348 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:44:26,348 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:44:26,348 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:44:26,348 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:26,348 INFO 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 17:44:26,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:44:26,357 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:44:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:44:26,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:44:26,608 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 2162 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:26,609 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:44:28,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4232 backedges. 2162 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:28,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:44:28,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 52 [2018-12-03 17:44:28,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:44:28,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-03 17:44:28,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-03 17:44:28,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1280, Invalid=1476, Unknown=0, NotChecked=0, Total=2756 [2018-12-03 17:44:28,173 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 52 states. [2018-12-03 17:44:29,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:44:29,369 INFO L93 Difference]: Finished difference Result 196 states and 198 transitions. [2018-12-03 17:44:29,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-03 17:44:29,369 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 188 [2018-12-03 17:44:29,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:44:29,370 INFO L225 Difference]: With dead ends: 196 [2018-12-03 17:44:29,370 INFO L226 Difference]: Without dead ends: 194 [2018-12-03 17:44:29,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 328 SyntacticMatches, 90 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3725, Invalid=6175, Unknown=0, NotChecked=0, Total=9900 [2018-12-03 17:44:29,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-03 17:44:29,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-12-03 17:44:29,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-03 17:44:29,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 194 transitions. [2018-12-03 17:44:29,398 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 194 transitions. Word has length 188 [2018-12-03 17:44:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:44:29,398 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 194 transitions. [2018-12-03 17:44:29,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-03 17:44:29,398 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 194 transitions. [2018-12-03 17:44:29,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-03 17:44:29,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:44:29,399 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 46, 1, 1, 1, 1] [2018-12-03 17:44:29,399 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:44:29,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:44:29,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1538846455, now seen corresponding path program 68 times [2018-12-03 17:44:29,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:44:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:29,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:44:29,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:29,400 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:44:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:44:32,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2256 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:32,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:32,415 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:44:32,415 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:44:32,415 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:44:32,415 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:32,415 INFO 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 17:44:32,424 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:44:32,424 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:44:32,676 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-03 17:44:32,676 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:44:32,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:44:36,348 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2256 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:36,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:44:39,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4418 backedges. 2256 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:39,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:44:39,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 144 [2018-12-03 17:44:39,059 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:44:39,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-12-03 17:44:39,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-12-03 17:44:39,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4799, Invalid=16081, Unknown=0, NotChecked=0, Total=20880 [2018-12-03 17:44:39,061 INFO L87 Difference]: Start difference. First operand 193 states and 194 transitions. Second operand 143 states. [2018-12-03 17:44:41,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:44:41,297 INFO L93 Difference]: Finished difference Result 293 states and 295 transitions. [2018-12-03 17:44:41,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-03 17:44:41,297 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 192 [2018-12-03 17:44:41,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:44:41,298 INFO L225 Difference]: With dead ends: 293 [2018-12-03 17:44:41,298 INFO L226 Difference]: Without dead ends: 195 [2018-12-03 17:44:41,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 242 SyntacticMatches, 92 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13206 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=9261, Invalid=27029, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 17:44:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-12-03 17:44:41,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-12-03 17:44:41,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-12-03 17:44:41,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-12-03 17:44:41,327 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 192 [2018-12-03 17:44:41,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:44:41,327 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-12-03 17:44:41,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-12-03 17:44:41,327 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-12-03 17:44:41,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-12-03 17:44:41,328 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:44:41,328 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 47, 47, 1, 1, 1, 1] [2018-12-03 17:44:41,328 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:44:41,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:44:41,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1328268813, now seen corresponding path program 69 times [2018-12-03 17:44:41,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:44:41,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:41,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:44:41,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:41,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:44:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:44:44,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2256 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:44,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:44,120 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:44:44,120 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:44:44,120 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:44:44,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:44,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 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 17:44:44,128 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:44:44,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:44:44,277 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:44:44,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:44:44,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:44:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2256 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:47,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:44:50,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4512 backedges. 2256 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:50,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:44:50,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 143 [2018-12-03 17:44:50,745 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:44:50,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-03 17:44:50,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-03 17:44:50,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4703, Invalid=15889, Unknown=0, NotChecked=0, Total=20592 [2018-12-03 17:44:50,747 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 144 states. [2018-12-03 17:44:52,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:44:52,859 INFO L93 Difference]: Finished difference Result 295 states and 297 transitions. [2018-12-03 17:44:52,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-03 17:44:52,860 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 194 [2018-12-03 17:44:52,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:44:52,861 INFO L225 Difference]: With dead ends: 295 [2018-12-03 17:44:52,861 INFO L226 Difference]: Without dead ends: 197 [2018-12-03 17:44:52,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 529 GetRequests, 245 SyntacticMatches, 95 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13115 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=9262, Invalid=27028, Unknown=0, NotChecked=0, Total=36290 [2018-12-03 17:44:52,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-03 17:44:52,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-12-03 17:44:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-12-03 17:44:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-12-03 17:44:52,889 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 194 [2018-12-03 17:44:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:44:52,889 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-12-03 17:44:52,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-03 17:44:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-12-03 17:44:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-12-03 17:44:52,890 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:44:52,890 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 47, 1, 1, 1, 1] [2018-12-03 17:44:52,891 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:44:52,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:44:52,891 INFO L82 PathProgramCache]: Analyzing trace with hash 742962671, now seen corresponding path program 70 times [2018-12-03 17:44:52,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:44:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:52,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:44:52,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:52,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:44:52,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:44:54,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2352 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:54,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:54,030 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:44:54,030 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:44:54,030 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:44:54,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:44:54,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:44:54,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:44:54,039 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:44:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:44:54,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:44:54,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2352 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:54,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:44:56,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4608 backedges. 2352 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:44:56,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:44:56,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 54 [2018-12-03 17:44:56,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:44:56,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-03 17:44:56,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-03 17:44:56,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1383, Invalid=1587, Unknown=0, NotChecked=0, Total=2970 [2018-12-03 17:44:56,304 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 54 states. [2018-12-03 17:44:57,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:44:57,606 INFO L93 Difference]: Finished difference Result 204 states and 206 transitions. [2018-12-03 17:44:57,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-12-03 17:44:57,607 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 196 [2018-12-03 17:44:57,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:44:57,608 INFO L225 Difference]: With dead ends: 204 [2018-12-03 17:44:57,608 INFO L226 Difference]: Without dead ends: 202 [2018-12-03 17:44:57,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 342 SyntacticMatches, 94 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4946 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4030, Invalid=6682, Unknown=0, NotChecked=0, Total=10712 [2018-12-03 17:44:57,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-03 17:44:57,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-12-03 17:44:57,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-12-03 17:44:57,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-12-03 17:44:57,642 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 196 [2018-12-03 17:44:57,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:44:57,642 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-12-03 17:44:57,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-03 17:44:57,643 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-12-03 17:44:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-12-03 17:44:57,643 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:44:57,643 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 48, 1, 1, 1, 1] [2018-12-03 17:44:57,644 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:44:57,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:44:57,644 INFO L82 PathProgramCache]: Analyzing trace with hash -821131037, now seen corresponding path program 71 times [2018-12-03 17:44:57,644 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:44:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:57,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:44:57,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:44:57,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:44:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:45:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2450 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:00,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:00,604 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:45:00,604 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:45:00,604 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:45:00,604 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:00,604 INFO 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 17:45:00,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:45:00,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:45:00,872 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2018-12-03 17:45:00,873 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:45:00,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:45:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2450 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:04,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:45:08,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4802 backedges. 2450 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:08,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:45:08,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 150 [2018-12-03 17:45:08,152 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:45:08,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-12-03 17:45:08,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-12-03 17:45:08,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5199, Invalid=17451, Unknown=0, NotChecked=0, Total=22650 [2018-12-03 17:45:08,153 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 149 states. [2018-12-03 17:45:10,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:45:10,259 INFO L93 Difference]: Finished difference Result 305 states and 307 transitions. [2018-12-03 17:45:10,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-03 17:45:10,259 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 200 [2018-12-03 17:45:10,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:45:10,260 INFO L225 Difference]: With dead ends: 305 [2018-12-03 17:45:10,260 INFO L226 Difference]: Without dead ends: 203 [2018-12-03 17:45:10,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 545 GetRequests, 252 SyntacticMatches, 96 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14356 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=10047, Invalid=29355, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 17:45:10,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-03 17:45:10,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-12-03 17:45:10,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-12-03 17:45:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-12-03 17:45:10,295 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 200 [2018-12-03 17:45:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:45:10,295 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-12-03 17:45:10,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-12-03 17:45:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-12-03 17:45:10,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-12-03 17:45:10,296 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:45:10,297 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 49, 49, 1, 1, 1, 1] [2018-12-03 17:45:10,297 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:45:10,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:45:10,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1801644065, now seen corresponding path program 72 times [2018-12-03 17:45:10,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:45:10,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:10,298 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:45:10,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:10,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:45:10,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:45:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2450 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:13,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:13,679 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:45:13,679 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:45:13,679 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:45:13,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:13,680 INFO 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 17:45:13,688 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:45:13,688 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:45:13,846 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:45:13,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:45:13,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:45:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2450 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:17,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:45:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 2450 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:20,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:45:20,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 149 [2018-12-03 17:45:20,648 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:45:20,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-03 17:45:20,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-03 17:45:20,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5099, Invalid=17251, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:45:20,650 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 150 states. [2018-12-03 17:45:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:45:22,926 INFO L93 Difference]: Finished difference Result 307 states and 309 transitions. [2018-12-03 17:45:22,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-03 17:45:22,926 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 202 [2018-12-03 17:45:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:45:22,927 INFO L225 Difference]: With dead ends: 307 [2018-12-03 17:45:22,927 INFO L226 Difference]: Without dead ends: 205 [2018-12-03 17:45:22,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 255 SyntacticMatches, 99 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14261 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=10048, Invalid=29354, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 17:45:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-12-03 17:45:22,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-12-03 17:45:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-03 17:45:22,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-12-03 17:45:22,958 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 202 [2018-12-03 17:45:22,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:45:22,958 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-12-03 17:45:22,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-03 17:45:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-12-03 17:45:22,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-03 17:45:22,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:45:22,959 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 49, 1, 1, 1, 1] [2018-12-03 17:45:22,959 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:45:22,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:45:22,960 INFO L82 PathProgramCache]: Analyzing trace with hash 818141147, now seen corresponding path program 73 times [2018-12-03 17:45:22,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:45:22,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:22,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:45:22,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:22,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:45:23,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:45:24,217 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 2550 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:24,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:24,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:45:24,217 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:45:24,217 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:45:24,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:24,217 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 17:45:24,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:45:24,226 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:45:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:45:24,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:45:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 2550 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:24,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:45:26,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5000 backedges. 2550 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:26,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:45:26,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 53, 53] total 56 [2018-12-03 17:45:26,263 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:45:26,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-03 17:45:26,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-03 17:45:26,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1490, Invalid=1702, Unknown=0, NotChecked=0, Total=3192 [2018-12-03 17:45:26,263 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 56 states. [2018-12-03 17:45:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:45:27,853 INFO L93 Difference]: Finished difference Result 212 states and 214 transitions. [2018-12-03 17:45:27,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-12-03 17:45:27,853 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 204 [2018-12-03 17:45:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:45:27,854 INFO L225 Difference]: With dead ends: 212 [2018-12-03 17:45:27,854 INFO L226 Difference]: Without dead ends: 210 [2018-12-03 17:45:27,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 560 GetRequests, 356 SyntacticMatches, 98 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5352 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4347, Invalid=7209, Unknown=0, NotChecked=0, Total=11556 [2018-12-03 17:45:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-12-03 17:45:27,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-12-03 17:45:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-12-03 17:45:27,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-12-03 17:45:27,884 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 204 [2018-12-03 17:45:27,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:45:27,884 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-12-03 17:45:27,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-03 17:45:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-12-03 17:45:27,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-12-03 17:45:27,885 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:45:27,885 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 50, 1, 1, 1, 1] [2018-12-03 17:45:27,885 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:45:27,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:45:27,885 INFO L82 PathProgramCache]: Analyzing trace with hash -66136881, now seen corresponding path program 74 times [2018-12-03 17:45:27,885 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:45:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:27,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:45:27,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:27,886 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:45:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:45:31,081 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 2652 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:31,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:31,082 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:45:31,082 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:45:31,082 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:45:31,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:31,082 INFO 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 17:45:31,090 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:45:31,091 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:45:31,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-12-03 17:45:31,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:45:31,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:45:35,559 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 2652 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:35,559 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:45:38,845 INFO L134 CoverageAnalysis]: Checked inductivity of 5202 backedges. 2652 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:38,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:45:38,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 156 [2018-12-03 17:45:38,865 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:45:38,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-12-03 17:45:38,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-12-03 17:45:38,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5615, Invalid=18877, Unknown=0, NotChecked=0, Total=24492 [2018-12-03 17:45:38,867 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 155 states. [2018-12-03 17:45:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:45:41,211 INFO L93 Difference]: Finished difference Result 317 states and 319 transitions. [2018-12-03 17:45:41,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-03 17:45:41,212 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 208 [2018-12-03 17:45:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:45:41,213 INFO L225 Difference]: With dead ends: 317 [2018-12-03 17:45:41,213 INFO L226 Difference]: Without dead ends: 211 [2018-12-03 17:45:41,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 567 GetRequests, 262 SyntacticMatches, 100 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15554 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=10865, Invalid=31777, Unknown=0, NotChecked=0, Total=42642 [2018-12-03 17:45:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-03 17:45:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-03 17:45:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-03 17:45:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 212 transitions. [2018-12-03 17:45:41,245 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 212 transitions. Word has length 208 [2018-12-03 17:45:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:45:41,245 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 212 transitions. [2018-12-03 17:45:41,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-12-03 17:45:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 212 transitions. [2018-12-03 17:45:41,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-03 17:45:41,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:45:41,246 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 51, 51, 1, 1, 1, 1] [2018-12-03 17:45:41,246 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:45:41,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:45:41,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1015850955, now seen corresponding path program 75 times [2018-12-03 17:45:41,247 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:45:41,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:41,247 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:45:41,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:41,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:45:41,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:45:44,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2652 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:44,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:44,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:45:44,487 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:45:44,487 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:45:44,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:44,487 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:45:44,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:45:44,496 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:45:44,657 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:45:44,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:45:44,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:45:48,676 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2652 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:48,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:45:51,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5304 backedges. 2652 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:51,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:45:51,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 155 [2018-12-03 17:45:51,776 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:45:51,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-03 17:45:51,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-03 17:45:51,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5511, Invalid=18669, Unknown=0, NotChecked=0, Total=24180 [2018-12-03 17:45:51,778 INFO L87 Difference]: Start difference. First operand 211 states and 212 transitions. Second operand 156 states. [2018-12-03 17:45:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:45:54,281 INFO L93 Difference]: Finished difference Result 319 states and 321 transitions. [2018-12-03 17:45:54,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-12-03 17:45:54,281 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 210 [2018-12-03 17:45:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:45:54,282 INFO L225 Difference]: With dead ends: 319 [2018-12-03 17:45:54,282 INFO L226 Difference]: Without dead ends: 213 [2018-12-03 17:45:54,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 573 GetRequests, 265 SyntacticMatches, 103 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15455 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=10866, Invalid=31776, Unknown=0, NotChecked=0, Total=42642 [2018-12-03 17:45:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-12-03 17:45:54,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-12-03 17:45:54,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-12-03 17:45:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-12-03 17:45:54,316 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 210 [2018-12-03 17:45:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:45:54,316 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-12-03 17:45:54,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-03 17:45:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-12-03 17:45:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-12-03 17:45:54,317 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:45:54,317 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 51, 1, 1, 1, 1] [2018-12-03 17:45:54,318 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:45:54,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:45:54,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1424075719, now seen corresponding path program 76 times [2018-12-03 17:45:54,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:45:54,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:54,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:45:54,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:54,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:45:54,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:45:55,588 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2756 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:55,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:55,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:45:55,588 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:45:55,588 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:45:55,588 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:45:55,588 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:45:55,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:45:55,597 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:45:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:45:55,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:45:55,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2756 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:55,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:45:57,830 INFO L134 CoverageAnalysis]: Checked inductivity of 5408 backedges. 2756 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:45:57,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:45:57,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 58 [2018-12-03 17:45:57,849 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:45:57,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-03 17:45:57,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-03 17:45:57,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1601, Invalid=1821, Unknown=0, NotChecked=0, Total=3422 [2018-12-03 17:45:57,850 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 58 states. [2018-12-03 17:45:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:45:59,314 INFO L93 Difference]: Finished difference Result 220 states and 222 transitions. [2018-12-03 17:45:59,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-12-03 17:45:59,315 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 212 [2018-12-03 17:45:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:45:59,315 INFO L225 Difference]: With dead ends: 220 [2018-12-03 17:45:59,316 INFO L226 Difference]: Without dead ends: 218 [2018-12-03 17:45:59,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 370 SyntacticMatches, 102 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5774 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4676, Invalid=7756, Unknown=0, NotChecked=0, Total=12432 [2018-12-03 17:45:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-03 17:45:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-12-03 17:45:59,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-03 17:45:59,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 218 transitions. [2018-12-03 17:45:59,382 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 218 transitions. Word has length 212 [2018-12-03 17:45:59,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:45:59,382 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 218 transitions. [2018-12-03 17:45:59,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-03 17:45:59,383 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 218 transitions. [2018-12-03 17:45:59,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-03 17:45:59,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:45:59,384 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 52, 1, 1, 1, 1] [2018-12-03 17:45:59,384 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:45:59,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:45:59,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1946735291, now seen corresponding path program 77 times [2018-12-03 17:45:59,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:45:59,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:59,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:45:59,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:45:59,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:45:59,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:46:02,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2862 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:02,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:02,939 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:46:02,939 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:46:02,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:46:02,939 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:02,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 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:46:02,947 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:46:02,947 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:46:03,252 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-03 17:46:03,252 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:46:03,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:46:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2862 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:07,536 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:46:11,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5618 backedges. 2862 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:11,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:46:11,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 162 [2018-12-03 17:46:11,052 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:46:11,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-12-03 17:46:11,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-12-03 17:46:11,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6047, Invalid=20359, Unknown=0, NotChecked=0, Total=26406 [2018-12-03 17:46:11,054 INFO L87 Difference]: Start difference. First operand 217 states and 218 transitions. Second operand 161 states. [2018-12-03 17:46:13,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:46:13,813 INFO L93 Difference]: Finished difference Result 329 states and 331 transitions. [2018-12-03 17:46:13,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-12-03 17:46:13,814 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 216 [2018-12-03 17:46:13,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:46:13,815 INFO L225 Difference]: With dead ends: 329 [2018-12-03 17:46:13,815 INFO L226 Difference]: Without dead ends: 219 [2018-12-03 17:46:13,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 272 SyntacticMatches, 104 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16800 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=11715, Invalid=34295, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 17:46:13,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-12-03 17:46:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-12-03 17:46:13,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-12-03 17:46:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-12-03 17:46:13,859 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 216 [2018-12-03 17:46:13,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:46:13,860 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-12-03 17:46:13,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-12-03 17:46:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-12-03 17:46:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-03 17:46:13,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:46:13,861 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 53, 53, 1, 1, 1, 1] [2018-12-03 17:46:13,861 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:46:13,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:46:13,861 INFO L82 PathProgramCache]: Analyzing trace with hash -34477641, now seen corresponding path program 78 times [2018-12-03 17:46:13,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:46:13,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:13,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:46:13,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:13,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:46:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:46:17,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2862 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:17,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:17,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:46:17,363 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:46:17,363 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:46:17,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:17,363 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:46:17,371 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:46:17,371 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:46:17,537 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:46:17,537 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:46:17,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:46:21,836 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2862 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:21,836 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:46:25,503 INFO L134 CoverageAnalysis]: Checked inductivity of 5724 backedges. 2862 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:25,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:46:25,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 161 [2018-12-03 17:46:25,524 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:46:25,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-03 17:46:25,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-03 17:46:25,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5939, Invalid=20143, Unknown=0, NotChecked=0, Total=26082 [2018-12-03 17:46:25,526 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 162 states. [2018-12-03 17:46:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:46:28,366 INFO L93 Difference]: Finished difference Result 331 states and 333 transitions. [2018-12-03 17:46:28,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-12-03 17:46:28,367 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 218 [2018-12-03 17:46:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:46:28,368 INFO L225 Difference]: With dead ends: 331 [2018-12-03 17:46:28,368 INFO L226 Difference]: Without dead ends: 221 [2018-12-03 17:46:28,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 595 GetRequests, 275 SyntacticMatches, 107 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16697 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=11716, Invalid=34294, Unknown=0, NotChecked=0, Total=46010 [2018-12-03 17:46:28,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-03 17:46:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-12-03 17:46:28,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-12-03 17:46:28,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 222 transitions. [2018-12-03 17:46:28,404 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 222 transitions. Word has length 218 [2018-12-03 17:46:28,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:46:28,404 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 222 transitions. [2018-12-03 17:46:28,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-03 17:46:28,404 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 222 transitions. [2018-12-03 17:46:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-12-03 17:46:28,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:46:28,405 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 53, 1, 1, 1, 1] [2018-12-03 17:46:28,405 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:46:28,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:46:28,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1309593165, now seen corresponding path program 79 times [2018-12-03 17:46:28,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:46:28,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:28,406 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:46:28,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:28,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:46:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:46:29,829 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2970 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:29,829 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:29,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:46:29,830 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:46:29,830 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:46:29,830 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:29,830 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:46:29,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:46:29,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:46:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:46:30,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:46:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2970 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:30,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:46:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 5832 backedges. 2970 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:32,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:46:32,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 60 [2018-12-03 17:46:32,192 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:46:32,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-03 17:46:32,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-03 17:46:32,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1716, Invalid=1944, Unknown=0, NotChecked=0, Total=3660 [2018-12-03 17:46:32,193 INFO L87 Difference]: Start difference. First operand 221 states and 222 transitions. Second operand 60 states. [2018-12-03 17:46:33,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:46:33,992 INFO L93 Difference]: Finished difference Result 228 states and 230 transitions. [2018-12-03 17:46:33,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-12-03 17:46:33,992 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 220 [2018-12-03 17:46:33,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:46:33,993 INFO L225 Difference]: With dead ends: 228 [2018-12-03 17:46:33,993 INFO L226 Difference]: Without dead ends: 226 [2018-12-03 17:46:33,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 384 SyntacticMatches, 106 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6212 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5017, Invalid=8323, Unknown=0, NotChecked=0, Total=13340 [2018-12-03 17:46:33,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-12-03 17:46:34,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-12-03 17:46:34,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-12-03 17:46:34,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-12-03 17:46:34,030 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 220 [2018-12-03 17:46:34,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:46:34,030 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-12-03 17:46:34,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-03 17:46:34,030 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-12-03 17:46:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-12-03 17:46:34,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:46:34,031 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 54, 1, 1, 1, 1] [2018-12-03 17:46:34,031 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:46:34,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:46:34,032 INFO L82 PathProgramCache]: Analyzing trace with hash 281772711, now seen corresponding path program 80 times [2018-12-03 17:46:34,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:46:34,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:34,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:46:34,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:34,033 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:46:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:46:38,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 3080 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:38,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:38,523 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:46:38,524 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:46:38,524 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:46:38,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:38,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:46:38,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:46:38,532 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:46:38,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2018-12-03 17:46:38,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:46:38,850 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:46:43,358 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 3080 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:43,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:46:47,031 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 3080 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:47,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:46:47,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 168 [2018-12-03 17:46:47,053 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:46:47,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-12-03 17:46:47,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-12-03 17:46:47,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6495, Invalid=21897, Unknown=0, NotChecked=0, Total=28392 [2018-12-03 17:46:47,055 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 167 states. [2018-12-03 17:46:49,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:46:49,904 INFO L93 Difference]: Finished difference Result 341 states and 343 transitions. [2018-12-03 17:46:49,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-12-03 17:46:49,904 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 224 [2018-12-03 17:46:49,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:46:49,905 INFO L225 Difference]: With dead ends: 341 [2018-12-03 17:46:49,905 INFO L226 Difference]: Without dead ends: 227 [2018-12-03 17:46:49,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 282 SyntacticMatches, 108 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18094 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=12597, Invalid=36909, Unknown=0, NotChecked=0, Total=49506 [2018-12-03 17:46:49,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-03 17:46:49,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-12-03 17:46:49,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-12-03 17:46:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 228 transitions. [2018-12-03 17:46:49,957 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 228 transitions. Word has length 224 [2018-12-03 17:46:49,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:46:49,957 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 228 transitions. [2018-12-03 17:46:49,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-12-03 17:46:49,957 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 228 transitions. [2018-12-03 17:46:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-12-03 17:46:49,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:46:49,958 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 55, 55, 1, 1, 1, 1] [2018-12-03 17:46:49,958 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:46:49,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:46:49,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1989926307, now seen corresponding path program 81 times [2018-12-03 17:46:49,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:46:49,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:49,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:46:49,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:46:49,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:46:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:46:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3080 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:54,008 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:54,008 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:46:54,008 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:46:54,008 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:46:54,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:46:54,009 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:46:54,017 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:46:54,018 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:46:54,187 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:46:54,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:46:54,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:46:58,905 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3080 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:46:58,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:47:02,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6160 backedges. 3080 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:02,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:47:02,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 167 [2018-12-03 17:47:02,552 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:47:02,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-12-03 17:47:02,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-12-03 17:47:02,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6383, Invalid=21673, Unknown=0, NotChecked=0, Total=28056 [2018-12-03 17:47:02,553 INFO L87 Difference]: Start difference. First operand 227 states and 228 transitions. Second operand 168 states. [2018-12-03 17:47:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:47:05,469 INFO L93 Difference]: Finished difference Result 343 states and 345 transitions. [2018-12-03 17:47:05,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-12-03 17:47:05,469 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 226 [2018-12-03 17:47:05,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:47:05,470 INFO L225 Difference]: With dead ends: 343 [2018-12-03 17:47:05,470 INFO L226 Difference]: Without dead ends: 229 [2018-12-03 17:47:05,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 617 GetRequests, 285 SyntacticMatches, 111 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17987 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=12598, Invalid=36908, Unknown=0, NotChecked=0, Total=49506 [2018-12-03 17:47:05,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-12-03 17:47:05,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-12-03 17:47:05,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-03 17:47:05,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 230 transitions. [2018-12-03 17:47:05,508 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 230 transitions. Word has length 226 [2018-12-03 17:47:05,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:47:05,508 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 230 transitions. [2018-12-03 17:47:05,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-12-03 17:47:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 230 transitions. [2018-12-03 17:47:05,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-03 17:47:05,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:47:05,510 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 55, 1, 1, 1, 1] [2018-12-03 17:47:05,510 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:47:05,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:47:05,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1446942305, now seen corresponding path program 82 times [2018-12-03 17:47:05,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:47:05,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:47:05,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:47:05,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:47:05,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:47:05,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:47:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 3192 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:07,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:47:07,014 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:47:07,014 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:47:07,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 17:47:07,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:47:07,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 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:47:07,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:47:07,025 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:47:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:47:07,199 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:47:07,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 3192 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:07,274 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:47:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 6272 backedges. 3192 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:09,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:47:09,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 59, 59] total 62 [2018-12-03 17:47:09,575 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:47:09,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-03 17:47:09,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-03 17:47:09,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1835, Invalid=2071, Unknown=0, NotChecked=0, Total=3906 [2018-12-03 17:47:09,576 INFO L87 Difference]: Start difference. First operand 229 states and 230 transitions. Second operand 62 states. [2018-12-03 17:47:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:47:11,238 INFO L93 Difference]: Finished difference Result 236 states and 238 transitions. [2018-12-03 17:47:11,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-12-03 17:47:11,239 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 228 [2018-12-03 17:47:11,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:47:11,240 INFO L225 Difference]: With dead ends: 236 [2018-12-03 17:47:11,240 INFO L226 Difference]: Without dead ends: 234 [2018-12-03 17:47:11,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 398 SyntacticMatches, 110 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6666 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5370, Invalid=8910, Unknown=0, NotChecked=0, Total=14280 [2018-12-03 17:47:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-03 17:47:11,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-12-03 17:47:11,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-03 17:47:11,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-12-03 17:47:11,280 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 228 [2018-12-03 17:47:11,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:47:11,280 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-12-03 17:47:11,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-03 17:47:11,280 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-12-03 17:47:11,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-12-03 17:47:11,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:47:11,281 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 56, 1, 1, 1, 1] [2018-12-03 17:47:11,281 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:47:11,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:47:11,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1264196461, now seen corresponding path program 83 times [2018-12-03 17:47:11,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:47:11,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:47:11,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:47:11,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:47:11,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:47:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:47:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 3306 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:15,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:47:15,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:47:15,355 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:47:15,355 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:47:15,355 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:47:15,355 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:47:15,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:47:15,364 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:47:15,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 58 check-sat command(s) [2018-12-03 17:47:15,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:47:15,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:47:20,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 3306 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:20,564 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:47:24,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6498 backedges. 3306 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:24,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:47:24,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115, 115, 115] total 174 [2018-12-03 17:47:24,502 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:47:24,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-12-03 17:47:24,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-12-03 17:47:24,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6959, Invalid=23491, Unknown=0, NotChecked=0, Total=30450 [2018-12-03 17:47:24,504 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 173 states. [2018-12-03 17:47:27,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:47:27,379 INFO L93 Difference]: Finished difference Result 353 states and 355 transitions. [2018-12-03 17:47:27,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-12-03 17:47:27,379 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 232 [2018-12-03 17:47:27,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:47:27,380 INFO L225 Difference]: With dead ends: 353 [2018-12-03 17:47:27,380 INFO L226 Difference]: Without dead ends: 235 [2018-12-03 17:47:27,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 633 GetRequests, 292 SyntacticMatches, 112 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19436 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=13511, Invalid=39619, Unknown=0, NotChecked=0, Total=53130 [2018-12-03 17:47:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-12-03 17:47:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-12-03 17:47:27,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-03 17:47:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-12-03 17:47:27,421 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 232 [2018-12-03 17:47:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:47:27,421 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-12-03 17:47:27,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-12-03 17:47:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-12-03 17:47:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-03 17:47:27,423 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:47:27,423 INFO L402 BasicCegarLoop]: trace histogram [58, 58, 57, 57, 1, 1, 1, 1] [2018-12-03 17:47:27,423 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:47:27,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:47:27,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1289323407, now seen corresponding path program 84 times [2018-12-03 17:47:27,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:47:27,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:47:27,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:47:27,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:47:27,424 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:47:27,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:47:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 3306 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:31,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:47:31,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:47:31,512 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:47:31,512 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:47:31,512 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:47:31,512 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:47:31,520 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:47:31,521 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:47:31,697 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:47:31,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:47:31,706 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:47:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 3306 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:36,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:47:40,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6612 backedges. 3306 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:40,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:47:40,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116, 116, 116] total 173 [2018-12-03 17:47:40,653 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:47:40,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-03 17:47:40,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-03 17:47:40,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6843, Invalid=23259, Unknown=0, NotChecked=0, Total=30102 [2018-12-03 17:47:40,655 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 174 states. [2018-12-03 17:47:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:47:43,646 INFO L93 Difference]: Finished difference Result 355 states and 357 transitions. [2018-12-03 17:47:43,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-12-03 17:47:43,646 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 234 [2018-12-03 17:47:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:47:43,647 INFO L225 Difference]: With dead ends: 355 [2018-12-03 17:47:43,647 INFO L226 Difference]: Without dead ends: 237 [2018-12-03 17:47:43,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 639 GetRequests, 295 SyntacticMatches, 115 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19325 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=13512, Invalid=39618, Unknown=0, NotChecked=0, Total=53130 [2018-12-03 17:47:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-12-03 17:47:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-12-03 17:47:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-12-03 17:47:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-12-03 17:47:43,687 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 234 [2018-12-03 17:47:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:47:43,687 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-12-03 17:47:43,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-03 17:47:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-12-03 17:47:43,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-12-03 17:47:43,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:47:43,689 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 57, 1, 1, 1, 1] [2018-12-03 17:47:43,689 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:47:43,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:47:43,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1499376757, now seen corresponding path program 85 times [2018-12-03 17:47:43,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:47:43,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:47:43,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:47:43,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:47:43,690 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:47:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:47:45,491 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 3422 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:45,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:47:45,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:47:45,492 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:47:45,492 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:47:45,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:47:45,492 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:47:45,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:47:45,503 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:47:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:47:45,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:47:45,791 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 3422 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:45,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:47:48,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6728 backedges. 3422 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:48,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:47:48,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 64 [2018-12-03 17:47:48,256 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:47:48,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-03 17:47:48,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-03 17:47:48,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1958, Invalid=2202, Unknown=0, NotChecked=0, Total=4160 [2018-12-03 17:47:48,257 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 64 states. [2018-12-03 17:47:50,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:47:50,111 INFO L93 Difference]: Finished difference Result 244 states and 246 transitions. [2018-12-03 17:47:50,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-12-03 17:47:50,111 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 236 [2018-12-03 17:47:50,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:47:50,112 INFO L225 Difference]: With dead ends: 244 [2018-12-03 17:47:50,112 INFO L226 Difference]: Without dead ends: 242 [2018-12-03 17:47:50,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 648 GetRequests, 412 SyntacticMatches, 114 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7136 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=5735, Invalid=9517, Unknown=0, NotChecked=0, Total=15252 [2018-12-03 17:47:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-03 17:47:50,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-12-03 17:47:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-03 17:47:50,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 242 transitions. [2018-12-03 17:47:50,151 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 242 transitions. Word has length 236 [2018-12-03 17:47:50,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:47:50,151 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 242 transitions. [2018-12-03 17:47:50,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-03 17:47:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 242 transitions. [2018-12-03 17:47:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-03 17:47:50,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:47:50,152 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 58, 1, 1, 1, 1] [2018-12-03 17:47:50,152 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:47:50,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:47:50,152 INFO L82 PathProgramCache]: Analyzing trace with hash 174520447, now seen corresponding path program 86 times [2018-12-03 17:47:50,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:47:50,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:47:50,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:47:50,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:47:50,153 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:47:50,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:47:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 3540 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:47:54,462 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:47:54,462 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:47:54,463 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:47:54,463 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:47:54,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:47:54,463 INFO 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:47:54,471 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:47:54,471 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:47:54,878 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-03 17:47:54,879 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:47:54,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:48:00,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 3540 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:00,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:48:04,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6962 backedges. 3540 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:04,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:48:04,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119, 119, 119] total 180 [2018-12-03 17:48:04,373 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:48:04,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-12-03 17:48:04,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-12-03 17:48:04,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7439, Invalid=25141, Unknown=0, NotChecked=0, Total=32580 [2018-12-03 17:48:04,375 INFO L87 Difference]: Start difference. First operand 241 states and 242 transitions. Second operand 179 states. [2018-12-03 17:48:07,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:48:07,417 INFO L93 Difference]: Finished difference Result 365 states and 367 transitions. [2018-12-03 17:48:07,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-12-03 17:48:07,418 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 240 [2018-12-03 17:48:07,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:48:07,419 INFO L225 Difference]: With dead ends: 365 [2018-12-03 17:48:07,419 INFO L226 Difference]: Without dead ends: 243 [2018-12-03 17:48:07,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 655 GetRequests, 302 SyntacticMatches, 116 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20826 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=14457, Invalid=42425, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 17:48:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-12-03 17:48:07,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-12-03 17:48:07,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-12-03 17:48:07,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-12-03 17:48:07,462 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 240 [2018-12-03 17:48:07,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:48:07,463 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-12-03 17:48:07,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-12-03 17:48:07,463 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-12-03 17:48:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-12-03 17:48:07,464 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:48:07,464 INFO L402 BasicCegarLoop]: trace histogram [60, 60, 59, 59, 1, 1, 1, 1] [2018-12-03 17:48:07,464 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:48:07,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:48:07,464 INFO L82 PathProgramCache]: Analyzing trace with hash -277226629, now seen corresponding path program 87 times [2018-12-03 17:48:07,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:48:07,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:48:07,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:48:07,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:48:07,465 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:48:07,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:48:11,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3540 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:11,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:48:11,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:48:11,867 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:48:11,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:48:11,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:48:11,867 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:48:11,876 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:48:11,876 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:48:12,060 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:48:12,060 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:48:12,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:48:17,326 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3540 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:17,327 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:48:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3540 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:21,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:48:21,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120, 120, 120] total 179 [2018-12-03 17:48:21,614 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:48:21,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-12-03 17:48:21,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-12-03 17:48:21,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7319, Invalid=24901, Unknown=0, NotChecked=0, Total=32220 [2018-12-03 17:48:21,616 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 180 states. [2018-12-03 17:48:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:48:24,757 INFO L93 Difference]: Finished difference Result 367 states and 369 transitions. [2018-12-03 17:48:24,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-12-03 17:48:24,757 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 242 [2018-12-03 17:48:24,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:48:24,758 INFO L225 Difference]: With dead ends: 367 [2018-12-03 17:48:24,758 INFO L226 Difference]: Without dead ends: 245 [2018-12-03 17:48:24,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 661 GetRequests, 305 SyntacticMatches, 119 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20711 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=14458, Invalid=42424, Unknown=0, NotChecked=0, Total=56882 [2018-12-03 17:48:24,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-03 17:48:24,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-12-03 17:48:24,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-12-03 17:48:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-12-03 17:48:24,801 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 242 [2018-12-03 17:48:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:48:24,801 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-12-03 17:48:24,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-12-03 17:48:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-12-03 17:48:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-12-03 17:48:24,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:48:24,802 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 59, 1, 1, 1, 1] [2018-12-03 17:48:24,802 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:48:24,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:48:24,802 INFO L82 PathProgramCache]: Analyzing trace with hash -614469769, now seen corresponding path program 88 times [2018-12-03 17:48:24,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:48:24,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:48:24,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:48:24,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:48:24,803 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:48:24,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:48:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 3660 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:26,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:48:26,687 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:48:26,687 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:48:26,687 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:48:26,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:48:26,687 INFO 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:48:26,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:48:26,695 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:48:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:48:26,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:48:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 3660 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:26,976 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:48:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 3660 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:29,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:48:29,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 66 [2018-12-03 17:48:29,540 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:48:29,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-03 17:48:29,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-03 17:48:29,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2085, Invalid=2337, Unknown=0, NotChecked=0, Total=4422 [2018-12-03 17:48:29,541 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 66 states. [2018-12-03 17:48:31,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:48:31,461 INFO L93 Difference]: Finished difference Result 252 states and 254 transitions. [2018-12-03 17:48:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-12-03 17:48:31,462 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 244 [2018-12-03 17:48:31,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:48:31,463 INFO L225 Difference]: With dead ends: 252 [2018-12-03 17:48:31,463 INFO L226 Difference]: Without dead ends: 250 [2018-12-03 17:48:31,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 426 SyntacticMatches, 118 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7622 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6112, Invalid=10144, Unknown=0, NotChecked=0, Total=16256 [2018-12-03 17:48:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-12-03 17:48:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-12-03 17:48:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-12-03 17:48:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-12-03 17:48:31,508 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 244 [2018-12-03 17:48:31,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:48:31,509 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-12-03 17:48:31,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-03 17:48:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-12-03 17:48:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-12-03 17:48:31,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:48:31,510 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 60, 1, 1, 1, 1] [2018-12-03 17:48:31,510 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:48:31,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:48:31,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1163771499, now seen corresponding path program 89 times [2018-12-03 17:48:31,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:48:31,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:48:31,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:48:31,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:48:31,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:48:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:48:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7442 backedges. 3782 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:36,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:48:36,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:48:36,002 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:48:36,002 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:48:36,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:48:36,002 INFO 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:48:36,011 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:48:36,011 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:48:36,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 62 check-sat command(s) [2018-12-03 17:48:36,410 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:48:36,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:48:41,933 INFO L134 CoverageAnalysis]: Checked inductivity of 7442 backedges. 3782 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:41,933 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:48:46,283 INFO L134 CoverageAnalysis]: Checked inductivity of 7442 backedges. 3782 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:46,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:48:46,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123, 123, 123] total 186 [2018-12-03 17:48:46,304 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:48:46,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-12-03 17:48:46,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-12-03 17:48:46,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7935, Invalid=26847, Unknown=0, NotChecked=0, Total=34782 [2018-12-03 17:48:46,307 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 185 states. [2018-12-03 17:48:49,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:48:49,519 INFO L93 Difference]: Finished difference Result 377 states and 379 transitions. [2018-12-03 17:48:49,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-12-03 17:48:49,520 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 248 [2018-12-03 17:48:49,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:48:49,521 INFO L225 Difference]: With dead ends: 377 [2018-12-03 17:48:49,521 INFO L226 Difference]: Without dead ends: 251 [2018-12-03 17:48:49,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 312 SyntacticMatches, 120 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22264 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=15435, Invalid=45327, Unknown=0, NotChecked=0, Total=60762 [2018-12-03 17:48:49,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-03 17:48:49,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-12-03 17:48:49,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-12-03 17:48:49,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-12-03 17:48:49,592 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 248 [2018-12-03 17:48:49,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:48:49,592 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-12-03 17:48:49,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-12-03 17:48:49,592 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-12-03 17:48:49,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-12-03 17:48:49,593 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:48:49,593 INFO L402 BasicCegarLoop]: trace histogram [62, 62, 61, 61, 1, 1, 1, 1] [2018-12-03 17:48:49,593 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:48:49,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:48:49,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1439425895, now seen corresponding path program 90 times [2018-12-03 17:48:49,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:48:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:48:49,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:48:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:48:49,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:48:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:48:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 3782 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:48:54,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:48:54,249 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:48:54,249 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:48:54,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:48:54,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:48:54,250 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:48:54,259 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:48:54,260 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:48:54,456 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:48:54,456 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:48:54,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:49:00,234 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 3782 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:00,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:49:04,653 INFO L134 CoverageAnalysis]: Checked inductivity of 7564 backedges. 3782 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:04,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:49:04,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124, 124, 124] total 185 [2018-12-03 17:49:04,673 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:49:04,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-03 17:49:04,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-03 17:49:04,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7811, Invalid=26599, Unknown=0, NotChecked=0, Total=34410 [2018-12-03 17:49:04,676 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 186 states. [2018-12-03 17:49:08,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:49:08,132 INFO L93 Difference]: Finished difference Result 379 states and 381 transitions. [2018-12-03 17:49:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-12-03 17:49:08,132 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 250 [2018-12-03 17:49:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:49:08,133 INFO L225 Difference]: With dead ends: 379 [2018-12-03 17:49:08,133 INFO L226 Difference]: Without dead ends: 253 [2018-12-03 17:49:08,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 683 GetRequests, 315 SyntacticMatches, 123 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22145 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=15436, Invalid=45326, Unknown=0, NotChecked=0, Total=60762 [2018-12-03 17:49:08,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-12-03 17:49:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-12-03 17:49:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-03 17:49:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 254 transitions. [2018-12-03 17:49:08,179 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 254 transitions. Word has length 250 [2018-12-03 17:49:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:49:08,179 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 254 transitions. [2018-12-03 17:49:08,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-03 17:49:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 254 transitions. [2018-12-03 17:49:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-03 17:49:08,180 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:49:08,180 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 61, 1, 1, 1, 1] [2018-12-03 17:49:08,180 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:49:08,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:49:08,181 INFO L82 PathProgramCache]: Analyzing trace with hash 55328099, now seen corresponding path program 91 times [2018-12-03 17:49:08,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:49:08,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:49:08,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:49:08,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:49:08,182 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:49:08,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:49:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 3906 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:09,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:49:09,998 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:49:09,998 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:49:09,998 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:49:09,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:49:09,998 INFO 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:49:10,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:49:10,007 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:49:10,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:49:10,204 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:49:10,315 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 3906 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:10,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:49:13,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7688 backedges. 3906 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:13,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:49:13,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 65, 65] total 68 [2018-12-03 17:49:13,041 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:49:13,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-03 17:49:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-03 17:49:13,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2216, Invalid=2476, Unknown=0, NotChecked=0, Total=4692 [2018-12-03 17:49:13,042 INFO L87 Difference]: Start difference. First operand 253 states and 254 transitions. Second operand 68 states. [2018-12-03 17:49:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:49:14,959 INFO L93 Difference]: Finished difference Result 260 states and 262 transitions. [2018-12-03 17:49:14,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-12-03 17:49:14,959 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 252 [2018-12-03 17:49:14,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:49:14,960 INFO L225 Difference]: With dead ends: 260 [2018-12-03 17:49:14,961 INFO L226 Difference]: Without dead ends: 258 [2018-12-03 17:49:14,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 692 GetRequests, 440 SyntacticMatches, 122 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8124 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6501, Invalid=10791, Unknown=0, NotChecked=0, Total=17292 [2018-12-03 17:49:14,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-03 17:49:15,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-12-03 17:49:15,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-12-03 17:49:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 258 transitions. [2018-12-03 17:49:15,008 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 258 transitions. Word has length 252 [2018-12-03 17:49:15,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:49:15,008 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 258 transitions. [2018-12-03 17:49:15,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-03 17:49:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 258 transitions. [2018-12-03 17:49:15,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-12-03 17:49:15,009 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:49:15,009 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 62, 1, 1, 1, 1] [2018-12-03 17:49:15,009 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:49:15,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:49:15,010 INFO L82 PathProgramCache]: Analyzing trace with hash -514247081, now seen corresponding path program 92 times [2018-12-03 17:49:15,010 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:49:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:49:15,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:49:15,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:49:15,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:49:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:49:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 4032 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:19,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:49:19,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:49:19,854 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:49:19,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:49:19,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:49:19,854 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:49:19,863 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:49:19,863 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:49:20,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 64 check-sat command(s) [2018-12-03 17:49:20,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:49:20,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:49:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 4032 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:26,020 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:49:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 7938 backedges. 4032 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:30,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:49:30,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 192 [2018-12-03 17:49:30,698 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:49:30,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-12-03 17:49:30,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-12-03 17:49:30,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8447, Invalid=28609, Unknown=0, NotChecked=0, Total=37056 [2018-12-03 17:49:30,700 INFO L87 Difference]: Start difference. First operand 257 states and 258 transitions. Second operand 191 states. [2018-12-03 17:49:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:49:34,309 INFO L93 Difference]: Finished difference Result 389 states and 391 transitions. [2018-12-03 17:49:34,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-12-03 17:49:34,309 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 256 [2018-12-03 17:49:34,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:49:34,310 INFO L225 Difference]: With dead ends: 389 [2018-12-03 17:49:34,310 INFO L226 Difference]: Without dead ends: 259 [2018-12-03 17:49:34,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 699 GetRequests, 322 SyntacticMatches, 124 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23750 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=16445, Invalid=48325, Unknown=0, NotChecked=0, Total=64770 [2018-12-03 17:49:34,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-12-03 17:49:34,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-12-03 17:49:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-03 17:49:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-12-03 17:49:34,367 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 256 [2018-12-03 17:49:34,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:49:34,367 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-12-03 17:49:34,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-12-03 17:49:34,367 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-12-03 17:49:34,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-03 17:49:34,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:49:34,368 INFO L402 BasicCegarLoop]: trace histogram [64, 64, 63, 63, 1, 1, 1, 1] [2018-12-03 17:49:34,368 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:49:34,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:49:34,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1080123053, now seen corresponding path program 93 times [2018-12-03 17:49:34,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:49:34,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:49:34,369 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:49:34,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:49:34,369 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:49:34,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:49:39,296 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 4032 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:39,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:49:39,297 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:49:39,297 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:49:39,297 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:49:39,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:49:39,297 INFO 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:49:39,305 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:49:39,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:49:39,504 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:49:39,504 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:49:39,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:49:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 4032 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:45,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:49:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8064 backedges. 4032 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:50,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:49:50,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128, 128, 128] total 191 [2018-12-03 17:49:50,187 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:49:50,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-03 17:49:50,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-03 17:49:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8319, Invalid=28353, Unknown=0, NotChecked=0, Total=36672 [2018-12-03 17:49:50,189 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 192 states. [2018-12-03 17:49:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:49:53,700 INFO L93 Difference]: Finished difference Result 391 states and 393 transitions. [2018-12-03 17:49:53,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-12-03 17:49:53,700 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 258 [2018-12-03 17:49:53,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:49:53,701 INFO L225 Difference]: With dead ends: 391 [2018-12-03 17:49:53,701 INFO L226 Difference]: Without dead ends: 261 [2018-12-03 17:49:53,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 325 SyntacticMatches, 127 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23627 ImplicationChecksByTransitivity, 17.5s TimeCoverageRelationStatistics Valid=16446, Invalid=48324, Unknown=0, NotChecked=0, Total=64770 [2018-12-03 17:49:53,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-12-03 17:49:53,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-12-03 17:49:53,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-12-03 17:49:53,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-12-03 17:49:53,752 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 258 [2018-12-03 17:49:53,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:49:53,752 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-12-03 17:49:53,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-03 17:49:53,752 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-12-03 17:49:53,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-12-03 17:49:53,753 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:49:53,753 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 63, 1, 1, 1, 1] [2018-12-03 17:49:53,753 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:49:53,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:49:53,754 INFO L82 PathProgramCache]: Analyzing trace with hash 573914447, now seen corresponding path program 94 times [2018-12-03 17:49:53,754 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:49:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:49:53,754 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:49:53,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:49:53,754 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:49:53,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:49:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 4160 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:55,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:49:55,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:49:55,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:49:55,644 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:49:55,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:49:55,644 INFO 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:49:55,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:49:55,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:49:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:49:55,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:49:56,047 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 4160 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:56,047 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:49:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8192 backedges. 4032 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:49:59,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:49:59,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 73 [2018-12-03 17:49:59,075 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:49:59,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-12-03 17:49:59,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-12-03 17:49:59,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2434, Invalid=2968, Unknown=0, NotChecked=0, Total=5402 [2018-12-03 17:49:59,076 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 71 states. [2018-12-03 17:50:01,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:50:01,416 INFO L93 Difference]: Finished difference Result 268 states and 270 transitions. [2018-12-03 17:50:01,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-12-03 17:50:01,417 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 260 [2018-12-03 17:50:01,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:50:01,418 INFO L225 Difference]: With dead ends: 268 [2018-12-03 17:50:01,418 INFO L226 Difference]: Without dead ends: 266 [2018-12-03 17:50:01,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 452 SyntacticMatches, 125 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8908 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=6916, Invalid=11990, Unknown=0, NotChecked=0, Total=18906 [2018-12-03 17:50:01,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-03 17:50:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-12-03 17:50:01,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-03 17:50:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-12-03 17:50:01,467 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 260 [2018-12-03 17:50:01,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:50:01,467 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-12-03 17:50:01,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-12-03 17:50:01,467 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-12-03 17:50:01,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-12-03 17:50:01,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:50:01,468 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 64, 1, 1, 1, 1] [2018-12-03 17:50:01,468 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:50:01,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:50:01,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1655201859, now seen corresponding path program 95 times [2018-12-03 17:50:01,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:50:01,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:50:01,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:50:01,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:50:01,469 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:50:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:50:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 8450 backedges. 4290 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:50:06,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:50:06,623 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:50:06,624 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:50: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 17:50:06,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:50:06,624 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:50:06,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:50:06,636 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:50:07,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-03 17:50:07,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:50:07,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:50:13,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8450 backedges. 4290 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:50:13,267 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:50:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 8450 backedges. 4290 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:50:18,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:50:18,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131, 131, 131] total 198 [2018-12-03 17:50:18,457 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:50:18,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-12-03 17:50:18,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-12-03 17:50:18,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8975, Invalid=30427, Unknown=0, NotChecked=0, Total=39402 [2018-12-03 17:50:18,459 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 197 states. [2018-12-03 17:50:22,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:50:22,019 INFO L93 Difference]: Finished difference Result 401 states and 403 transitions. [2018-12-03 17:50:22,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-12-03 17:50:22,020 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 264 [2018-12-03 17:50:22,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:50:22,021 INFO L225 Difference]: With dead ends: 401 [2018-12-03 17:50:22,021 INFO L226 Difference]: Without dead ends: 267 [2018-12-03 17:50:22,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 332 SyntacticMatches, 128 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25284 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=17487, Invalid=51419, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 17:50:22,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-12-03 17:50:22,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-12-03 17:50:22,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-12-03 17:50:22,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-12-03 17:50:22,072 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 264 [2018-12-03 17:50:22,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:50:22,073 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-12-03 17:50:22,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-12-03 17:50:22,073 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-12-03 17:50:22,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-12-03 17:50:22,074 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:50:22,074 INFO L402 BasicCegarLoop]: trace histogram [66, 66, 65, 65, 1, 1, 1, 1] [2018-12-03 17:50:22,074 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:50:22,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:50:22,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1967198015, now seen corresponding path program 96 times [2018-12-03 17:50:22,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:50:22,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:50:22,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:50:22,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:50:22,075 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:50:22,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:50:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4290 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:50:27,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:50:27,380 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:50:27,380 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:50:27,380 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:50:27,380 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:50:27,380 INFO 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:50:27,389 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:50:27,389 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:50:27,588 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:50:27,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:50:27,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:50:33,994 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4290 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:50:33,994 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:50:39,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8580 backedges. 4290 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:50:39,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:50:39,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132, 132, 132] total 197 [2018-12-03 17:50:39,064 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:50:39,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-12-03 17:50:39,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-12-03 17:50:39,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8843, Invalid=30163, Unknown=0, NotChecked=0, Total=39006 [2018-12-03 17:50:39,066 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 198 states. [2018-12-03 17:50:42,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:50:42,760 INFO L93 Difference]: Finished difference Result 403 states and 405 transitions. [2018-12-03 17:50:42,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-12-03 17:50:42,760 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 266 [2018-12-03 17:50:42,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:50:42,761 INFO L225 Difference]: With dead ends: 403 [2018-12-03 17:50:42,762 INFO L226 Difference]: Without dead ends: 269 [2018-12-03 17:50:42,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 727 GetRequests, 335 SyntacticMatches, 131 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25157 ImplicationChecksByTransitivity, 18.5s TimeCoverageRelationStatistics Valid=17488, Invalid=51418, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 17:50:42,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-03 17:50:42,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-12-03 17:50:42,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-12-03 17:50:42,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-12-03 17:50:42,813 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 266 [2018-12-03 17:50:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:50:42,814 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-12-03 17:50:42,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-12-03 17:50:42,814 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-12-03 17:50:42,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-12-03 17:50:42,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:50:42,815 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 65, 1, 1, 1, 1] [2018-12-03 17:50:42,815 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:50:42,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:50:42,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1147793211, now seen corresponding path program 97 times [2018-12-03 17:50:42,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:50:42,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:50:42,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:50:42,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:50:42,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:50:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:50:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 4422 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:50:44,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:50:44,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:50:44,872 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:50:44,872 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:50:44,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:50:44,872 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:50:44,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:50:44,882 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:50:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:50:45,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:50:45,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 4422 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:50:45,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:50:48,415 INFO L134 CoverageAnalysis]: Checked inductivity of 8712 backedges. 4290 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:50:48,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:50:48,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 75 [2018-12-03 17:50:48,436 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:50:48,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-12-03 17:50:48,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-12-03 17:50:48,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2575, Invalid=3125, Unknown=0, NotChecked=0, Total=5700 [2018-12-03 17:50:48,437 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 73 states. [2018-12-03 17:50:50,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:50:50,652 INFO L93 Difference]: Finished difference Result 276 states and 278 transitions. [2018-12-03 17:50:50,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-12-03 17:50:50,652 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 268 [2018-12-03 17:50:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:50:50,653 INFO L225 Difference]: With dead ends: 276 [2018-12-03 17:50:50,653 INFO L226 Difference]: Without dead ends: 274 [2018-12-03 17:50:50,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 735 GetRequests, 466 SyntacticMatches, 129 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9450 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=7329, Invalid=12693, Unknown=0, NotChecked=0, Total=20022 [2018-12-03 17:50:50,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-12-03 17:50:50,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-12-03 17:50:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-12-03 17:50:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-12-03 17:50:50,720 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 268 [2018-12-03 17:50:50,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:50:50,721 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-12-03 17:50:50,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-12-03 17:50:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-12-03 17:50:50,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-12-03 17:50:50,722 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:50:50,722 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 66, 1, 1, 1, 1] [2018-12-03 17:50:50,722 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:50:50,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:50:50,723 INFO L82 PathProgramCache]: Analyzing trace with hash 370818095, now seen corresponding path program 98 times [2018-12-03 17:50:50,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:50:50,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:50:50,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:50:50,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:50:50,724 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:50:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:50:56,187 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 4556 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:50:56,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:50:56,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:50:56,188 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:50:56,188 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:50:56,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:50:56,188 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:50:56,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:50:56,197 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:50:56,668 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 68 check-sat command(s) [2018-12-03 17:50:56,668 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:50:56,678 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 4556 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:03,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:08,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8978 backedges. 4556 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:08,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:08,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135, 135, 135] total 204 [2018-12-03 17:51:08,928 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:08,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-12-03 17:51:08,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-12-03 17:51:08,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9519, Invalid=32301, Unknown=0, NotChecked=0, Total=41820 [2018-12-03 17:51:08,931 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 203 states. [2018-12-03 17:51:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:13,234 INFO L93 Difference]: Finished difference Result 413 states and 415 transitions. [2018-12-03 17:51:13,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-12-03 17:51:13,234 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 272 [2018-12-03 17:51:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:13,235 INFO L225 Difference]: With dead ends: 413 [2018-12-03 17:51:13,236 INFO L226 Difference]: Without dead ends: 275 [2018-12-03 17:51:13,237 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 743 GetRequests, 342 SyntacticMatches, 132 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26866 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=18561, Invalid=54609, Unknown=0, NotChecked=0, Total=73170 [2018-12-03 17:51:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-03 17:51:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-12-03 17:51:13,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-12-03 17:51:13,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-12-03 17:51:13,291 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 272 [2018-12-03 17:51:13,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:13,291 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-12-03 17:51:13,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-12-03 17:51:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-12-03 17:51:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-12-03 17:51:13,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:13,293 INFO L402 BasicCegarLoop]: trace histogram [68, 68, 67, 67, 1, 1, 1, 1] [2018-12-03 17:51:13,293 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:13,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:13,294 INFO L82 PathProgramCache]: Analyzing trace with hash -2021511381, now seen corresponding path program 99 times [2018-12-03 17:51:13,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:13,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:13,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:51:13,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:13,295 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4556 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:18,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:18,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:18,895 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:18,895 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:51:18,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:18,895 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:18,907 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:51:18,908 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:51:19,118 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:51:19,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:51:19,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:26,029 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4556 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:26,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:31,492 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4556 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:31,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:31,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136, 136, 136] total 203 [2018-12-03 17:51:31,513 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:31,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-12-03 17:51:31,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-12-03 17:51:31,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9383, Invalid=32029, Unknown=0, NotChecked=0, Total=41412 [2018-12-03 17:51:31,515 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 204 states. [2018-12-03 17:51:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:35,728 INFO L93 Difference]: Finished difference Result 415 states and 417 transitions. [2018-12-03 17:51:35,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-12-03 17:51:35,728 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 274 [2018-12-03 17:51:35,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:35,729 INFO L225 Difference]: With dead ends: 415 [2018-12-03 17:51:35,729 INFO L226 Difference]: Without dead ends: 277 [2018-12-03 17:51:35,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 749 GetRequests, 345 SyntacticMatches, 135 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26735 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=18562, Invalid=54608, Unknown=0, NotChecked=0, Total=73170 [2018-12-03 17:51:35,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-12-03 17:51:35,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-12-03 17:51:35,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-03 17:51:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 278 transitions. [2018-12-03 17:51:35,789 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 278 transitions. Word has length 274 [2018-12-03 17:51:35,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:35,789 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 278 transitions. [2018-12-03 17:51:35,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-12-03 17:51:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 278 transitions. [2018-12-03 17:51:35,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-03 17:51:35,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:35,790 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 67, 1, 1, 1, 1] [2018-12-03 17:51:35,791 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:35,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:35,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1052332839, now seen corresponding path program 100 times [2018-12-03 17:51:35,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:35,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:51:35,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:35,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:37,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9248 backedges. 4692 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:37,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:37,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:37,922 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:37,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 17:51:37,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:37,922 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:37,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:37,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:51:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:38,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:38,333 INFO L134 CoverageAnalysis]: Checked inductivity of 9248 backedges. 4692 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:38,333 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:51:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9248 backedges. 4556 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:41,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:51:41,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 77 [2018-12-03 17:51:41,613 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:51:41,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-12-03 17:51:41,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-12-03 17:51:41,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2720, Invalid=3286, Unknown=0, NotChecked=0, Total=6006 [2018-12-03 17:51:41,614 INFO L87 Difference]: Start difference. First operand 277 states and 278 transitions. Second operand 75 states. [2018-12-03 17:51:43,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:51:43,898 INFO L93 Difference]: Finished difference Result 284 states and 286 transitions. [2018-12-03 17:51:43,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-12-03 17:51:43,898 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 276 [2018-12-03 17:51:43,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:51:43,900 INFO L225 Difference]: With dead ends: 284 [2018-12-03 17:51:43,900 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 17:51:43,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 480 SyntacticMatches, 133 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10008 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=7754, Invalid=13416, Unknown=0, NotChecked=0, Total=21170 [2018-12-03 17:51:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 17:51:43,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-12-03 17:51:43,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-12-03 17:51:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 282 transitions. [2018-12-03 17:51:43,963 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 282 transitions. Word has length 276 [2018-12-03 17:51:43,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:51:43,963 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 282 transitions. [2018-12-03 17:51:43,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-12-03 17:51:43,963 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 282 transitions. [2018-12-03 17:51:43,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-12-03 17:51:43,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:51:43,965 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 68, 1, 1, 1, 1] [2018-12-03 17:51:43,965 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:51:43,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:51:43,965 INFO L82 PathProgramCache]: Analyzing trace with hash -788674021, now seen corresponding path program 101 times [2018-12-03 17:51:43,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:51:43,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:43,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:51:43,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:51:43,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:51:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:51:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 9522 backedges. 4830 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:49,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:49,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:51:49,841 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:51:49,841 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:51:49,841 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:51:49,841 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:51:49,850 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:51:49,851 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:51:50,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 70 check-sat command(s) [2018-12-03 17:51:50,327 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:51:50,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:51:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9522 backedges. 4830 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:51:57,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:52:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 9522 backedges. 4830 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:02,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:52:02,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139, 139, 139] total 210 [2018-12-03 17:52:02,994 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:52:02,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-12-03 17:52:02,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-12-03 17:52:02,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10079, Invalid=34231, Unknown=0, NotChecked=0, Total=44310 [2018-12-03 17:52:02,997 INFO L87 Difference]: Start difference. First operand 281 states and 282 transitions. Second operand 209 states. [2018-12-03 17:52:07,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:52:07,247 INFO L93 Difference]: Finished difference Result 425 states and 427 transitions. [2018-12-03 17:52:07,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-12-03 17:52:07,248 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 280 [2018-12-03 17:52:07,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:52:07,249 INFO L225 Difference]: With dead ends: 425 [2018-12-03 17:52:07,249 INFO L226 Difference]: Without dead ends: 283 [2018-12-03 17:52:07,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 765 GetRequests, 352 SyntacticMatches, 136 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28496 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=19667, Invalid=57895, Unknown=0, NotChecked=0, Total=77562 [2018-12-03 17:52:07,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-12-03 17:52:07,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-12-03 17:52:07,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-03 17:52:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 284 transitions. [2018-12-03 17:52:07,303 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 284 transitions. Word has length 280 [2018-12-03 17:52:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:52:07,303 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 284 transitions. [2018-12-03 17:52:07,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-12-03 17:52:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 284 transitions. [2018-12-03 17:52:07,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-03 17:52:07,304 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:52:07,304 INFO L402 BasicCegarLoop]: trace histogram [70, 70, 69, 69, 1, 1, 1, 1] [2018-12-03 17:52:07,304 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:52:07,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:52:07,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1884225257, now seen corresponding path program 102 times [2018-12-03 17:52:07,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:52:07,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:07,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:52:07,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:07,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:52:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:52:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4830 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:13,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:13,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:52:13,067 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:52:13,067 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:52:13,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:13,067 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:52:13,075 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 17:52:13,075 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 17:52:13,288 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 17:52:13,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:52:13,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:52:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4830 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:20,252 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:52:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 9660 backedges. 4830 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:25,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:52:25,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140, 140, 140] total 209 [2018-12-03 17:52:25,783 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:52:25,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-12-03 17:52:25,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-12-03 17:52:25,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9939, Invalid=33951, Unknown=0, NotChecked=0, Total=43890 [2018-12-03 17:52:25,786 INFO L87 Difference]: Start difference. First operand 283 states and 284 transitions. Second operand 210 states. [2018-12-03 17:52:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:52:30,092 INFO L93 Difference]: Finished difference Result 427 states and 429 transitions. [2018-12-03 17:52:30,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-12-03 17:52:30,092 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 282 [2018-12-03 17:52:30,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:52:30,093 INFO L225 Difference]: With dead ends: 427 [2018-12-03 17:52:30,093 INFO L226 Difference]: Without dead ends: 285 [2018-12-03 17:52:30,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 771 GetRequests, 355 SyntacticMatches, 139 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28361 ImplicationChecksByTransitivity, 20.4s TimeCoverageRelationStatistics Valid=19668, Invalid=57894, Unknown=0, NotChecked=0, Total=77562 [2018-12-03 17:52:30,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-12-03 17:52:30,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-12-03 17:52:30,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-12-03 17:52:30,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-12-03 17:52:30,153 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 282 [2018-12-03 17:52:30,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:52:30,153 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-12-03 17:52:30,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-12-03 17:52:30,153 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-12-03 17:52:30,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-12-03 17:52:30,154 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:52:30,154 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 69, 1, 1, 1, 1] [2018-12-03 17:52:30,154 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:52:30,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:52:30,155 INFO L82 PathProgramCache]: Analyzing trace with hash 1852991763, now seen corresponding path program 103 times [2018-12-03 17:52:30,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:52:30,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:30,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 17:52:30,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:30,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:52:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:52:32,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 4970 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:32,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:32,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:52:32,428 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:52:32,428 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:52:32,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:32,428 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:52:32,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:52:32,436 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 17:52:32,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:52:32,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 17:52:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 4970 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:33,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 17:52:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 9800 backedges. 4830 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:37,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 17:52:37,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 79 [2018-12-03 17:52:37,481 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 17:52:37,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-12-03 17:52:37,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-12-03 17:52:37,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2869, Invalid=3451, Unknown=0, NotChecked=0, Total=6320 [2018-12-03 17:52:37,482 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 77 states. [2018-12-03 17:52:39,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 17:52:39,908 INFO L93 Difference]: Finished difference Result 292 states and 294 transitions. [2018-12-03 17:52:39,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-12-03 17:52:39,908 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 284 [2018-12-03 17:52:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 17:52:39,909 INFO L225 Difference]: With dead ends: 292 [2018-12-03 17:52:39,909 INFO L226 Difference]: Without dead ends: 290 [2018-12-03 17:52:39,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 779 GetRequests, 494 SyntacticMatches, 137 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10582 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=8191, Invalid=14159, Unknown=0, NotChecked=0, Total=22350 [2018-12-03 17:52:39,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-03 17:52:39,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-12-03 17:52:39,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-03 17:52:39,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 290 transitions. [2018-12-03 17:52:39,965 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 290 transitions. Word has length 284 [2018-12-03 17:52:39,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 17:52:39,966 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 290 transitions. [2018-12-03 17:52:39,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-12-03 17:52:39,966 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 290 transitions. [2018-12-03 17:52:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-12-03 17:52:39,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 17:52:39,967 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 71, 70, 1, 1, 1, 1] [2018-12-03 17:52:39,967 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 17:52:39,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 17:52:39,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1323169273, now seen corresponding path program 104 times [2018-12-03 17:52:39,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 17:52:39,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:39,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 17:52:39,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 17:52:39,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 17:52:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 17:52:46,037 INFO L134 CoverageAnalysis]: Checked inductivity of 10082 backedges. 5112 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 17:52:46,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:46,038 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 17:52:46,038 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 17:52:46,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 17:52:46,038 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 17:52:46,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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 17:52:46,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 17:52:46,047 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 17:52:46,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-03 17:52:46,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 17:52:46,569 INFO L273 TraceCheckSpWp]: Computing forward predicates...