java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-e1a14da [2018-12-24 13:47:13,740 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-24 13:47:13,743 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-24 13:47:13,760 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-24 13:47:13,761 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-24 13:47:13,762 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-24 13:47:13,764 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-24 13:47:13,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-24 13:47:13,769 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-24 13:47:13,772 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-24 13:47:13,773 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-24 13:47:13,773 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-24 13:47:13,774 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-24 13:47:13,778 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-24 13:47:13,786 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-24 13:47:13,787 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-24 13:47:13,791 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-24 13:47:13,793 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-24 13:47:13,799 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-24 13:47:13,801 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-24 13:47:13,803 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-24 13:47:13,804 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-24 13:47:13,808 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-24 13:47:13,808 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-24 13:47:13,809 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-24 13:47:13,809 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-24 13:47:13,810 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-24 13:47:13,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-24 13:47:13,814 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-24 13:47:13,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-24 13:47:13,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-24 13:47:13,818 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-24 13:47:13,818 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-24 13:47:13,818 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-24 13:47:13,819 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-24 13:47:13,820 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-24 13:47:13,820 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-24 13:47:13,844 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-24 13:47:13,844 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-24 13:47:13,846 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-24 13:47:13,846 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-24 13:47:13,846 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-24 13:47:13,846 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-24 13:47:13,847 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2018-12-24 13:47:13,847 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-24 13:47:13,847 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-24 13:47:13,847 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-24 13:47:13,848 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-24 13:47:13,848 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-24 13:47:13,848 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-24 13:47:13,849 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-24 13:47:13,849 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-24 13:47:13,850 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-24 13:47:13,850 INFO L133 SettingsManager]: * Use SBE=true [2018-12-24 13:47:13,850 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-24 13:47:13,850 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-24 13:47:13,850 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-24 13:47:13,851 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-24 13:47:13,851 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-24 13:47:13,851 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-24 13:47:13,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-24 13:47:13,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-24 13:47:13,852 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-24 13:47:13,852 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-24 13:47:13,852 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-24 13:47:13,852 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-24 13:47:13,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-24 13:47:13,853 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-24 13:47:13,853 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-24 13:47:13,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-24 13:47:13,853 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-24 13:47:13,854 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-24 13:47:13,854 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-24 13:47:13,854 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-24 13:47:13,854 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-24 13:47:13,854 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-24 13:47:13,855 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-24 13:47:13,901 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-24 13:47:13,916 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-24 13:47:13,920 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-24 13:47:13,922 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-24 13:47:13,923 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-24 13:47:13,924 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl [2018-12-24 13:47:13,924 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/PointerIncrement-simplified03.bpl' [2018-12-24 13:47:13,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-24 13:47:13,977 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-24 13:47:13,978 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-24 13:47:13,978 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-24 13:47:13,978 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-24 13:47:13,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:14,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:14,023 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-24 13:47:14,023 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-24 13:47:14,024 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-24 13:47:14,045 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-24 13:47:14,046 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-24 13:47:14,046 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-24 13:47:14,046 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-24 13:47:14,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:14,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:14,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:14,063 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:14,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:14,073 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:14,074 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/1) ... [2018-12-24 13:47:14,076 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-24 13:47:14,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-24 13:47:14,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-24 13:47:14,077 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-24 13:47:14,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (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-24 13:47:14,149 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-24 13:47:14,150 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-24 13:47:14,150 INFO L130 BoogieDeclarations]: Found specification of procedure ~malloc [2018-12-24 13:47:14,343 INFO L272 CfgBuilder]: Using library mode [2018-12-24 13:47:14,344 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-24 13:47:14,344 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:47:14 BoogieIcfgContainer [2018-12-24 13:47:14,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-24 13:47:14,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-24 13:47:14,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-24 13:47:14,349 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-24 13:47:14,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 24.12 01:47:13" (1/2) ... [2018-12-24 13:47:14,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c16e02a and model type PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:47:14, skipping insertion in model container [2018-12-24 13:47:14,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:47:14" (2/2) ... [2018-12-24 13:47:14,353 INFO L112 eAbstractionObserver]: Analyzing ICFG PointerIncrement-simplified03.bpl [2018-12-24 13:47:14,364 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-24 13:47:14,372 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-24 13:47:14,392 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-24 13:47:14,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-24 13:47:14,434 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-24 13:47:14,434 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-24 13:47:14,435 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-24 13:47:14,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-24 13:47:14,435 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-24 13:47:14,435 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-24 13:47:14,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-24 13:47:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2018-12-24 13:47:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-24 13:47:14,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:14,462 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-24 13:47:14,465 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:14,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:14,472 INFO L82 PathProgramCache]: Analyzing trace with hash 29984, now seen corresponding path program 1 times [2018-12-24 13:47:14,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:14,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:14,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:14,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:14,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:14,705 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-24 13:47:14,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-24 13:47:14,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-12-24 13:47:14,713 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:47:14,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-24 13:47:14,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-24 13:47:14,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:47:14,756 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2018-12-24 13:47:14,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:14,888 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2018-12-24 13:47:14,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-24 13:47:14,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-24 13:47:14,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:14,900 INFO L225 Difference]: With dead ends: 15 [2018-12-24 13:47:14,901 INFO L226 Difference]: Without dead ends: 8 [2018-12-24 13:47:14,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-24 13:47:14,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-24 13:47:14,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2018-12-24 13:47:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-24 13:47:14,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-24 13:47:14,942 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 3 [2018-12-24 13:47:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:14,943 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-24 13:47:14,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-24 13:47:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-24 13:47:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-24 13:47:14,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:14,944 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-24 13:47:14,944 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash 893294860, now seen corresponding path program 1 times [2018-12-24 13:47:14,945 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:14,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:14,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:14,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:14,946 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:15,131 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:15,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:15,131 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:15,134 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2018-12-24 13:47:15,136 INFO L207 CegarAbsIntRunner]: [0], [6], [7], [8], [12] [2018-12-24 13:47:15,185 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-24 13:47:15,185 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-24 13:47:15,317 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-24 13:47:15,320 INFO L272 AbstractInterpreter]: Visited 5 different actions 17 times. Merged at 4 different actions 12 times. Never widened. Performed 84 root evaluator evaluations with a maximum evaluation depth of 3. Performed 84 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-24 13:47:15,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:15,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-24 13:47:15,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:15,329 INFO L193 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-24 13:47:15,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:15,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:15,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:15,401 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:15,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:15,461 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:15,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:15,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:15,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:15,586 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:15,645 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:15,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:15,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2018-12-24 13:47:15,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:15,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-24 13:47:15,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-24 13:47:15,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:47:15,668 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-24 13:47:15,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:15,800 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-24 13:47:15,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-24 13:47:15,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-24 13:47:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:15,802 INFO L225 Difference]: With dead ends: 12 [2018-12-24 13:47:15,802 INFO L226 Difference]: Without dead ends: 11 [2018-12-24 13:47:15,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2018-12-24 13:47:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-24 13:47:15,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2018-12-24 13:47:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-24 13:47:15,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-24 13:47:15,811 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2018-12-24 13:47:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:15,812 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-24 13:47:15,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-24 13:47:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-24 13:47:15,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-24 13:47:15,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:15,813 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1] [2018-12-24 13:47:15,814 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:15,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:15,815 INFO L82 PathProgramCache]: Analyzing trace with hash 529849760, now seen corresponding path program 2 times [2018-12-24 13:47:15,816 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:15,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:15,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:15,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:15,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:16,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:16,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:16,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,025 INFO L193 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-24 13:47:16,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:16,044 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:16,097 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-24 13:47:16,097 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:16,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:16,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:16,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:16,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:16,209 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:16,454 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:16,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:16,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2018-12-24 13:47:16,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:16,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-24 13:47:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-24 13:47:16,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:47:16,565 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2018-12-24 13:47:16,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:16,706 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-12-24 13:47:16,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-24 13:47:16,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2018-12-24 13:47:16,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:16,709 INFO L225 Difference]: With dead ends: 15 [2018-12-24 13:47:16,709 INFO L226 Difference]: Without dead ends: 14 [2018-12-24 13:47:16,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2018-12-24 13:47:16,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-12-24 13:47:16,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-12-24 13:47:16,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-24 13:47:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-24 13:47:16,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2018-12-24 13:47:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:16,714 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-24 13:47:16,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-24 13:47:16,714 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-24 13:47:16,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-24 13:47:16,715 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:16,715 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1] [2018-12-24 13:47:16,715 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:16,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:16,716 INFO L82 PathProgramCache]: Analyzing trace with hash 749428876, now seen corresponding path program 3 times [2018-12-24 13:47:16,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,717 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:16,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:16,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:16,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,809 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:16,809 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:16,810 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:16,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:16,810 INFO L193 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-24 13:47:16,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:16,822 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:16,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:16,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:16,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:16,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:16,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:16,865 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:16,866 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:16,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:16,981 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:17,067 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:17,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:17,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2018-12-24 13:47:17,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:17,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-24 13:47:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-24 13:47:17,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:47:17,094 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 10 states. [2018-12-24 13:47:17,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:17,447 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-12-24 13:47:17,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-24 13:47:17,447 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 12 [2018-12-24 13:47:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:17,448 INFO L225 Difference]: With dead ends: 18 [2018-12-24 13:47:17,448 INFO L226 Difference]: Without dead ends: 17 [2018-12-24 13:47:17,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=97, Unknown=0, NotChecked=0, Total=182 [2018-12-24 13:47:17,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-24 13:47:17,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-12-24 13:47:17,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-24 13:47:17,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-12-24 13:47:17,453 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2018-12-24 13:47:17,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:17,453 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-12-24 13:47:17,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-24 13:47:17,453 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-12-24 13:47:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-24 13:47:17,454 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:17,454 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1] [2018-12-24 13:47:17,454 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:17,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:17,455 INFO L82 PathProgramCache]: Analyzing trace with hash 995681824, now seen corresponding path program 4 times [2018-12-24 13:47:17,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:17,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:17,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:17,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:17,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:17,593 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:17,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:17,594 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:17,594 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:17,595 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:17,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:17,595 INFO L193 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-24 13:47:17,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:17,612 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:17,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:17,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:17,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:17,632 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:17,642 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:17,642 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:17,743 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:17,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:17,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:17,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2018-12-24 13:47:17,908 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:17,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-24 13:47:17,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-24 13:47:17,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:47:17,909 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2018-12-24 13:47:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:18,011 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-12-24 13:47:18,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-24 13:47:18,012 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2018-12-24 13:47:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:18,013 INFO L225 Difference]: With dead ends: 21 [2018-12-24 13:47:18,014 INFO L226 Difference]: Without dead ends: 20 [2018-12-24 13:47:18,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=146, Unknown=0, NotChecked=0, Total=272 [2018-12-24 13:47:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-24 13:47:18,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-24 13:47:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-24 13:47:18,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-12-24 13:47:18,019 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 15 [2018-12-24 13:47:18,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:18,019 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-12-24 13:47:18,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-24 13:47:18,019 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-12-24 13:47:18,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-24 13:47:18,020 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:18,020 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1] [2018-12-24 13:47:18,020 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:18,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:18,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1313114124, now seen corresponding path program 5 times [2018-12-24 13:47:18,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:18,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:18,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:18,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:18,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:18,177 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,177 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:18,177 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:18,178 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:18,178 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:18,178 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:18,178 INFO L193 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-24 13:47:18,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:18,190 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:18,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-24 13:47:18,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:18,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:18,220 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:18,220 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:18,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:18,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:18,364 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:18,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2018-12-24 13:47:18,536 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:18,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-24 13:47:18,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-24 13:47:18,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:47:18,537 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 14 states. [2018-12-24 13:47:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:18,591 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-12-24 13:47:18,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-24 13:47:18,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2018-12-24 13:47:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:18,593 INFO L225 Difference]: With dead ends: 24 [2018-12-24 13:47:18,593 INFO L226 Difference]: Without dead ends: 23 [2018-12-24 13:47:18,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=205, Unknown=0, NotChecked=0, Total=380 [2018-12-24 13:47:18,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-24 13:47:18,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2018-12-24 13:47:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-24 13:47:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-12-24 13:47:18,599 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 18 [2018-12-24 13:47:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:18,600 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-12-24 13:47:18,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-24 13:47:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-12-24 13:47:18,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-24 13:47:18,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:18,601 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1] [2018-12-24 13:47:18,601 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:18,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:18,602 INFO L82 PathProgramCache]: Analyzing trace with hash 420777632, now seen corresponding path program 6 times [2018-12-24 13:47:18,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:18,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:18,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:18,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:18,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:18,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:18,789 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:18,789 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:18,789 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:18,789 INFO L193 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-24 13:47:18,803 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:18,804 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:18,816 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:18,816 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:18,818 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:18,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:18,829 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:18,846 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:18,847 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:18,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:19,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:19,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 21 [2018-12-24 13:47:19,152 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:19,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-24 13:47:19,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-24 13:47:19,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-24 13:47:19,154 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 16 states. [2018-12-24 13:47:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:19,242 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-12-24 13:47:19,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-24 13:47:19,243 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 21 [2018-12-24 13:47:19,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:19,245 INFO L225 Difference]: With dead ends: 27 [2018-12-24 13:47:19,245 INFO L226 Difference]: Without dead ends: 26 [2018-12-24 13:47:19,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=274, Unknown=0, NotChecked=0, Total=506 [2018-12-24 13:47:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-24 13:47:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-24 13:47:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-24 13:47:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-12-24 13:47:19,251 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 21 [2018-12-24 13:47:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:19,251 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-12-24 13:47:19,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-24 13:47:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-12-24 13:47:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-24 13:47:19,252 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:19,252 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1] [2018-12-24 13:47:19,253 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:19,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1623060596, now seen corresponding path program 7 times [2018-12-24 13:47:19,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:19,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:19,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:19,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:19,255 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:19,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:19,433 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:19,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:19,433 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:19,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:19,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:19,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:19,434 INFO L193 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-24 13:47:19,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:19,445 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:19,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:19,458 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:19,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:19,464 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:19,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:19,474 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:19,675 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:19,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:20,022 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:20,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:20,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2018-12-24 13:47:20,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:20,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-24 13:47:20,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-24 13:47:20,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-24 13:47:20,042 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 18 states. [2018-12-24 13:47:20,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:20,251 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-12-24 13:47:20,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-24 13:47:20,251 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2018-12-24 13:47:20,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:20,254 INFO L225 Difference]: With dead ends: 30 [2018-12-24 13:47:20,254 INFO L226 Difference]: Without dead ends: 29 [2018-12-24 13:47:20,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=297, Invalid=353, Unknown=0, NotChecked=0, Total=650 [2018-12-24 13:47:20,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-24 13:47:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2018-12-24 13:47:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-24 13:47:20,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-12-24 13:47:20,262 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 24 [2018-12-24 13:47:20,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:20,262 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-12-24 13:47:20,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-24 13:47:20,263 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-12-24 13:47:20,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-24 13:47:20,263 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:20,264 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1] [2018-12-24 13:47:20,264 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:20,264 INFO L82 PathProgramCache]: Analyzing trace with hash 143644448, now seen corresponding path program 8 times [2018-12-24 13:47:20,264 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:20,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:20,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:20,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:20,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:20,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:20,470 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:20,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:20,470 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:20,471 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:20,471 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:20,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:20,471 INFO L193 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-24 13:47:20,492 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:20,492 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:20,520 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-24 13:47:20,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:20,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:20,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:20,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:20,544 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:20,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:20,710 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:20,992 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:21,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:21,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 27 [2018-12-24 13:47:21,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:21,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-12-24 13:47:21,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-12-24 13:47:21,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-24 13:47:21,014 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2018-12-24 13:47:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:21,159 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-12-24 13:47:21,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-24 13:47:21,160 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2018-12-24 13:47:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:21,161 INFO L225 Difference]: With dead ends: 33 [2018-12-24 13:47:21,161 INFO L226 Difference]: Without dead ends: 32 [2018-12-24 13:47:21,162 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=370, Invalid=442, Unknown=0, NotChecked=0, Total=812 [2018-12-24 13:47:21,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-24 13:47:21,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-12-24 13:47:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-24 13:47:21,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-12-24 13:47:21,166 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2018-12-24 13:47:21,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:21,167 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-12-24 13:47:21,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-12-24 13:47:21,167 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-12-24 13:47:21,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-24 13:47:21,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:21,168 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1] [2018-12-24 13:47:21,168 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:21,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:21,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1524365068, now seen corresponding path program 9 times [2018-12-24 13:47:21,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:21,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:21,170 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:21,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:21,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:21,369 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:21,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:21,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:21,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:21,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:21,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:21,370 INFO L193 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-24 13:47:21,379 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:21,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:21,419 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:21,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:21,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:21,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:21,437 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:21,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:21,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:21,913 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:22,372 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:22,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:22,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2018-12-24 13:47:22,391 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:22,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-24 13:47:22,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-24 13:47:22,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-24 13:47:22,393 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 22 states. [2018-12-24 13:47:22,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:22,528 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-12-24 13:47:22,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-24 13:47:22,528 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2018-12-24 13:47:22,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:22,530 INFO L225 Difference]: With dead ends: 36 [2018-12-24 13:47:22,530 INFO L226 Difference]: Without dead ends: 35 [2018-12-24 13:47:22,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=451, Invalid=541, Unknown=0, NotChecked=0, Total=992 [2018-12-24 13:47:22,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-24 13:47:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-12-24 13:47:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-24 13:47:22,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-12-24 13:47:22,536 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 30 [2018-12-24 13:47:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:22,537 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-12-24 13:47:22,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-24 13:47:22,537 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-12-24 13:47:22,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-24 13:47:22,538 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:22,538 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1] [2018-12-24 13:47:22,538 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:22,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:22,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1670561696, now seen corresponding path program 10 times [2018-12-24 13:47:22,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:22,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:22,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:22,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:22,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:22,755 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:22,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:22,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:22,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:22,755 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:22,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:22,755 INFO L193 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-24 13:47:22,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:22,764 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:22,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:22,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:22,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:22,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:22,912 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:23,219 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:23,505 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:23,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:23,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2018-12-24 13:47:23,528 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:23,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-24 13:47:23,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-24 13:47:23,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-24 13:47:23,530 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 24 states. [2018-12-24 13:47:23,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:23,628 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-12-24 13:47:23,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-24 13:47:23,629 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 33 [2018-12-24 13:47:23,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:23,631 INFO L225 Difference]: With dead ends: 39 [2018-12-24 13:47:23,631 INFO L226 Difference]: Without dead ends: 38 [2018-12-24 13:47:23,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=540, Invalid=650, Unknown=0, NotChecked=0, Total=1190 [2018-12-24 13:47:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-24 13:47:23,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-12-24 13:47:23,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-24 13:47:23,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-24 13:47:23,636 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 33 [2018-12-24 13:47:23,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:23,637 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-24 13:47:23,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-24 13:47:23,637 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-24 13:47:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-24 13:47:23,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:23,638 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1] [2018-12-24 13:47:23,638 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:23,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:23,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1917468300, now seen corresponding path program 11 times [2018-12-24 13:47:23,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:23,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:23,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:23,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:23,640 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:23,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:23,856 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:23,856 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:23,856 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:23,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:23,857 INFO L193 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-24 13:47:23,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:23,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:23,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-24 13:47:23,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:23,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:23,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:23,900 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:23,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:23,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:24,106 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:24,411 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:24,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:24,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 36 [2018-12-24 13:47:24,431 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:24,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-24 13:47:24,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-24 13:47:24,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 13:47:24,432 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 26 states. [2018-12-24 13:47:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:24,519 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-12-24 13:47:24,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-24 13:47:24,519 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2018-12-24 13:47:24,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:24,520 INFO L225 Difference]: With dead ends: 42 [2018-12-24 13:47:24,521 INFO L226 Difference]: Without dead ends: 41 [2018-12-24 13:47:24,522 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=637, Invalid=769, Unknown=0, NotChecked=0, Total=1406 [2018-12-24 13:47:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-12-24 13:47:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-12-24 13:47:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-24 13:47:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-12-24 13:47:24,527 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 36 [2018-12-24 13:47:24,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:24,527 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-12-24 13:47:24,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-24 13:47:24,528 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-12-24 13:47:24,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-24 13:47:24,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:24,528 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1] [2018-12-24 13:47:24,529 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:24,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:24,529 INFO L82 PathProgramCache]: Analyzing trace with hash 233130016, now seen corresponding path program 12 times [2018-12-24 13:47:24,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:24,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:24,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:24,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:24,530 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:24,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:24,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:24,975 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:24,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:24,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:24,976 INFO L193 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-24 13:47:24,983 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:24,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:24,998 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:24,998 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:25,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:25,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:25,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:25,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:25,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:25,238 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:25,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:25,518 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:25,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:25,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 39 [2018-12-24 13:47:25,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:25,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-12-24 13:47:25,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-12-24 13:47:25,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-24 13:47:25,539 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 28 states. [2018-12-24 13:47:25,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:25,632 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-12-24 13:47:25,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-24 13:47:25,632 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-12-24 13:47:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:25,633 INFO L225 Difference]: With dead ends: 45 [2018-12-24 13:47:25,634 INFO L226 Difference]: Without dead ends: 44 [2018-12-24 13:47:25,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=742, Invalid=898, Unknown=0, NotChecked=0, Total=1640 [2018-12-24 13:47:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-24 13:47:25,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-12-24 13:47:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-24 13:47:25,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-12-24 13:47:25,639 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 39 [2018-12-24 13:47:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:25,640 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-12-24 13:47:25,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-12-24 13:47:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-12-24 13:47:25,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-24 13:47:25,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:25,641 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1] [2018-12-24 13:47:25,641 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:25,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:25,642 INFO L82 PathProgramCache]: Analyzing trace with hash 214230540, now seen corresponding path program 13 times [2018-12-24 13:47:25,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:25,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:25,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:25,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:25,643 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:26,013 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:26,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:26,014 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:26,014 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:26,014 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:26,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:26,014 INFO L193 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-24 13:47:26,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:26,025 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:26,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:26,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:26,071 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:26,079 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:26,079 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:26,426 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:26,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:27,216 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:27,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:27,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 42 [2018-12-24 13:47:27,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:27,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-12-24 13:47:27,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-12-24 13:47:27,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 13:47:27,237 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 30 states. [2018-12-24 13:47:27,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:27,377 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-12-24 13:47:27,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-24 13:47:27,378 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 42 [2018-12-24 13:47:27,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:27,380 INFO L225 Difference]: With dead ends: 48 [2018-12-24 13:47:27,380 INFO L226 Difference]: Without dead ends: 47 [2018-12-24 13:47:27,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=855, Invalid=1037, Unknown=0, NotChecked=0, Total=1892 [2018-12-24 13:47:27,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-12-24 13:47:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-24 13:47:27,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-24 13:47:27,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-12-24 13:47:27,387 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 42 [2018-12-24 13:47:27,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:27,387 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-12-24 13:47:27,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-12-24 13:47:27,388 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-12-24 13:47:27,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-24 13:47:27,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:27,389 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1] [2018-12-24 13:47:27,389 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:27,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:27,389 INFO L82 PathProgramCache]: Analyzing trace with hash -179343200, now seen corresponding path program 14 times [2018-12-24 13:47:27,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:27,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:27,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:27,390 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:27,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:27,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:27,779 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:27,779 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:27,779 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:27,779 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:27,779 INFO L193 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-24 13:47:27,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:27,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:27,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-12-24 13:47:27,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:27,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:27,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:27,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:27,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:27,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:28,169 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:28,169 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:28,570 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:28,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:28,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 45 [2018-12-24 13:47:28,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:28,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-12-24 13:47:28,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-12-24 13:47:28,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-24 13:47:28,591 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 32 states. [2018-12-24 13:47:28,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:28,812 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-12-24 13:47:28,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-24 13:47:28,813 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 45 [2018-12-24 13:47:28,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:28,814 INFO L225 Difference]: With dead ends: 51 [2018-12-24 13:47:28,814 INFO L226 Difference]: Without dead ends: 50 [2018-12-24 13:47:28,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 870 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=976, Invalid=1186, Unknown=0, NotChecked=0, Total=2162 [2018-12-24 13:47:28,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-24 13:47:28,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-12-24 13:47:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-24 13:47:28,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-12-24 13:47:28,819 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 45 [2018-12-24 13:47:28,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:28,820 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-12-24 13:47:28,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-12-24 13:47:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-12-24 13:47:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-24 13:47:28,821 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:28,821 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1] [2018-12-24 13:47:28,821 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:28,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:28,821 INFO L82 PathProgramCache]: Analyzing trace with hash 126086540, now seen corresponding path program 15 times [2018-12-24 13:47:28,821 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:28,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:28,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:28,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:28,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:29,098 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:29,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:29,099 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:29,099 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:29,099 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:29,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:29,099 INFO L193 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-24 13:47:29,109 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:29,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:29,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:29,127 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:29,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:29,141 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:29,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:29,149 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:29,150 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:29,410 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:29,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:30,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:30,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 48 [2018-12-24 13:47:30,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:30,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-12-24 13:47:30,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-12-24 13:47:30,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 13:47:30,080 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 34 states. [2018-12-24 13:47:30,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:30,223 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-12-24 13:47:30,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-24 13:47:30,223 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 48 [2018-12-24 13:47:30,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:30,224 INFO L225 Difference]: With dead ends: 54 [2018-12-24 13:47:30,224 INFO L226 Difference]: Without dead ends: 53 [2018-12-24 13:47:30,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 992 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1105, Invalid=1345, Unknown=0, NotChecked=0, Total=2450 [2018-12-24 13:47:30,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-24 13:47:30,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-12-24 13:47:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-12-24 13:47:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-12-24 13:47:30,230 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 48 [2018-12-24 13:47:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:30,230 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-12-24 13:47:30,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-12-24 13:47:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-12-24 13:47:30,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-24 13:47:30,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:30,231 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1] [2018-12-24 13:47:30,231 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:30,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:30,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1852229344, now seen corresponding path program 16 times [2018-12-24 13:47:30,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:30,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:30,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:30,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:30,233 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:30,993 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:30,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:30,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:30,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:30,994 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:30,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:30,994 INFO L193 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-24 13:47:31,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:31,003 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:31,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:31,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:31,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:31,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:31,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:32,917 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:33,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:33,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 51 [2018-12-24 13:47:33,443 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:33,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-12-24 13:47:33,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-12-24 13:47:33,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-24 13:47:33,445 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 36 states. [2018-12-24 13:47:33,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:33,577 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-12-24 13:47:33,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-24 13:47:33,578 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 51 [2018-12-24 13:47:33,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:33,579 INFO L225 Difference]: With dead ends: 57 [2018-12-24 13:47:33,579 INFO L226 Difference]: Without dead ends: 56 [2018-12-24 13:47:33,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1242, Invalid=1514, Unknown=0, NotChecked=0, Total=2756 [2018-12-24 13:47:33,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-24 13:47:33,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-12-24 13:47:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-24 13:47:33,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-12-24 13:47:33,586 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 51 [2018-12-24 13:47:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:33,586 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-12-24 13:47:33,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-12-24 13:47:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-12-24 13:47:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-24 13:47:33,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:33,588 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1] [2018-12-24 13:47:33,588 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:33,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:33,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1975473420, now seen corresponding path program 17 times [2018-12-24 13:47:33,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:33,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:33,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:33,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:33,589 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:34,162 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:34,162 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:34,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:34,163 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:34,163 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:34,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:34,163 INFO L193 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-24 13:47:34,172 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:34,172 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:34,212 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-12-24 13:47:34,212 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:34,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:34,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:34,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:34,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:34,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:34,473 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:34,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:34,926 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:34,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:34,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 54 [2018-12-24 13:47:34,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:34,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-24 13:47:34,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-24 13:47:34,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 13:47:34,947 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 38 states. [2018-12-24 13:47:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:35,115 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-12-24 13:47:35,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-24 13:47:35,116 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 54 [2018-12-24 13:47:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:35,116 INFO L225 Difference]: With dead ends: 60 [2018-12-24 13:47:35,116 INFO L226 Difference]: Without dead ends: 59 [2018-12-24 13:47:35,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1387, Invalid=1693, Unknown=0, NotChecked=0, Total=3080 [2018-12-24 13:47:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-24 13:47:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-12-24 13:47:35,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-24 13:47:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-12-24 13:47:35,121 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 54 [2018-12-24 13:47:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:35,122 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-12-24 13:47:35,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-24 13:47:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-12-24 13:47:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-24 13:47:35,122 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:35,123 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1] [2018-12-24 13:47:35,123 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:35,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:35,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1686806944, now seen corresponding path program 18 times [2018-12-24 13:47:35,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:35,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:35,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:35,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:35,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:35,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:35,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:35,487 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:35,487 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:35,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:35,487 INFO L193 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-24 13:47:35,496 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:35,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:35,516 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:35,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:35,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:35,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:35,541 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:35,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:35,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:35,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:36,570 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:36,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:36,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 57 [2018-12-24 13:47:36,589 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:36,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-12-24 13:47:36,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-12-24 13:47:36,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-24 13:47:36,591 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 40 states. [2018-12-24 13:47:36,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:36,721 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-12-24 13:47:36,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-24 13:47:36,722 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 57 [2018-12-24 13:47:36,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:36,723 INFO L225 Difference]: With dead ends: 63 [2018-12-24 13:47:36,723 INFO L226 Difference]: Without dead ends: 62 [2018-12-24 13:47:36,725 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1882, Unknown=0, NotChecked=0, Total=3422 [2018-12-24 13:47:36,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-12-24 13:47:36,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-12-24 13:47:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-24 13:47:36,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-12-24 13:47:36,729 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 57 [2018-12-24 13:47:36,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:36,730 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-12-24 13:47:36,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-12-24 13:47:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-12-24 13:47:36,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-24 13:47:36,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:36,731 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1] [2018-12-24 13:47:36,731 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:36,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:36,732 INFO L82 PathProgramCache]: Analyzing trace with hash 548347020, now seen corresponding path program 19 times [2018-12-24 13:47:36,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:36,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:36,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:36,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:36,733 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:37,125 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:37,125 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:37,125 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:37,125 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:37,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:37,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:37,126 INFO L193 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-24 13:47:37,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:37,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:37,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:37,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:37,163 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:37,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:37,174 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:37,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 0 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:38,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:38,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 60 [2018-12-24 13:47:38,055 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:38,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-12-24 13:47:38,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-12-24 13:47:38,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 13:47:38,058 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 42 states. [2018-12-24 13:47:38,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:38,208 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-12-24 13:47:38,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-24 13:47:38,208 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 60 [2018-12-24 13:47:38,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:38,209 INFO L225 Difference]: With dead ends: 66 [2018-12-24 13:47:38,209 INFO L226 Difference]: Without dead ends: 65 [2018-12-24 13:47:38,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1560 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1701, Invalid=2081, Unknown=0, NotChecked=0, Total=3782 [2018-12-24 13:47:38,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-24 13:47:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-12-24 13:47:38,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-24 13:47:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-12-24 13:47:38,215 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 60 [2018-12-24 13:47:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:38,216 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-12-24 13:47:38,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-12-24 13:47:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-12-24 13:47:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-24 13:47:38,216 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:38,216 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1] [2018-12-24 13:47:38,217 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:38,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:38,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2045487648, now seen corresponding path program 20 times [2018-12-24 13:47:38,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:38,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:38,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:38,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:38,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:38,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:38,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:38,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:38,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:38,541 INFO L193 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-24 13:47:38,548 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:38,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:38,590 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2018-12-24 13:47:38,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:38,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:38,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:38,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:38,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:38,611 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:39,029 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:39,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 0 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:39,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:39,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2018-12-24 13:47:39,729 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:39,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-12-24 13:47:39,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-12-24 13:47:39,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-24 13:47:39,731 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 44 states. [2018-12-24 13:47:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:39,908 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-12-24 13:47:39,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-24 13:47:39,908 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 63 [2018-12-24 13:47:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:39,909 INFO L225 Difference]: With dead ends: 69 [2018-12-24 13:47:39,909 INFO L226 Difference]: Without dead ends: 68 [2018-12-24 13:47:39,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1722 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1870, Invalid=2290, Unknown=0, NotChecked=0, Total=4160 [2018-12-24 13:47:39,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-12-24 13:47:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-12-24 13:47:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-24 13:47:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-12-24 13:47:39,918 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 63 [2018-12-24 13:47:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:39,918 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-12-24 13:47:39,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-12-24 13:47:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-12-24 13:47:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-24 13:47:39,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:39,920 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1] [2018-12-24 13:47:39,921 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:39,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:39,921 INFO L82 PathProgramCache]: Analyzing trace with hash 126567436, now seen corresponding path program 21 times [2018-12-24 13:47:39,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:39,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:39,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:39,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:39,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:40,672 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:40,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:40,672 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:40,673 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:40,673 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:40,673 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:40,673 INFO L193 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-24 13:47:40,682 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:40,682 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:40,704 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:40,704 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:40,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:40,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:40,725 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:40,737 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:40,737 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:41,139 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:41,139 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:41,806 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:41,826 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:41,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 66 [2018-12-24 13:47:41,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:41,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-12-24 13:47:41,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-12-24 13:47:41,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 13:47:41,828 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 46 states. [2018-12-24 13:47:41,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:41,966 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-12-24 13:47:41,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-24 13:47:41,970 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 66 [2018-12-24 13:47:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:41,970 INFO L225 Difference]: With dead ends: 72 [2018-12-24 13:47:41,970 INFO L226 Difference]: Without dead ends: 71 [2018-12-24 13:47:41,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1892 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2047, Invalid=2509, Unknown=0, NotChecked=0, Total=4556 [2018-12-24 13:47:41,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-24 13:47:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-12-24 13:47:41,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-24 13:47:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-12-24 13:47:41,975 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 66 [2018-12-24 13:47:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:41,975 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-12-24 13:47:41,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-12-24 13:47:41,975 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-12-24 13:47:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-24 13:47:41,976 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:41,976 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1] [2018-12-24 13:47:41,976 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:41,977 INFO L82 PathProgramCache]: Analyzing trace with hash -410758496, now seen corresponding path program 22 times [2018-12-24 13:47:41,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:41,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:41,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:41,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:41,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:42,338 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:42,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:42,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:42,339 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:42,339 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:42,339 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:42,339 INFO L193 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-24 13:47:42,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:42,355 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:42,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:42,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:42,399 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:42,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:42,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:42,783 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:42,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:43,564 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:43,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:43,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2018-12-24 13:47:43,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:43,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-12-24 13:47:43,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-12-24 13:47:43,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-24 13:47:43,585 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 48 states. [2018-12-24 13:47:43,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:43,756 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-12-24 13:47:43,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-24 13:47:43,757 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 69 [2018-12-24 13:47:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:43,758 INFO L225 Difference]: With dead ends: 75 [2018-12-24 13:47:43,758 INFO L226 Difference]: Without dead ends: 74 [2018-12-24 13:47:43,759 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2070 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2232, Invalid=2738, Unknown=0, NotChecked=0, Total=4970 [2018-12-24 13:47:43,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-24 13:47:43,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-12-24 13:47:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-12-24 13:47:43,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-12-24 13:47:43,763 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 69 [2018-12-24 13:47:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:43,763 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-12-24 13:47:43,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-12-24 13:47:43,763 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-12-24 13:47:43,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-24 13:47:43,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:43,764 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1] [2018-12-24 13:47:43,764 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:43,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:43,765 INFO L82 PathProgramCache]: Analyzing trace with hash -544486516, now seen corresponding path program 23 times [2018-12-24 13:47:43,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:43,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:43,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:43,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:43,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:44,318 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:44,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:44,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:44,318 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:44,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:44,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:44,319 INFO L193 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-24 13:47:44,327 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:44,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:44,374 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2018-12-24 13:47:44,374 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:44,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:44,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:44,380 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:44,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:44,407 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:44,812 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:45,840 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 0 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:45,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:45,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 72 [2018-12-24 13:47:45,858 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:45,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-12-24 13:47:45,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-12-24 13:47:45,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 13:47:45,860 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 50 states. [2018-12-24 13:47:46,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:46,027 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-12-24 13:47:46,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-24 13:47:46,027 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 72 [2018-12-24 13:47:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:46,028 INFO L225 Difference]: With dead ends: 78 [2018-12-24 13:47:46,028 INFO L226 Difference]: Without dead ends: 77 [2018-12-24 13:47:46,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2425, Invalid=2977, Unknown=0, NotChecked=0, Total=5402 [2018-12-24 13:47:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-24 13:47:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-12-24 13:47:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-24 13:47:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-12-24 13:47:46,034 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 72 [2018-12-24 13:47:46,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:46,034 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-12-24 13:47:46,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-12-24 13:47:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-12-24 13:47:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-24 13:47:46,035 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:46,035 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1] [2018-12-24 13:47:46,035 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:46,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:46,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1293720352, now seen corresponding path program 24 times [2018-12-24 13:47:46,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:46,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:46,037 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:46,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:46,485 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:46,485 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:46,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:46,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:46,486 INFO L193 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-24 13:47:46,493 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:46,494 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:46,514 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:46,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:46,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:46,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:46,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:46,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:46,535 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:46,957 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:48,020 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 0 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:48,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:48,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 75 [2018-12-24 13:47:48,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:48,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-12-24 13:47:48,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-12-24 13:47:48,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-24 13:47:48,040 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 52 states. [2018-12-24 13:47:48,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:48,230 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-12-24 13:47:48,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-24 13:47:48,230 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 75 [2018-12-24 13:47:48,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:48,231 INFO L225 Difference]: With dead ends: 81 [2018-12-24 13:47:48,231 INFO L226 Difference]: Without dead ends: 80 [2018-12-24 13:47:48,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2450 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2626, Invalid=3226, Unknown=0, NotChecked=0, Total=5852 [2018-12-24 13:47:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-24 13:47:48,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-12-24 13:47:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-12-24 13:47:48,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-12-24 13:47:48,237 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 75 [2018-12-24 13:47:48,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:48,237 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-12-24 13:47:48,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-12-24 13:47:48,237 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-12-24 13:47:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-24 13:47:48,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:48,238 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1] [2018-12-24 13:47:48,238 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:48,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:48,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1813466356, now seen corresponding path program 25 times [2018-12-24 13:47:48,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:48,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:48,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:48,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:48,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:48,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:48,697 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:48,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:48,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:48,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:48,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:48,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:48,698 INFO L193 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-24 13:47:48,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:48,708 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:48,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:48,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:48,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:48,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:48,746 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:49,234 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:49,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 0 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:50,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:50,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 78 [2018-12-24 13:47:50,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:50,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-12-24 13:47:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-12-24 13:47:50,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 13:47:50,133 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 54 states. [2018-12-24 13:47:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:50,369 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-12-24 13:47:50,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-24 13:47:50,369 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 78 [2018-12-24 13:47:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:50,370 INFO L225 Difference]: With dead ends: 84 [2018-12-24 13:47:50,370 INFO L226 Difference]: Without dead ends: 83 [2018-12-24 13:47:50,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2652 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2835, Invalid=3485, Unknown=0, NotChecked=0, Total=6320 [2018-12-24 13:47:50,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-24 13:47:50,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-12-24 13:47:50,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-12-24 13:47:50,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-12-24 13:47:50,374 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 78 [2018-12-24 13:47:50,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:50,375 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-12-24 13:47:50,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-12-24 13:47:50,375 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-12-24 13:47:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-24 13:47:50,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:50,376 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1] [2018-12-24 13:47:50,376 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:50,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1417446304, now seen corresponding path program 26 times [2018-12-24 13:47:50,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:50,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:50,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:50,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:50,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:50,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:50,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:50,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:50,933 INFO L193 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-24 13:47:50,942 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:50,942 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:50,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-12-24 13:47:50,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:50,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:51,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:51,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:51,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:51,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:51,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:51,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 1027 backedges. 0 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:52,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:52,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 81 [2018-12-24 13:47:52,668 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:52,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-12-24 13:47:52,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-12-24 13:47:52,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-24 13:47:52,670 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 56 states. [2018-12-24 13:47:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:52,851 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-12-24 13:47:52,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-12-24 13:47:52,851 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 81 [2018-12-24 13:47:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:52,852 INFO L225 Difference]: With dead ends: 87 [2018-12-24 13:47:52,853 INFO L226 Difference]: Without dead ends: 86 [2018-12-24 13:47:52,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3052, Invalid=3754, Unknown=0, NotChecked=0, Total=6806 [2018-12-24 13:47:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-24 13:47:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-12-24 13:47:52,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-24 13:47:52,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-12-24 13:47:52,857 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2018-12-24 13:47:52,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:52,858 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-12-24 13:47:52,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-12-24 13:47:52,858 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-12-24 13:47:52,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-24 13:47:52,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:52,858 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1] [2018-12-24 13:47:52,858 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:52,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:52,859 INFO L82 PathProgramCache]: Analyzing trace with hash -975570292, now seen corresponding path program 27 times [2018-12-24 13:47:52,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:52,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:52,859 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:52,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:52,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:52,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:53,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:53,402 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:53,402 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:53,402 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:53,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:53,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:53,403 INFO L193 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-24 13:47:53,413 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:47:53,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:47:53,438 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:47:53,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:53,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:53,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:53,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:53,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:53,458 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:54,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:55,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 0 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:55,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:55,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 84 [2018-12-24 13:47:55,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:55,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-12-24 13:47:55,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-12-24 13:47:55,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 13:47:55,059 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 58 states. [2018-12-24 13:47:55,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:55,231 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-12-24 13:47:55,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-24 13:47:55,232 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 84 [2018-12-24 13:47:55,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:55,233 INFO L225 Difference]: With dead ends: 90 [2018-12-24 13:47:55,233 INFO L226 Difference]: Without dead ends: 89 [2018-12-24 13:47:55,234 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3277, Invalid=4033, Unknown=0, NotChecked=0, Total=7310 [2018-12-24 13:47:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-24 13:47:55,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-12-24 13:47:55,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-24 13:47:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-12-24 13:47:55,237 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2018-12-24 13:47:55,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:55,238 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-12-24 13:47:55,238 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-12-24 13:47:55,238 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-12-24 13:47:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-12-24 13:47:55,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:55,238 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1] [2018-12-24 13:47:55,238 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:55,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:55,239 INFO L82 PathProgramCache]: Analyzing trace with hash 829164576, now seen corresponding path program 28 times [2018-12-24 13:47:55,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:55,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:55,239 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:47:55,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:55,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:55,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:55,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:55,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:55,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:55,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:55,988 INFO L193 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-24 13:47:55,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:55,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:47:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:56,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:56,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:56,039 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:56,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:56,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:56,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:47:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:57,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:47:57,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 87 [2018-12-24 13:47:57,985 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:47:57,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-12-24 13:47:57,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-12-24 13:47:57,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-24 13:47:57,986 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 60 states. [2018-12-24 13:47:58,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:47:58,220 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-12-24 13:47:58,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-24 13:47:58,221 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 87 [2018-12-24 13:47:58,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:47:58,223 INFO L225 Difference]: With dead ends: 93 [2018-12-24 13:47:58,223 INFO L226 Difference]: Without dead ends: 92 [2018-12-24 13:47:58,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3306 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3510, Invalid=4322, Unknown=0, NotChecked=0, Total=7832 [2018-12-24 13:47:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-12-24 13:47:58,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-12-24 13:47:58,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-24 13:47:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-12-24 13:47:58,228 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-12-24 13:47:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:47:58,228 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-12-24 13:47:58,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-12-24 13:47:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-12-24 13:47:58,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-24 13:47:58,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:47:58,229 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1] [2018-12-24 13:47:58,230 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:47:58,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:47:58,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1285005836, now seen corresponding path program 29 times [2018-12-24 13:47:58,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:47:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:58,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:47:58,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:47:58,231 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:47:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:47:59,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:59,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:59,241 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:47:59,241 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:47:59,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:47:59,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:47:59,242 INFO L193 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-24 13:47:59,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:47:59,256 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:47:59,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2018-12-24 13:47:59,321 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:47:59,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:47:59,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:47:59,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:47:59,340 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:47:59,341 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:47:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:47:59,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:01,437 INFO L134 CoverageAnalysis]: Checked inductivity of 1276 backedges. 0 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:01,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:01,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 90 [2018-12-24 13:48:01,456 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:01,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-12-24 13:48:01,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-12-24 13:48:01,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 13:48:01,457 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 62 states. [2018-12-24 13:48:01,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:01,656 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-12-24 13:48:01,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-12-24 13:48:01,657 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 90 [2018-12-24 13:48:01,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:01,658 INFO L225 Difference]: With dead ends: 96 [2018-12-24 13:48:01,658 INFO L226 Difference]: Without dead ends: 95 [2018-12-24 13:48:01,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3751, Invalid=4621, Unknown=0, NotChecked=0, Total=8372 [2018-12-24 13:48:01,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-12-24 13:48:01,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-12-24 13:48:01,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-24 13:48:01,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-12-24 13:48:01,664 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-12-24 13:48:01,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:01,664 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-12-24 13:48:01,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-12-24 13:48:01,664 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-12-24 13:48:01,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-24 13:48:01,664 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:01,664 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1] [2018-12-24 13:48:01,665 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:01,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:01,665 INFO L82 PathProgramCache]: Analyzing trace with hash 565392544, now seen corresponding path program 30 times [2018-12-24 13:48:01,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:01,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:01,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:01,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:01,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:01,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:02,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:02,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:02,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:02,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:02,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:02,260 INFO L193 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-24 13:48:02,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:02,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:02,303 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:02,303 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:02,306 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:02,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:02,315 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:02,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:02,330 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:02,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:02,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:04,186 INFO L134 CoverageAnalysis]: Checked inductivity of 1365 backedges. 0 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:04,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:04,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 93 [2018-12-24 13:48:04,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:04,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-12-24 13:48:04,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-12-24 13:48:04,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-24 13:48:04,207 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 64 states. [2018-12-24 13:48:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:04,393 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-12-24 13:48:04,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-24 13:48:04,394 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 93 [2018-12-24 13:48:04,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:04,395 INFO L225 Difference]: With dead ends: 99 [2018-12-24 13:48:04,395 INFO L226 Difference]: Without dead ends: 98 [2018-12-24 13:48:04,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3782 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=4000, Invalid=4930, Unknown=0, NotChecked=0, Total=8930 [2018-12-24 13:48:04,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-12-24 13:48:04,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-12-24 13:48:04,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-24 13:48:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-12-24 13:48:04,399 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-12-24 13:48:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:04,399 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-12-24 13:48:04,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-12-24 13:48:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-12-24 13:48:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-24 13:48:04,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:04,400 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1] [2018-12-24 13:48:04,400 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:04,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:04,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1252415092, now seen corresponding path program 31 times [2018-12-24 13:48:04,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:04,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:04,401 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:04,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:04,402 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:05,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:05,112 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:05,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:05,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:05,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:05,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:05,113 INFO L193 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-24 13:48:05,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:05,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:05,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:05,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:05,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:05,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:05,187 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:06,123 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1457 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:07,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:07,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 96 [2018-12-24 13:48:07,435 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:07,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-12-24 13:48:07,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-12-24 13:48:07,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 13:48:07,437 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 66 states. [2018-12-24 13:48:07,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:07,645 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-12-24 13:48:07,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-12-24 13:48:07,646 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 96 [2018-12-24 13:48:07,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:07,647 INFO L225 Difference]: With dead ends: 102 [2018-12-24 13:48:07,647 INFO L226 Difference]: Without dead ends: 101 [2018-12-24 13:48:07,648 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4032 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4257, Invalid=5249, Unknown=0, NotChecked=0, Total=9506 [2018-12-24 13:48:07,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-24 13:48:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-12-24 13:48:07,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-24 13:48:07,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-12-24 13:48:07,652 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-12-24 13:48:07,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:07,653 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-12-24 13:48:07,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-12-24 13:48:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-12-24 13:48:07,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-24 13:48:07,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:07,654 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1] [2018-12-24 13:48:07,654 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:07,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:07,654 INFO L82 PathProgramCache]: Analyzing trace with hash -317063904, now seen corresponding path program 32 times [2018-12-24 13:48:07,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:07,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:07,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:07,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:08,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:08,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:08,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:08,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:08,321 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:08,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:08,321 INFO L193 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-24 13:48:08,330 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:08,330 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:08,404 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2018-12-24 13:48:08,404 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:08,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:08,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:08,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:08,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:08,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:09,401 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1552 backedges. 0 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:11,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:11,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 99 [2018-12-24 13:48:11,187 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:11,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-12-24 13:48:11,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-12-24 13:48:11,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-24 13:48:11,189 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 68 states. [2018-12-24 13:48:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:11,437 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-12-24 13:48:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-12-24 13:48:11,438 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 99 [2018-12-24 13:48:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:11,439 INFO L225 Difference]: With dead ends: 105 [2018-12-24 13:48:11,439 INFO L226 Difference]: Without dead ends: 104 [2018-12-24 13:48:11,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4290 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4522, Invalid=5578, Unknown=0, NotChecked=0, Total=10100 [2018-12-24 13:48:11,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-24 13:48:11,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-12-24 13:48:11,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-24 13:48:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-12-24 13:48:11,445 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-12-24 13:48:11,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:11,445 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-12-24 13:48:11,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-12-24 13:48:11,445 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-12-24 13:48:11,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-24 13:48:11,446 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:11,446 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1] [2018-12-24 13:48:11,446 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:11,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:11,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1017638644, now seen corresponding path program 33 times [2018-12-24 13:48:11,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:11,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:11,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:11,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:11,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:11,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:12,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:12,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:12,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:12,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:12,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:12,101 INFO L193 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-24 13:48:12,118 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:12,118 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:12,150 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:12,151 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:12,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:12,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:12,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:12,164 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:12,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:13,158 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:14,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1650 backedges. 0 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:14,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:14,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 102 [2018-12-24 13:48:14,690 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:14,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-24 13:48:14,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-24 13:48:14,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 13:48:14,692 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 70 states. [2018-12-24 13:48:14,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:14,970 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-12-24 13:48:14,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-12-24 13:48:14,971 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 102 [2018-12-24 13:48:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:14,972 INFO L225 Difference]: With dead ends: 108 [2018-12-24 13:48:14,972 INFO L226 Difference]: Without dead ends: 107 [2018-12-24 13:48:14,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4556 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4795, Invalid=5917, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 13:48:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-24 13:48:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-12-24 13:48:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-24 13:48:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-12-24 13:48:14,978 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-12-24 13:48:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:14,978 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-12-24 13:48:14,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-24 13:48:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-12-24 13:48:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-24 13:48:14,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:14,979 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1] [2018-12-24 13:48:14,979 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1701340576, now seen corresponding path program 34 times [2018-12-24 13:48:14,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:14,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:14,980 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:14,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:14,980 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:14,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:15,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:15,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:15,656 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:15,656 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:15,656 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:15,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:15,656 INFO L193 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-24 13:48:15,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:15,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:15,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:15,706 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:15,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:15,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:15,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:16,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1751 backedges. 0 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:18,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:18,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 105 [2018-12-24 13:48:18,244 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:18,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-12-24 13:48:18,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-12-24 13:48:18,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-24 13:48:18,246 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 72 states. [2018-12-24 13:48:18,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:18,448 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-12-24 13:48:18,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-24 13:48:18,448 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 105 [2018-12-24 13:48:18,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:18,449 INFO L225 Difference]: With dead ends: 111 [2018-12-24 13:48:18,449 INFO L226 Difference]: Without dead ends: 110 [2018-12-24 13:48:18,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=5076, Invalid=6266, Unknown=0, NotChecked=0, Total=11342 [2018-12-24 13:48:18,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-24 13:48:18,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-12-24 13:48:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-24 13:48:18,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-12-24 13:48:18,454 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-12-24 13:48:18,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:18,455 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-12-24 13:48:18,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-12-24 13:48:18,455 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-12-24 13:48:18,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-24 13:48:18,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:18,455 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1] [2018-12-24 13:48:18,455 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:18,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:18,456 INFO L82 PathProgramCache]: Analyzing trace with hash -271918964, now seen corresponding path program 35 times [2018-12-24 13:48:18,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:18,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:18,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:18,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:18,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:19,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:19,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:19,325 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:19,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:19,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:19,325 INFO L193 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-24 13:48:19,333 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:19,333 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:19,425 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2018-12-24 13:48:19,425 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:19,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:19,433 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:19,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:19,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:19,446 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:20,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:22,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:22,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 108 [2018-12-24 13:48:22,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:22,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-12-24 13:48:22,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-12-24 13:48:22,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 13:48:22,425 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 74 states. [2018-12-24 13:48:22,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:22,772 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-12-24 13:48:22,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-12-24 13:48:22,772 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 108 [2018-12-24 13:48:22,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:22,774 INFO L225 Difference]: With dead ends: 114 [2018-12-24 13:48:22,774 INFO L226 Difference]: Without dead ends: 113 [2018-12-24 13:48:22,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5112 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5365, Invalid=6625, Unknown=0, NotChecked=0, Total=11990 [2018-12-24 13:48:22,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-12-24 13:48:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-12-24 13:48:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-12-24 13:48:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-12-24 13:48:22,780 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-12-24 13:48:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:22,780 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-12-24 13:48:22,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-12-24 13:48:22,780 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-12-24 13:48:22,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-24 13:48:22,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:22,781 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1] [2018-12-24 13:48:22,781 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:22,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:22,782 INFO L82 PathProgramCache]: Analyzing trace with hash -429494752, now seen corresponding path program 36 times [2018-12-24 13:48:22,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:22,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:22,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:22,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:22,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:23,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:23,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:23,525 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:23,525 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:23,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:23,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:23,526 INFO L193 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-24 13:48:23,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:23,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:23,569 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:23,569 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:23,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:23,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:23,577 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:23,592 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:23,592 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:24,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:26,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1962 backedges. 0 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:26,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:26,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 111 [2018-12-24 13:48:26,581 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:26,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-12-24 13:48:26,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-12-24 13:48:26,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-24 13:48:26,583 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 76 states. [2018-12-24 13:48:26,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:26,824 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-12-24 13:48:26,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-12-24 13:48:26,824 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 111 [2018-12-24 13:48:26,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:26,826 INFO L225 Difference]: With dead ends: 117 [2018-12-24 13:48:26,826 INFO L226 Difference]: Without dead ends: 116 [2018-12-24 13:48:26,827 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5402 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5662, Invalid=6994, Unknown=0, NotChecked=0, Total=12656 [2018-12-24 13:48:26,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-12-24 13:48:26,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-12-24 13:48:26,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-12-24 13:48:26,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-12-24 13:48:26,831 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-12-24 13:48:26,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:26,832 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-12-24 13:48:26,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-12-24 13:48:26,832 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-12-24 13:48:26,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-24 13:48:26,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:26,833 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1] [2018-12-24 13:48:26,833 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:26,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:26,833 INFO L82 PathProgramCache]: Analyzing trace with hash -370540532, now seen corresponding path program 37 times [2018-12-24 13:48:26,834 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:26,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:26,835 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:26,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:26,836 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:27,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:27,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:27,615 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:27,615 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:27,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:27,615 INFO L193 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-24 13:48:27,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:27,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:27,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:27,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:27,677 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:27,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:27,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:28,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2072 backedges. 0 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:30,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:30,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 114 [2018-12-24 13:48:30,510 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:30,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-12-24 13:48:30,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-12-24 13:48:30,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 13:48:30,512 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 78 states. [2018-12-24 13:48:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:30,851 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-12-24 13:48:30,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-12-24 13:48:30,852 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 114 [2018-12-24 13:48:30,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:30,853 INFO L225 Difference]: With dead ends: 120 [2018-12-24 13:48:30,853 INFO L226 Difference]: Without dead ends: 119 [2018-12-24 13:48:30,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5700 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5967, Invalid=7373, Unknown=0, NotChecked=0, Total=13340 [2018-12-24 13:48:30,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-12-24 13:48:30,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-12-24 13:48:30,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-24 13:48:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-12-24 13:48:30,858 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-12-24 13:48:30,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:30,858 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-12-24 13:48:30,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-12-24 13:48:30,858 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-12-24 13:48:30,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-24 13:48:30,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:30,859 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1] [2018-12-24 13:48:30,859 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:30,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:30,859 INFO L82 PathProgramCache]: Analyzing trace with hash -706996576, now seen corresponding path program 38 times [2018-12-24 13:48:30,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:30,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:30,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:30,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:30,860 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:30,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:32,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:32,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:32,059 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:32,059 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:32,059 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:32,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:32,059 INFO L193 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-24 13:48:32,068 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:32,068 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:32,170 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2018-12-24 13:48:32,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:32,175 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:32,196 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:32,197 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:32,200 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:32,201 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:33,476 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2185 backedges. 0 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:35,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:35,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 117 [2018-12-24 13:48:35,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:35,683 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-12-24 13:48:35,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-12-24 13:48:35,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-24 13:48:35,684 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 80 states. [2018-12-24 13:48:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:36,017 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-12-24 13:48:36,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-12-24 13:48:36,017 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 117 [2018-12-24 13:48:36,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:36,018 INFO L225 Difference]: With dead ends: 123 [2018-12-24 13:48:36,018 INFO L226 Difference]: Without dead ends: 122 [2018-12-24 13:48:36,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6006 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6280, Invalid=7762, Unknown=0, NotChecked=0, Total=14042 [2018-12-24 13:48:36,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-12-24 13:48:36,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-12-24 13:48:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-12-24 13:48:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-12-24 13:48:36,024 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-12-24 13:48:36,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:36,024 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-12-24 13:48:36,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-12-24 13:48:36,024 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-12-24 13:48:36,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-12-24 13:48:36,025 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:36,025 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1] [2018-12-24 13:48:36,025 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:36,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:36,025 INFO L82 PathProgramCache]: Analyzing trace with hash 384665484, now seen corresponding path program 39 times [2018-12-24 13:48:36,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:36,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:36,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:36,026 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:37,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:37,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:37,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:37,360 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:37,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:37,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:37,361 INFO L193 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-24 13:48:37,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:37,369 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:37,409 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:37,409 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:37,414 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:37,430 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:37,431 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:37,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:37,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:39,650 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:39,651 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:41,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 0 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:42,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:42,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 120 [2018-12-24 13:48:42,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:42,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-12-24 13:48:42,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-12-24 13:48:42,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 13:48:42,017 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 82 states. [2018-12-24 13:48:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:42,327 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-12-24 13:48:42,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-12-24 13:48:42,327 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 120 [2018-12-24 13:48:42,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:42,328 INFO L225 Difference]: With dead ends: 126 [2018-12-24 13:48:42,328 INFO L226 Difference]: Without dead ends: 125 [2018-12-24 13:48:42,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 278 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6320 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6601, Invalid=8161, Unknown=0, NotChecked=0, Total=14762 [2018-12-24 13:48:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-12-24 13:48:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-12-24 13:48:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-12-24 13:48:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-12-24 13:48:42,333 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2018-12-24 13:48:42,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:42,333 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-12-24 13:48:42,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-12-24 13:48:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-12-24 13:48:42,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-12-24 13:48:42,333 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:42,334 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1] [2018-12-24 13:48:42,334 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:42,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:42,334 INFO L82 PathProgramCache]: Analyzing trace with hash 596729632, now seen corresponding path program 40 times [2018-12-24 13:48:42,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:42,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:42,335 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:42,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:42,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:43,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:43,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:43,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:43,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:43,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:43,846 INFO L193 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-24 13:48:43,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:43,855 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:48:43,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:43,898 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:43,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:43,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:43,913 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:43,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:44,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:44,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:47,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2420 backedges. 0 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:47,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:47,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 123 [2018-12-24 13:48:47,276 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:47,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-12-24 13:48:47,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-12-24 13:48:47,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-24 13:48:47,279 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 84 states. [2018-12-24 13:48:47,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:47,650 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-12-24 13:48:47,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-12-24 13:48:47,650 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 123 [2018-12-24 13:48:47,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:47,651 INFO L225 Difference]: With dead ends: 129 [2018-12-24 13:48:47,652 INFO L226 Difference]: Without dead ends: 128 [2018-12-24 13:48:47,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6642 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6930, Invalid=8570, Unknown=0, NotChecked=0, Total=15500 [2018-12-24 13:48:47,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-12-24 13:48:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-12-24 13:48:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-12-24 13:48:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-12-24 13:48:47,660 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2018-12-24 13:48:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:47,661 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-12-24 13:48:47,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-12-24 13:48:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-12-24 13:48:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-12-24 13:48:47,661 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:47,662 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1] [2018-12-24 13:48:47,662 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:47,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:47,662 INFO L82 PathProgramCache]: Analyzing trace with hash 302870284, now seen corresponding path program 41 times [2018-12-24 13:48:47,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:47,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:47,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:48:47,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:47,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:49,593 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:49,593 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:49,593 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:49,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:49,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:49,594 INFO L193 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-24 13:48:49,602 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:48:49,603 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:48:49,737 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2018-12-24 13:48:49,737 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:49,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:49,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:49,757 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:49,765 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:49,765 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:50,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:50,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:53,336 INFO L134 CoverageAnalysis]: Checked inductivity of 2542 backedges. 0 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:53,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:53,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 126 [2018-12-24 13:48:53,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:53,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-12-24 13:48:53,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-12-24 13:48:53,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 13:48:53,357 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 86 states. [2018-12-24 13:48:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:48:54,096 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-12-24 13:48:54,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-12-24 13:48:54,097 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 126 [2018-12-24 13:48:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:48:54,099 INFO L225 Difference]: With dead ends: 132 [2018-12-24 13:48:54,099 INFO L226 Difference]: Without dead ends: 131 [2018-12-24 13:48:54,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6972 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7267, Invalid=8989, Unknown=0, NotChecked=0, Total=16256 [2018-12-24 13:48:54,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-12-24 13:48:54,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-12-24 13:48:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-24 13:48:54,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-12-24 13:48:54,105 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2018-12-24 13:48:54,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:48:54,105 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-12-24 13:48:54,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-12-24 13:48:54,105 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-12-24 13:48:54,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-24 13:48:54,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:48:54,106 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1] [2018-12-24 13:48:54,106 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:48:54,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:48:54,107 INFO L82 PathProgramCache]: Analyzing trace with hash -917616736, now seen corresponding path program 42 times [2018-12-24 13:48:54,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:48:54,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:54,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:48:54,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:48:54,108 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:48:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:48:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:55,449 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:55,449 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:48:55,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:48:55,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:48:55,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:48:55,450 INFO L193 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-24 13:48:55,461 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:48:55,461 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:48:55,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:48:55,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:48:55,509 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:48:55,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:48:55,512 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:48:55,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:48:55,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:48:56,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:56,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:48:59,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2667 backedges. 0 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:48:59,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:48:59,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 129 [2018-12-24 13:48:59,281 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:48:59,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-12-24 13:48:59,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-12-24 13:48:59,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-24 13:48:59,284 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 88 states. [2018-12-24 13:49:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:00,141 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-12-24 13:49:00,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-12-24 13:49:00,142 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 129 [2018-12-24 13:49:00,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:00,143 INFO L225 Difference]: With dead ends: 135 [2018-12-24 13:49:00,143 INFO L226 Difference]: Without dead ends: 134 [2018-12-24 13:49:00,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7310 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7612, Invalid=9418, Unknown=0, NotChecked=0, Total=17030 [2018-12-24 13:49:00,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-12-24 13:49:00,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-12-24 13:49:00,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-24 13:49:00,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-12-24 13:49:00,149 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2018-12-24 13:49:00,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:00,149 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-12-24 13:49:00,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-12-24 13:49:00,149 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-12-24 13:49:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-24 13:49:00,150 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:00,150 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1] [2018-12-24 13:49:00,150 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:00,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:00,151 INFO L82 PathProgramCache]: Analyzing trace with hash 746698380, now seen corresponding path program 43 times [2018-12-24 13:49:00,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:00,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:00,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:00,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:00,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:01,669 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:01,669 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:01,669 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:01,669 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:01,670 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:01,670 INFO L193 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-24 13:49:01,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:01,678 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:01,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:01,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:01,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:01,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:01,740 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:03,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:03,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2795 backedges. 0 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:05,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:05,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 132 [2018-12-24 13:49:05,537 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:05,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-12-24 13:49:05,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-12-24 13:49:05,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 13:49:05,540 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 90 states. [2018-12-24 13:49:05,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:05,795 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-12-24 13:49:05,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-12-24 13:49:05,795 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 132 [2018-12-24 13:49:05,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:05,796 INFO L225 Difference]: With dead ends: 138 [2018-12-24 13:49:05,797 INFO L226 Difference]: Without dead ends: 137 [2018-12-24 13:49:05,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7656 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7965, Invalid=9857, Unknown=0, NotChecked=0, Total=17822 [2018-12-24 13:49:05,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-12-24 13:49:05,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-12-24 13:49:05,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-24 13:49:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-12-24 13:49:05,802 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2018-12-24 13:49:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:05,802 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-12-24 13:49:05,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-12-24 13:49:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-12-24 13:49:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-12-24 13:49:05,803 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:05,803 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1] [2018-12-24 13:49:05,803 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:05,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:05,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1255854112, now seen corresponding path program 44 times [2018-12-24 13:49:05,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:05,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:05,804 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:05,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:05,804 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:06,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:06,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:06,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:06,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:06,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:06,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:06,890 INFO L193 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-24 13:49:06,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:06,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:07,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2018-12-24 13:49:07,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:07,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:07,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:07,036 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:07,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:07,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:08,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:08,435 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:10,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:10,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 135 [2018-12-24 13:49:10,971 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:10,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-12-24 13:49:10,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-12-24 13:49:10,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-24 13:49:10,973 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 92 states. [2018-12-24 13:49:11,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:11,260 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-12-24 13:49:11,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-12-24 13:49:11,260 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 135 [2018-12-24 13:49:11,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:11,261 INFO L225 Difference]: With dead ends: 141 [2018-12-24 13:49:11,261 INFO L226 Difference]: Without dead ends: 140 [2018-12-24 13:49:11,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8010 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=8326, Invalid=10306, Unknown=0, NotChecked=0, Total=18632 [2018-12-24 13:49:11,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-24 13:49:11,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-12-24 13:49:11,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-24 13:49:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-12-24 13:49:11,268 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2018-12-24 13:49:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:11,268 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-12-24 13:49:11,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-12-24 13:49:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-12-24 13:49:11,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-12-24 13:49:11,269 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:11,269 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1] [2018-12-24 13:49:11,270 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:11,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:11,270 INFO L82 PathProgramCache]: Analyzing trace with hash -310223348, now seen corresponding path program 45 times [2018-12-24 13:49:11,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:11,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:11,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:11,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:11,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:13,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:13,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:13,193 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:13,194 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:13,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:13,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:13,194 INFO L193 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-24 13:49:13,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:13,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:13,247 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:13,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:13,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:13,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:13,268 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:13,292 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:13,292 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:14,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:14,601 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:17,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 0 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:17,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:17,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 138 [2018-12-24 13:49:17,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:17,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-12-24 13:49:17,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-12-24 13:49:17,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 13:49:17,221 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 94 states. [2018-12-24 13:49:17,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:17,626 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-12-24 13:49:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-12-24 13:49:17,626 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 138 [2018-12-24 13:49:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:17,627 INFO L225 Difference]: With dead ends: 144 [2018-12-24 13:49:17,627 INFO L226 Difference]: Without dead ends: 143 [2018-12-24 13:49:17,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8372 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8695, Invalid=10765, Unknown=0, NotChecked=0, Total=19460 [2018-12-24 13:49:17,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-24 13:49:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-12-24 13:49:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-12-24 13:49:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-12-24 13:49:17,634 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2018-12-24 13:49:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:17,634 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-12-24 13:49:17,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-12-24 13:49:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-12-24 13:49:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-12-24 13:49:17,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:17,635 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1] [2018-12-24 13:49:17,636 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:17,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:17,636 INFO L82 PathProgramCache]: Analyzing trace with hash 905902240, now seen corresponding path program 46 times [2018-12-24 13:49:17,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:17,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:17,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:17,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:17,637 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:17,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:19,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:19,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:19,245 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:19,245 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:19,245 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:19,245 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:19,245 INFO L193 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-24 13:49:19,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:19,254 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:19,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:19,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:19,302 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:19,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:19,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:20,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:20,637 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:24,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3197 backedges. 0 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:24,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:24,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 141 [2018-12-24 13:49:24,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:24,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-12-24 13:49:24,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-12-24 13:49:24,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-24 13:49:24,053 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 96 states. [2018-12-24 13:49:24,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:24,337 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-12-24 13:49:24,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-12-24 13:49:24,338 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 141 [2018-12-24 13:49:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:24,339 INFO L225 Difference]: With dead ends: 147 [2018-12-24 13:49:24,339 INFO L226 Difference]: Without dead ends: 146 [2018-12-24 13:49:24,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8742 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9072, Invalid=11234, Unknown=0, NotChecked=0, Total=20306 [2018-12-24 13:49:24,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-12-24 13:49:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-12-24 13:49:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-12-24 13:49:24,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-12-24 13:49:24,343 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2018-12-24 13:49:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:24,343 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-12-24 13:49:24,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-12-24 13:49:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-12-24 13:49:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-12-24 13:49:24,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:24,344 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1] [2018-12-24 13:49:24,344 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:24,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1840814708, now seen corresponding path program 47 times [2018-12-24 13:49:24,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:24,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:24,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:24,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:24,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:25,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:25,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:25,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:25,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:25,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:25,730 INFO L193 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-24 13:49:25,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:25,739 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:25,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2018-12-24 13:49:25,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:25,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:25,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:25,922 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:26,013 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:26,013 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:27,377 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:30,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3337 backedges. 0 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:30,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:30,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 144 [2018-12-24 13:49:30,414 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:30,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-12-24 13:49:30,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-12-24 13:49:30,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 13:49:30,416 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 98 states. [2018-12-24 13:49:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:30,762 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-12-24 13:49:30,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-12-24 13:49:30,762 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 144 [2018-12-24 13:49:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:30,763 INFO L225 Difference]: With dead ends: 150 [2018-12-24 13:49:30,763 INFO L226 Difference]: Without dead ends: 149 [2018-12-24 13:49:30,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9120 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=9457, Invalid=11713, Unknown=0, NotChecked=0, Total=21170 [2018-12-24 13:49:30,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-24 13:49:30,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-12-24 13:49:30,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-12-24 13:49:30,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-12-24 13:49:30,769 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2018-12-24 13:49:30,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:30,769 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-12-24 13:49:30,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-12-24 13:49:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-12-24 13:49:30,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-12-24 13:49:30,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:30,770 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1] [2018-12-24 13:49:30,770 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:30,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:30,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1568489184, now seen corresponding path program 48 times [2018-12-24 13:49:30,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:30,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:30,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:30,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:30,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:31,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:31,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:31,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:31,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:31,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:31,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:31,965 INFO L193 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-24 13:49:31,973 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:31,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:32,024 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:32,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:32,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:32,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:32,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:32,040 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:32,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:33,745 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:33,746 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:36,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3480 backedges. 0 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:36,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:36,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 147 [2018-12-24 13:49:36,814 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:36,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-12-24 13:49:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-12-24 13:49:36,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-24 13:49:36,816 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 100 states. [2018-12-24 13:49:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:37,206 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-12-24 13:49:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-12-24 13:49:37,207 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 147 [2018-12-24 13:49:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:37,207 INFO L225 Difference]: With dead ends: 153 [2018-12-24 13:49:37,207 INFO L226 Difference]: Without dead ends: 152 [2018-12-24 13:49:37,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9506 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9850, Invalid=12202, Unknown=0, NotChecked=0, Total=22052 [2018-12-24 13:49:37,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-24 13:49:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-12-24 13:49:37,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-24 13:49:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-12-24 13:49:37,213 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2018-12-24 13:49:37,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:37,213 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-12-24 13:49:37,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-12-24 13:49:37,214 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-12-24 13:49:37,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-12-24 13:49:37,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:37,214 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1] [2018-12-24 13:49:37,214 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:37,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:37,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1912025844, now seen corresponding path program 49 times [2018-12-24 13:49:37,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:37,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:37,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:37,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:37,216 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:38,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:38,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:38,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:38,784 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:38,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:38,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:38,784 INFO L193 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-24 13:49:38,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:38,796 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:49:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:38,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:38,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:38,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:38,957 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:38,958 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:40,496 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:43,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3626 backedges. 0 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:43,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:43,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 150 [2018-12-24 13:49:43,910 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:43,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-12-24 13:49:43,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-12-24 13:49:43,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 13:49:43,913 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 102 states. [2018-12-24 13:49:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:44,260 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-12-24 13:49:44,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-12-24 13:49:44,261 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 150 [2018-12-24 13:49:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:44,262 INFO L225 Difference]: With dead ends: 156 [2018-12-24 13:49:44,262 INFO L226 Difference]: Without dead ends: 155 [2018-12-24 13:49:44,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 198 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9900 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10251, Invalid=12701, Unknown=0, NotChecked=0, Total=22952 [2018-12-24 13:49:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-12-24 13:49:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-12-24 13:49:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-12-24 13:49:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-12-24 13:49:44,272 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2018-12-24 13:49:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:44,272 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-12-24 13:49:44,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-12-24 13:49:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-12-24 13:49:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-12-24 13:49:44,273 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:44,273 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1] [2018-12-24 13:49:44,273 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:44,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:44,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1305597536, now seen corresponding path program 50 times [2018-12-24 13:49:44,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:44,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:44,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:44,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:44,275 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:44,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:45,697 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:45,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:45,698 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:45,698 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:45,698 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:45,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:45,698 INFO L193 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-24 13:49:45,709 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:49:45,709 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:49:45,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2018-12-24 13:49:45,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:45,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:45,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:45,874 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:45,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:45,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:47,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 3775 backedges. 0 proven. 3775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:50,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:50,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 151 [2018-12-24 13:49:50,898 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:50,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-12-24 13:49:50,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-12-24 13:49:50,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2018-12-24 13:49:50,901 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 104 states. [2018-12-24 13:49:51,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:51,242 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-12-24 13:49:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-12-24 13:49:51,242 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 153 [2018-12-24 13:49:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:51,244 INFO L225 Difference]: With dead ends: 159 [2018-12-24 13:49:51,244 INFO L226 Difference]: Without dead ends: 158 [2018-12-24 13:49:51,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10397 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=10353, Invalid=12903, Unknown=0, NotChecked=0, Total=23256 [2018-12-24 13:49:51,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-12-24 13:49:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-12-24 13:49:51,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-12-24 13:49:51,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-12-24 13:49:51,249 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2018-12-24 13:49:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:51,249 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-12-24 13:49:51,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-12-24 13:49:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-12-24 13:49:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-12-24 13:49:51,250 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:51,250 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 51, 1, 1] [2018-12-24 13:49:51,251 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash 167679116, now seen corresponding path program 51 times [2018-12-24 13:49:51,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:51,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:51,252 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:51,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:51,252 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:52,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:52,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:52,694 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:52,694 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:52,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:52,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:52,694 INFO L193 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-24 13:49:52,703 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:49:52,703 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:49:52,768 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:49:52,768 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:49:52,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:49:52,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:49:52,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:49:52,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:49:52,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:49:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:54,922 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:49:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3927 backedges. 0 proven. 3927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:58,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:49:58,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 152 [2018-12-24 13:49:58,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:49:58,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-12-24 13:49:58,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-12-24 13:49:58,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 13:49:58,113 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 106 states. [2018-12-24 13:49:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:49:58,567 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-12-24 13:49:58,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-12-24 13:49:58,568 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 156 [2018-12-24 13:49:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:49:58,569 INFO L225 Difference]: With dead ends: 162 [2018-12-24 13:49:58,569 INFO L226 Difference]: Without dead ends: 161 [2018-12-24 13:49:58,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 206 SyntacticMatches, 4 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10894 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10455, Invalid=13107, Unknown=0, NotChecked=0, Total=23562 [2018-12-24 13:49:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-24 13:49:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-12-24 13:49:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-24 13:49:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-12-24 13:49:58,575 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2018-12-24 13:49:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:49:58,575 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-12-24 13:49:58,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-12-24 13:49:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-12-24 13:49:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-12-24 13:49:58,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:49:58,576 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 52, 1, 1] [2018-12-24 13:49:58,576 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:49:58,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:49:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash 281621024, now seen corresponding path program 52 times [2018-12-24 13:49:58,577 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:49:58,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:58,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:49:58,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:49:58,578 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:49:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:49:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:49:59,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:59,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:49:59,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:49:59,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:49:59,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:49:59,965 INFO L193 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-24 13:49:59,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:49:59,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:00,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:00,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:00,033 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:00,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:00,043 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:01,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:01,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:05,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4082 backedges. 0 proven. 4082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:05,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:05,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 153 [2018-12-24 13:50:05,227 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:05,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-12-24 13:50:05,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-12-24 13:50:05,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2018-12-24 13:50:05,229 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 108 states. [2018-12-24 13:50:05,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:05,644 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-12-24 13:50:05,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-12-24 13:50:05,644 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 159 [2018-12-24 13:50:05,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:05,645 INFO L225 Difference]: With dead ends: 165 [2018-12-24 13:50:05,645 INFO L226 Difference]: Without dead ends: 164 [2018-12-24 13:50:05,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 210 SyntacticMatches, 6 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11391 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10557, Invalid=13313, Unknown=0, NotChecked=0, Total=23870 [2018-12-24 13:50:05,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-24 13:50:05,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-12-24 13:50:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-12-24 13:50:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-12-24 13:50:05,650 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2018-12-24 13:50:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:05,651 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-12-24 13:50:05,651 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-12-24 13:50:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-12-24 13:50:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-12-24 13:50:05,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:05,652 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 53, 1, 1] [2018-12-24 13:50:05,652 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:05,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:05,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1700838412, now seen corresponding path program 53 times [2018-12-24 13:50:05,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:05,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:05,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:05,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:05,654 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:07,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:07,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:07,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:07,087 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:07,087 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:07,087 INFO L193 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-24 13:50:07,096 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:07,096 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:07,269 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2018-12-24 13:50:07,270 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:07,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:07,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:07,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:07,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:07,287 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:09,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:09,629 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:13,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4240 backedges. 0 proven. 4240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:13,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:13,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 154 [2018-12-24 13:50:13,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:13,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-12-24 13:50:13,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-12-24 13:50:13,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 13:50:13,026 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 110 states. [2018-12-24 13:50:13,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:13,430 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-12-24 13:50:13,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-12-24 13:50:13,430 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 162 [2018-12-24 13:50:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:13,432 INFO L225 Difference]: With dead ends: 168 [2018-12-24 13:50:13,432 INFO L226 Difference]: Without dead ends: 167 [2018-12-24 13:50:13,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 376 GetRequests, 214 SyntacticMatches, 8 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11888 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10659, Invalid=13521, Unknown=0, NotChecked=0, Total=24180 [2018-12-24 13:50:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-12-24 13:50:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-12-24 13:50:13,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-12-24 13:50:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-12-24 13:50:13,436 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2018-12-24 13:50:13,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:13,436 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-12-24 13:50:13,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-12-24 13:50:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-12-24 13:50:13,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-12-24 13:50:13,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:13,437 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 54, 1, 1] [2018-12-24 13:50:13,437 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:13,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:13,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1947982496, now seen corresponding path program 54 times [2018-12-24 13:50:13,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:13,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:13,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:13,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:13,439 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:13,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:15,065 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:15,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:15,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:15,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:15,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:15,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:15,066 INFO L193 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-24 13:50:15,076 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:15,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:15,130 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:15,130 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:15,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:15,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:15,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:15,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:15,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:17,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:17,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 4401 backedges. 0 proven. 4401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:20,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:20,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 155 [2018-12-24 13:50:20,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:20,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-12-24 13:50:20,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-12-24 13:50:20,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2018-12-24 13:50:20,624 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 112 states. [2018-12-24 13:50:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:20,989 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-12-24 13:50:20,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-12-24 13:50:20,989 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 165 [2018-12-24 13:50:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:20,990 INFO L225 Difference]: With dead ends: 171 [2018-12-24 13:50:20,990 INFO L226 Difference]: Without dead ends: 170 [2018-12-24 13:50:20,991 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 218 SyntacticMatches, 10 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12385 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10761, Invalid=13731, Unknown=0, NotChecked=0, Total=24492 [2018-12-24 13:50:20,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-12-24 13:50:20,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-12-24 13:50:20,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-12-24 13:50:20,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-12-24 13:50:20,994 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2018-12-24 13:50:20,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:20,994 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-12-24 13:50:20,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-12-24 13:50:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-12-24 13:50:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-12-24 13:50:20,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:20,995 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 55, 1, 1] [2018-12-24 13:50:20,995 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:20,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:20,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1251523700, now seen corresponding path program 55 times [2018-12-24 13:50:20,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:20,996 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:20,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:20,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:22,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:22,569 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:22,569 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:22,569 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:22,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:22,569 INFO L193 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-24 13:50:22,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:22,578 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:22,633 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:22,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:22,636 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:22,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:22,647 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:24,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:28,007 INFO L134 CoverageAnalysis]: Checked inductivity of 4565 backedges. 0 proven. 4565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:28,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:28,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 156 [2018-12-24 13:50:28,026 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:28,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-12-24 13:50:28,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-12-24 13:50:28,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 13:50:28,028 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 114 states. [2018-12-24 13:50:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:28,392 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-12-24 13:50:28,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-12-24 13:50:28,393 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 168 [2018-12-24 13:50:28,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:28,394 INFO L225 Difference]: With dead ends: 174 [2018-12-24 13:50:28,394 INFO L226 Difference]: Without dead ends: 173 [2018-12-24 13:50:28,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 390 GetRequests, 222 SyntacticMatches, 12 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12882 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10863, Invalid=13943, Unknown=0, NotChecked=0, Total=24806 [2018-12-24 13:50:28,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-24 13:50:28,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-12-24 13:50:28,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-12-24 13:50:28,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-12-24 13:50:28,398 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2018-12-24 13:50:28,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:28,398 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-12-24 13:50:28,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-12-24 13:50:28,398 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-12-24 13:50:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-12-24 13:50:28,399 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:28,399 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 56, 1, 1] [2018-12-24 13:50:28,399 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash 468591392, now seen corresponding path program 56 times [2018-12-24 13:50:28,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:28,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:28,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:28,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:28,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:30,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:30,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:30,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:30,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:30,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:30,476 INFO L193 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-24 13:50:30,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:30,485 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:30,678 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2018-12-24 13:50:30,678 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:30,684 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:30,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:30,687 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:30,693 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:30,693 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:32,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:32,590 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:36,347 INFO L134 CoverageAnalysis]: Checked inductivity of 4732 backedges. 0 proven. 4732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:36,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:36,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 157 [2018-12-24 13:50:36,367 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:36,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-12-24 13:50:36,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-12-24 13:50:36,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2018-12-24 13:50:36,369 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 116 states. [2018-12-24 13:50:36,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:36,769 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-12-24 13:50:36,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-12-24 13:50:36,770 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 171 [2018-12-24 13:50:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:36,771 INFO L225 Difference]: With dead ends: 177 [2018-12-24 13:50:36,771 INFO L226 Difference]: Without dead ends: 176 [2018-12-24 13:50:36,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 226 SyntacticMatches, 14 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13379 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10965, Invalid=14157, Unknown=0, NotChecked=0, Total=25122 [2018-12-24 13:50:36,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-12-24 13:50:36,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-12-24 13:50:36,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-12-24 13:50:36,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-12-24 13:50:36,776 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2018-12-24 13:50:36,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:36,776 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-12-24 13:50:36,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-12-24 13:50:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-12-24 13:50:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-12-24 13:50:36,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:36,777 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 57, 1, 1] [2018-12-24 13:50:36,778 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:36,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:36,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1162488588, now seen corresponding path program 57 times [2018-12-24 13:50:36,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:36,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:36,779 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:36,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:36,779 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:38,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:38,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:38,420 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:38,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:38,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:38,421 INFO L193 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-24 13:50:38,429 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:50:38,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:50:38,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:50:38,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:38,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:38,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:38,493 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:38,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:38,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:40,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:40,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:44,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4902 backedges. 0 proven. 4902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:44,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:44,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 158 [2018-12-24 13:50:44,235 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:44,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-12-24 13:50:44,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-12-24 13:50:44,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 13:50:44,238 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 118 states. [2018-12-24 13:50:44,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:44,755 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-12-24 13:50:44,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-12-24 13:50:44,755 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 174 [2018-12-24 13:50:44,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:44,756 INFO L225 Difference]: With dead ends: 180 [2018-12-24 13:50:44,756 INFO L226 Difference]: Without dead ends: 179 [2018-12-24 13:50:44,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 230 SyntacticMatches, 16 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13876 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11067, Invalid=14373, Unknown=0, NotChecked=0, Total=25440 [2018-12-24 13:50:44,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-24 13:50:44,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-12-24 13:50:44,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-12-24 13:50:44,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-12-24 13:50:44,762 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2018-12-24 13:50:44,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:44,763 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-12-24 13:50:44,763 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-12-24 13:50:44,763 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-12-24 13:50:44,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-12-24 13:50:44,764 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:44,764 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 58, 1, 1] [2018-12-24 13:50:44,764 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:44,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:44,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258976, now seen corresponding path program 58 times [2018-12-24 13:50:44,765 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:44,765 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:50:44,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:44,766 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:44,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:46,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:46,524 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:46,524 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:46,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:46,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:46,525 INFO L193 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-24 13:50:46,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:46,537 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:50:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:46,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:46,595 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:46,595 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:46,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:46,605 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:48,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:50:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5075 backedges. 0 proven. 5075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:52,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:50:52,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 159 [2018-12-24 13:50:52,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:50:52,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-12-24 13:50:52,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-12-24 13:50:52,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2018-12-24 13:50:52,402 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 120 states. [2018-12-24 13:50:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:50:52,813 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-12-24 13:50:52,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-12-24 13:50:52,813 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 177 [2018-12-24 13:50:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:50:52,814 INFO L225 Difference]: With dead ends: 183 [2018-12-24 13:50:52,814 INFO L226 Difference]: Without dead ends: 182 [2018-12-24 13:50:52,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 234 SyntacticMatches, 18 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14373 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11169, Invalid=14591, Unknown=0, NotChecked=0, Total=25760 [2018-12-24 13:50:52,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-24 13:50:52,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-12-24 13:50:52,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-12-24 13:50:52,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-12-24 13:50:52,821 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2018-12-24 13:50:52,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:50:52,821 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-12-24 13:50:52,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-12-24 13:50:52,821 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-12-24 13:50:52,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-12-24 13:50:52,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:50:52,822 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 59, 1, 1] [2018-12-24 13:50:52,822 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:50:52,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:50:52,823 INFO L82 PathProgramCache]: Analyzing trace with hash 373387916, now seen corresponding path program 59 times [2018-12-24 13:50:52,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:50:52,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:52,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:50:52,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:50:52,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:50:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:50:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:54,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:54,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:50:54,528 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:50:54,528 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:50:54,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:50:54,528 INFO L193 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-24 13:50:54,538 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:50:54,538 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:50:54,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2018-12-24 13:50:54,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:50:54,941 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:50:54,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:50:54,945 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:50:54,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:50:54,955 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:50:57,058 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:50:57,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:00,869 INFO L134 CoverageAnalysis]: Checked inductivity of 5251 backedges. 0 proven. 5251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:00,889 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:00,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 160 [2018-12-24 13:51:00,890 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:00,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-12-24 13:51:00,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-12-24 13:51:00,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 13:51:00,892 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 122 states. [2018-12-24 13:51:01,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:01,284 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-12-24 13:51:01,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-12-24 13:51:01,284 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 180 [2018-12-24 13:51:01,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:01,286 INFO L225 Difference]: With dead ends: 186 [2018-12-24 13:51:01,286 INFO L226 Difference]: Without dead ends: 185 [2018-12-24 13:51:01,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 238 SyntacticMatches, 20 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14870 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11271, Invalid=14811, Unknown=0, NotChecked=0, Total=26082 [2018-12-24 13:51:01,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-12-24 13:51:01,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-12-24 13:51:01,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-24 13:51:01,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-12-24 13:51:01,292 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2018-12-24 13:51:01,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:01,292 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-12-24 13:51:01,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-12-24 13:51:01,292 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-12-24 13:51:01,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-12-24 13:51:01,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:01,293 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 60, 1, 1] [2018-12-24 13:51:01,293 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:01,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:01,294 INFO L82 PathProgramCache]: Analyzing trace with hash -365849568, now seen corresponding path program 60 times [2018-12-24 13:51:01,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:01,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:01,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:01,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:01,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:03,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:03,040 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:03,040 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:03,040 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:03,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:03,040 INFO L193 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-24 13:51:03,048 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:51:03,048 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:51:03,109 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:51:03,109 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:03,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:03,156 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:03,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:03,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:03,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:05,554 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:05,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:09,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5430 backedges. 0 proven. 5430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:09,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:09,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 161 [2018-12-24 13:51:09,137 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:09,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-12-24 13:51:09,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-12-24 13:51:09,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2018-12-24 13:51:09,139 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 124 states. [2018-12-24 13:51:09,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:09,574 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-12-24 13:51:09,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-12-24 13:51:09,574 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 183 [2018-12-24 13:51:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:09,575 INFO L225 Difference]: With dead ends: 189 [2018-12-24 13:51:09,575 INFO L226 Difference]: Without dead ends: 188 [2018-12-24 13:51:09,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 242 SyntacticMatches, 22 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15367 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11373, Invalid=15033, Unknown=0, NotChecked=0, Total=26406 [2018-12-24 13:51:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-12-24 13:51:09,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2018-12-24 13:51:09,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-12-24 13:51:09,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-12-24 13:51:09,580 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2018-12-24 13:51:09,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:09,580 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-12-24 13:51:09,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-12-24 13:51:09,580 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-12-24 13:51:09,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-12-24 13:51:09,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:09,581 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 61, 1, 1] [2018-12-24 13:51:09,581 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:09,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1602558476, now seen corresponding path program 61 times [2018-12-24 13:51:09,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:09,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:09,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:09,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:09,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:11,774 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:11,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:11,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:11,775 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:11,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:11,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:11,775 INFO L193 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-24 13:51:11,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:11,785 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:11,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:11,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:11,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:11,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:11,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:11,854 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:14,062 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:14,062 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:17,887 INFO L134 CoverageAnalysis]: Checked inductivity of 5612 backedges. 0 proven. 5612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:17,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:17,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 162 [2018-12-24 13:51:17,906 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:17,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-12-24 13:51:17,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-12-24 13:51:17,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 13:51:17,908 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 126 states. [2018-12-24 13:51:18,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:18,389 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-12-24 13:51:18,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-12-24 13:51:18,389 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 186 [2018-12-24 13:51:18,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:18,390 INFO L225 Difference]: With dead ends: 192 [2018-12-24 13:51:18,390 INFO L226 Difference]: Without dead ends: 191 [2018-12-24 13:51:18,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 246 SyntacticMatches, 24 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15864 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11475, Invalid=15257, Unknown=0, NotChecked=0, Total=26732 [2018-12-24 13:51:18,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-12-24 13:51:18,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2018-12-24 13:51:18,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-12-24 13:51:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-12-24 13:51:18,394 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2018-12-24 13:51:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:18,395 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-12-24 13:51:18,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-12-24 13:51:18,395 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-12-24 13:51:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-12-24 13:51:18,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:18,396 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 62, 1, 1] [2018-12-24 13:51:18,396 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:18,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:18,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1036862304, now seen corresponding path program 62 times [2018-12-24 13:51:18,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:18,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:18,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:18,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:18,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:20,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:20,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:20,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:20,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:20,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:20,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:20,391 INFO L193 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-24 13:51:20,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:51:20,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:51:20,650 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2018-12-24 13:51:20,650 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:20,657 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:20,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:20,659 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:20,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:20,669 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:22,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:22,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:26,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5797 backedges. 0 proven. 5797 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:26,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:26,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 163 [2018-12-24 13:51:26,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:26,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-12-24 13:51:26,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-12-24 13:51:26,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2018-12-24 13:51:26,710 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 128 states. [2018-12-24 13:51:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:27,230 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-12-24 13:51:27,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-12-24 13:51:27,231 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 189 [2018-12-24 13:51:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:27,232 INFO L225 Difference]: With dead ends: 195 [2018-12-24 13:51:27,232 INFO L226 Difference]: Without dead ends: 194 [2018-12-24 13:51:27,233 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 250 SyntacticMatches, 26 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16361 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11577, Invalid=15483, Unknown=0, NotChecked=0, Total=27060 [2018-12-24 13:51:27,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-24 13:51:27,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-12-24 13:51:27,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-12-24 13:51:27,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-12-24 13:51:27,237 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2018-12-24 13:51:27,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:27,237 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-12-24 13:51:27,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-12-24 13:51:27,238 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-12-24 13:51:27,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-12-24 13:51:27,238 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:27,238 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 63, 1, 1] [2018-12-24 13:51:27,239 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:27,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:27,239 INFO L82 PathProgramCache]: Analyzing trace with hash 239935884, now seen corresponding path program 63 times [2018-12-24 13:51:27,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:27,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:27,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:27,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:27,240 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:29,120 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:29,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:29,121 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:29,121 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:29,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:29,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:29,121 INFO L193 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-24 13:51:29,130 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:51:29,130 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:51:29,195 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:51:29,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:29,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:29,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:29,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:29,214 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:31,877 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:31,877 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:35,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:35,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:35,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 164 [2018-12-24 13:51:35,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:35,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-12-24 13:51:35,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-12-24 13:51:35,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 13:51:35,762 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 130 states. [2018-12-24 13:51:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:36,306 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-12-24 13:51:36,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-12-24 13:51:36,306 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 192 [2018-12-24 13:51:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:36,307 INFO L225 Difference]: With dead ends: 198 [2018-12-24 13:51:36,308 INFO L226 Difference]: Without dead ends: 197 [2018-12-24 13:51:36,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 254 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16858 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11679, Invalid=15711, Unknown=0, NotChecked=0, Total=27390 [2018-12-24 13:51:36,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-12-24 13:51:36,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 196. [2018-12-24 13:51:36,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-24 13:51:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-12-24 13:51:36,314 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2018-12-24 13:51:36,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:36,314 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-12-24 13:51:36,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-12-24 13:51:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-12-24 13:51:36,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-12-24 13:51:36,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:36,315 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 64, 1, 1] [2018-12-24 13:51:36,316 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:36,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:36,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1104381216, now seen corresponding path program 64 times [2018-12-24 13:51:36,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:36,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:36,317 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:36,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:36,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:38,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:38,288 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:38,288 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:38,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:38,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:38,288 INFO L193 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-24 13:51:38,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:38,297 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:51:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:38,356 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:38,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:38,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:38,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:38,396 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:40,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:44,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6176 backedges. 0 proven. 6176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:44,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:44,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 165 [2018-12-24 13:51:44,687 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:44,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-12-24 13:51:44,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-12-24 13:51:44,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2018-12-24 13:51:44,689 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 132 states. [2018-12-24 13:51:45,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:45,141 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-12-24 13:51:45,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-12-24 13:51:45,142 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 195 [2018-12-24 13:51:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:45,143 INFO L225 Difference]: With dead ends: 201 [2018-12-24 13:51:45,143 INFO L226 Difference]: Without dead ends: 200 [2018-12-24 13:51:45,144 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 258 SyntacticMatches, 30 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17355 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11781, Invalid=15941, Unknown=0, NotChecked=0, Total=27722 [2018-12-24 13:51:45,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-12-24 13:51:45,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-12-24 13:51:45,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-12-24 13:51:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-12-24 13:51:45,150 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2018-12-24 13:51:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:45,150 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-12-24 13:51:45,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-12-24 13:51:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-12-24 13:51:45,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-12-24 13:51:45,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:45,152 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 65, 1, 1] [2018-12-24 13:51:45,152 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:45,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:45,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1171360012, now seen corresponding path program 65 times [2018-12-24 13:51:45,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:45,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:45,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:51:45,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:45,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:47,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:47,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:47,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:47,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:47,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:47,545 INFO L193 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-24 13:51:47,554 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:51:47,554 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:51:47,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2018-12-24 13:51:47,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:47,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:47,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:47,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:47,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:47,834 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:50,299 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:50,300 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:51:54,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6370 backedges. 0 proven. 6370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:54,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:51:54,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 166 [2018-12-24 13:51:54,370 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:51:54,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-24 13:51:54,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-24 13:51:54,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 13:51:54,372 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 134 states. [2018-12-24 13:51:54,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:51:54,818 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-12-24 13:51:54,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-12-24 13:51:54,818 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 198 [2018-12-24 13:51:54,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:51:54,819 INFO L225 Difference]: With dead ends: 204 [2018-12-24 13:51:54,819 INFO L226 Difference]: Without dead ends: 203 [2018-12-24 13:51:54,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 262 SyntacticMatches, 32 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17852 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11883, Invalid=16173, Unknown=0, NotChecked=0, Total=28056 [2018-12-24 13:51:54,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-12-24 13:51:54,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2018-12-24 13:51:54,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-12-24 13:51:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-12-24 13:51:54,826 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2018-12-24 13:51:54,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:51:54,826 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-12-24 13:51:54,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-24 13:51:54,826 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-12-24 13:51:54,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-12-24 13:51:54,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:51:54,828 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 66, 1, 1] [2018-12-24 13:51:54,828 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:51:54,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:51:54,828 INFO L82 PathProgramCache]: Analyzing trace with hash -623120992, now seen corresponding path program 66 times [2018-12-24 13:51:54,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:51:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:54,829 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:51:54,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:51:54,829 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:51:54,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:51:57,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:57,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:57,275 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:51:57,275 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:51:57,275 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:51:57,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:51:57,275 INFO L193 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-24 13:51:57,283 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:51:57,283 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:51:57,351 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:51:57,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:51:57,358 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:51:57,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:51:57,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:51:57,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:51:57,380 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:51:59,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:51:59,995 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:04,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6567 backedges. 0 proven. 6567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:04,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:04,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 167 [2018-12-24 13:52:04,035 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:04,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-12-24 13:52:04,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-12-24 13:52:04,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2018-12-24 13:52:04,037 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 136 states. [2018-12-24 13:52:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:04,539 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-12-24 13:52:04,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-24 13:52:04,540 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 201 [2018-12-24 13:52:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:04,541 INFO L225 Difference]: With dead ends: 207 [2018-12-24 13:52:04,541 INFO L226 Difference]: Without dead ends: 206 [2018-12-24 13:52:04,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 266 SyntacticMatches, 34 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18349 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=11985, Invalid=16407, Unknown=0, NotChecked=0, Total=28392 [2018-12-24 13:52:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-12-24 13:52:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-12-24 13:52:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-12-24 13:52:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-12-24 13:52:04,547 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2018-12-24 13:52:04,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:04,547 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-12-24 13:52:04,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-12-24 13:52:04,547 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-12-24 13:52:04,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-12-24 13:52:04,548 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:04,548 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 67, 1, 1] [2018-12-24 13:52:04,548 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:04,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:04,548 INFO L82 PathProgramCache]: Analyzing trace with hash -548777844, now seen corresponding path program 67 times [2018-12-24 13:52:04,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:04,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:04,549 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:04,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:04,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:04,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:06,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:06,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:06,978 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:06,978 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:06,978 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:06,978 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:06,978 INFO L193 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-24 13:52:06,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:06,989 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:07,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:07,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:52:07,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:07,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:07,069 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:52:09,712 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:09,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6767 backedges. 0 proven. 6767 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:13,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:13,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 168 [2018-12-24 13:52:13,780 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:13,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-12-24 13:52:13,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-12-24 13:52:13,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 13:52:13,782 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 138 states. [2018-12-24 13:52:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:14,202 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-12-24 13:52:14,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-12-24 13:52:14,202 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 204 [2018-12-24 13:52:14,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:14,203 INFO L225 Difference]: With dead ends: 210 [2018-12-24 13:52:14,203 INFO L226 Difference]: Without dead ends: 209 [2018-12-24 13:52:14,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 270 SyntacticMatches, 36 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18846 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=12087, Invalid=16643, Unknown=0, NotChecked=0, Total=28730 [2018-12-24 13:52:14,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-12-24 13:52:14,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 208. [2018-12-24 13:52:14,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-12-24 13:52:14,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-12-24 13:52:14,208 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2018-12-24 13:52:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:14,208 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-12-24 13:52:14,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-12-24 13:52:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-12-24 13:52:14,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-12-24 13:52:14,209 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:14,209 INFO L402 BasicCegarLoop]: trace histogram [69, 68, 68, 1, 1] [2018-12-24 13:52:14,209 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:14,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:14,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1995180512, now seen corresponding path program 68 times [2018-12-24 13:52:14,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:14,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:14,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:14,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:14,210 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:14,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:16,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:16,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:16,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:16,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:16,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:16,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:16,457 INFO L193 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-24 13:52:16,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:16,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:16,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 69 check-sat command(s) [2018-12-24 13:52:16,759 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:16,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:16,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:52:16,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:16,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:16,789 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:52:19,493 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:19,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6970 backedges. 0 proven. 6970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:23,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:23,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 169 [2018-12-24 13:52:23,522 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:23,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-12-24 13:52:23,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-12-24 13:52:23,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2018-12-24 13:52:23,524 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 140 states. [2018-12-24 13:52:24,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:24,062 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-12-24 13:52:24,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-12-24 13:52:24,062 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 207 [2018-12-24 13:52:24,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:24,064 INFO L225 Difference]: With dead ends: 213 [2018-12-24 13:52:24,064 INFO L226 Difference]: Without dead ends: 212 [2018-12-24 13:52:24,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 274 SyntacticMatches, 38 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19343 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12189, Invalid=16881, Unknown=0, NotChecked=0, Total=29070 [2018-12-24 13:52:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-12-24 13:52:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-12-24 13:52:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-24 13:52:24,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-12-24 13:52:24,070 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2018-12-24 13:52:24,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:24,071 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-12-24 13:52:24,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-12-24 13:52:24,071 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-12-24 13:52:24,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-12-24 13:52:24,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:24,072 INFO L402 BasicCegarLoop]: trace histogram [70, 69, 69, 1, 1] [2018-12-24 13:52:24,072 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:24,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:24,073 INFO L82 PathProgramCache]: Analyzing trace with hash -370182132, now seen corresponding path program 69 times [2018-12-24 13:52:24,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:24,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:24,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:24,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:24,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:26,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:26,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:26,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:26,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:26,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:26,353 INFO L193 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-24 13:52:26,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:52:26,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:52:26,429 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:52:26,429 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:26,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:26,447 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:52:26,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:26,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:26,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:52:29,427 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:29,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 7176 backedges. 0 proven. 7176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:33,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:33,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 170 [2018-12-24 13:52:33,566 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:33,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-12-24 13:52:33,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-12-24 13:52:33,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 13:52:33,568 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 142 states. [2018-12-24 13:52:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:34,045 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-12-24 13:52:34,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-12-24 13:52:34,045 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 210 [2018-12-24 13:52:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:34,047 INFO L225 Difference]: With dead ends: 216 [2018-12-24 13:52:34,047 INFO L226 Difference]: Without dead ends: 215 [2018-12-24 13:52:34,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 278 SyntacticMatches, 40 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19840 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12291, Invalid=17121, Unknown=0, NotChecked=0, Total=29412 [2018-12-24 13:52:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-12-24 13:52:34,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2018-12-24 13:52:34,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-12-24 13:52:34,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-12-24 13:52:34,053 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2018-12-24 13:52:34,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:34,054 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-12-24 13:52:34,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-12-24 13:52:34,054 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-12-24 13:52:34,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-12-24 13:52:34,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:34,055 INFO L402 BasicCegarLoop]: trace histogram [71, 70, 70, 1, 1] [2018-12-24 13:52:34,055 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:34,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:34,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1380163232, now seen corresponding path program 70 times [2018-12-24 13:52:34,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:34,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:34,056 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:34,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:34,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:36,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:36,432 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:36,432 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:36,432 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:36,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:36,432 INFO L193 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-24 13:52:36,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:36,441 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:52:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:36,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:36,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:52:36,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:36,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:52:39,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:39,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:43,850 INFO L134 CoverageAnalysis]: Checked inductivity of 7385 backedges. 0 proven. 7385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:43,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:43,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 171 [2018-12-24 13:52:43,870 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:43,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-12-24 13:52:43,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-12-24 13:52:43,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2018-12-24 13:52:43,872 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 144 states. [2018-12-24 13:52:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:44,331 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-12-24 13:52:44,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-12-24 13:52:44,331 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 213 [2018-12-24 13:52:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:44,333 INFO L225 Difference]: With dead ends: 219 [2018-12-24 13:52:44,333 INFO L226 Difference]: Without dead ends: 218 [2018-12-24 13:52:44,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 282 SyntacticMatches, 42 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20337 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12393, Invalid=17363, Unknown=0, NotChecked=0, Total=29756 [2018-12-24 13:52:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-12-24 13:52:44,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-12-24 13:52:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-12-24 13:52:44,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-12-24 13:52:44,338 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2018-12-24 13:52:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:44,338 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-12-24 13:52:44,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-12-24 13:52:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-12-24 13:52:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-12-24 13:52:44,340 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:44,340 INFO L402 BasicCegarLoop]: trace histogram [72, 71, 71, 1, 1] [2018-12-24 13:52:44,340 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:44,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:44,340 INFO L82 PathProgramCache]: Analyzing trace with hash 720961420, now seen corresponding path program 71 times [2018-12-24 13:52:44,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:44,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:44,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:52:44,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:44,341 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:44,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:46,733 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:46,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:46,733 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:46,733 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:46,733 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:46,733 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:46,734 INFO L193 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-24 13:52:46,741 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:52:46,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:52:47,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 72 check-sat command(s) [2018-12-24 13:52:47,079 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:47,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:47,092 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:52:47,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:47,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:47,100 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:52:50,267 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:50,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:52:54,478 INFO L134 CoverageAnalysis]: Checked inductivity of 7597 backedges. 0 proven. 7597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:54,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:52:54,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 172 [2018-12-24 13:52:54,497 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:52:54,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-12-24 13:52:54,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-12-24 13:52:54,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 13:52:54,499 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 146 states. [2018-12-24 13:52:54,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:52:54,973 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-12-24 13:52:54,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-12-24 13:52:54,974 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 216 [2018-12-24 13:52:54,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:52:54,975 INFO L225 Difference]: With dead ends: 222 [2018-12-24 13:52:54,975 INFO L226 Difference]: Without dead ends: 221 [2018-12-24 13:52:54,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 502 GetRequests, 286 SyntacticMatches, 44 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20834 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12495, Invalid=17607, Unknown=0, NotChecked=0, Total=30102 [2018-12-24 13:52:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-12-24 13:52:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 220. [2018-12-24 13:52:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-12-24 13:52:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-12-24 13:52:54,981 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2018-12-24 13:52:54,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:52:54,981 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-12-24 13:52:54,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-12-24 13:52:54,981 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-12-24 13:52:54,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-12-24 13:52:54,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:52:54,982 INFO L402 BasicCegarLoop]: trace histogram [73, 72, 72, 1, 1] [2018-12-24 13:52:54,982 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:52:54,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:52:54,982 INFO L82 PathProgramCache]: Analyzing trace with hash -969742560, now seen corresponding path program 72 times [2018-12-24 13:52:54,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:52:54,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:54,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:52:54,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:52:54,983 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:52:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:52:57,451 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:52:57,451 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:57,451 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:52:57,451 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:52:57,451 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:52:57,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:52:57,452 INFO L193 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-24 13:52:57,459 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:52:57,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:52:57,534 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:52:57,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:52:57,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:52:57,544 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:52:57,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:52:57,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:52:57,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:53:00,706 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:00,707 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:04,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7812 backedges. 0 proven. 7812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:04,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:04,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 173 [2018-12-24 13:53:04,868 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:04,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-12-24 13:53:04,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-12-24 13:53:04,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2018-12-24 13:53:04,871 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 148 states. [2018-12-24 13:53:05,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:05,348 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-12-24 13:53:05,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-12-24 13:53:05,349 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 219 [2018-12-24 13:53:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:05,350 INFO L225 Difference]: With dead ends: 225 [2018-12-24 13:53:05,350 INFO L226 Difference]: Without dead ends: 224 [2018-12-24 13:53:05,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 290 SyntacticMatches, 46 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21331 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12597, Invalid=17853, Unknown=0, NotChecked=0, Total=30450 [2018-12-24 13:53:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-12-24 13:53:05,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2018-12-24 13:53:05,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-12-24 13:53:05,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-12-24 13:53:05,356 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2018-12-24 13:53:05,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:05,356 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-12-24 13:53:05,356 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-12-24 13:53:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-12-24 13:53:05,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-12-24 13:53:05,357 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:05,357 INFO L402 BasicCegarLoop]: trace histogram [74, 73, 73, 1, 1] [2018-12-24 13:53:05,357 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:05,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:05,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1650530548, now seen corresponding path program 73 times [2018-12-24 13:53:05,358 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:05,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:05,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:05,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:05,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:08,100 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:08,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:08,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:08,101 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:08,101 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:08,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:08,101 INFO L193 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-24 13:53:08,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:08,109 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:08,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:08,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:08,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:53:08,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:08,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:08,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:53:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:11,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:15,418 INFO L134 CoverageAnalysis]: Checked inductivity of 8030 backedges. 0 proven. 8030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:15,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:15,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 174 [2018-12-24 13:53:15,437 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:15,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-12-24 13:53:15,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-12-24 13:53:15,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 13:53:15,439 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 150 states. [2018-12-24 13:53:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:15,970 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-12-24 13:53:15,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-12-24 13:53:15,971 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 222 [2018-12-24 13:53:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:15,972 INFO L225 Difference]: With dead ends: 228 [2018-12-24 13:53:15,973 INFO L226 Difference]: Without dead ends: 227 [2018-12-24 13:53:15,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 516 GetRequests, 294 SyntacticMatches, 48 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21828 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=12699, Invalid=18101, Unknown=0, NotChecked=0, Total=30800 [2018-12-24 13:53:15,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-12-24 13:53:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2018-12-24 13:53:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-24 13:53:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-12-24 13:53:15,979 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2018-12-24 13:53:15,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:15,979 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-12-24 13:53:15,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-12-24 13:53:15,979 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-12-24 13:53:15,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-12-24 13:53:15,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:15,981 INFO L402 BasicCegarLoop]: trace histogram [75, 74, 74, 1, 1] [2018-12-24 13:53:15,981 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:15,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:15,981 INFO L82 PathProgramCache]: Analyzing trace with hash 2125057952, now seen corresponding path program 74 times [2018-12-24 13:53:15,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:15,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:15,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:15,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:15,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:18,916 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:18,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:18,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:18,916 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:18,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:18,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:18,917 INFO L193 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-24 13:53:18,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:18,925 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:19,236 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 75 check-sat command(s) [2018-12-24 13:53:19,236 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:19,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:19,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:53:19,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:19,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:19,257 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:53:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:22,464 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:26,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8251 backedges. 0 proven. 8251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:26,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:26,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 175 [2018-12-24 13:53:26,685 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:26,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-12-24 13:53:26,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-12-24 13:53:26,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2018-12-24 13:53:26,687 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 152 states. [2018-12-24 13:53:27,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:27,280 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-12-24 13:53:27,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-12-24 13:53:27,281 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 225 [2018-12-24 13:53:27,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:27,282 INFO L225 Difference]: With dead ends: 231 [2018-12-24 13:53:27,282 INFO L226 Difference]: Without dead ends: 230 [2018-12-24 13:53:27,283 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 298 SyntacticMatches, 50 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22325 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=12801, Invalid=18351, Unknown=0, NotChecked=0, Total=31152 [2018-12-24 13:53:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-12-24 13:53:27,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-12-24 13:53:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-12-24 13:53:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-12-24 13:53:27,289 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2018-12-24 13:53:27,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:27,290 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-12-24 13:53:27,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-12-24 13:53:27,290 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-12-24 13:53:27,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-12-24 13:53:27,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:27,291 INFO L402 BasicCegarLoop]: trace histogram [76, 75, 75, 1, 1] [2018-12-24 13:53:27,291 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:27,292 INFO L82 PathProgramCache]: Analyzing trace with hash -216453492, now seen corresponding path program 75 times [2018-12-24 13:53:27,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:27,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:27,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:27,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:27,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:30,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:30,140 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:30,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:30,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:30,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:30,141 INFO L193 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-24 13:53:30,149 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:53:30,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:53:30,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:53:30,229 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:30,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:30,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:53:30,240 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:30,248 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:53:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:33,583 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:37,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:37,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:37,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 176 [2018-12-24 13:53:37,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:37,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-12-24 13:53:37,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-12-24 13:53:37,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 13:53:37,607 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 154 states. [2018-12-24 13:53:38,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:38,243 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-12-24 13:53:38,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-12-24 13:53:38,243 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 228 [2018-12-24 13:53:38,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:38,244 INFO L225 Difference]: With dead ends: 234 [2018-12-24 13:53:38,244 INFO L226 Difference]: Without dead ends: 233 [2018-12-24 13:53:38,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 302 SyntacticMatches, 52 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22822 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=12903, Invalid=18603, Unknown=0, NotChecked=0, Total=31506 [2018-12-24 13:53:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-12-24 13:53:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 232. [2018-12-24 13:53:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-24 13:53:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-12-24 13:53:38,251 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2018-12-24 13:53:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:38,251 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-12-24 13:53:38,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-12-24 13:53:38,252 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-12-24 13:53:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-12-24 13:53:38,253 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:38,253 INFO L402 BasicCegarLoop]: trace histogram [77, 76, 76, 1, 1] [2018-12-24 13:53:38,253 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:38,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:38,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1620027360, now seen corresponding path program 76 times [2018-12-24 13:53:38,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:38,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:38,254 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:53:38,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:38,254 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:38,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:41,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:41,244 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:41,244 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:41,244 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:41,244 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:41,244 INFO L193 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-24 13:53:41,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:41,252 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:53:41,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:41,323 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:41,327 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:53:41,327 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:41,336 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:53:44,902 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:44,902 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:53:49,126 INFO L134 CoverageAnalysis]: Checked inductivity of 8702 backedges. 0 proven. 8702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:49,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:53:49,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 177 [2018-12-24 13:53:49,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:53:49,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-12-24 13:53:49,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-12-24 13:53:49,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2018-12-24 13:53:49,147 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 156 states. [2018-12-24 13:53:49,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:53:49,684 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-12-24 13:53:49,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-12-24 13:53:49,684 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 231 [2018-12-24 13:53:49,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:53:49,686 INFO L225 Difference]: With dead ends: 237 [2018-12-24 13:53:49,686 INFO L226 Difference]: Without dead ends: 236 [2018-12-24 13:53:49,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 306 SyntacticMatches, 54 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23319 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=13005, Invalid=18857, Unknown=0, NotChecked=0, Total=31862 [2018-12-24 13:53:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-12-24 13:53:49,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2018-12-24 13:53:49,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-12-24 13:53:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-12-24 13:53:49,692 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2018-12-24 13:53:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:53:49,692 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-12-24 13:53:49,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-12-24 13:53:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-12-24 13:53:49,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-12-24 13:53:49,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:53:49,693 INFO L402 BasicCegarLoop]: trace histogram [78, 77, 77, 1, 1] [2018-12-24 13:53:49,693 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:53:49,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:53:49,693 INFO L82 PathProgramCache]: Analyzing trace with hash 312464908, now seen corresponding path program 77 times [2018-12-24 13:53:49,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:53:49,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:49,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:53:49,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:53:49,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:53:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:53:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:52,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:52,540 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:53:52,540 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:53:52,540 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:53:52,540 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:53:52,540 INFO L193 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-24 13:53:52,549 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:53:52,549 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:53:52,928 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 78 check-sat command(s) [2018-12-24 13:53:52,928 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:53:52,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:53:52,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:53:52,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,956 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:53:52,956 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:53:56,530 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:53:56,530 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 8932 backedges. 0 proven. 8932 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:00,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:00,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 178 [2018-12-24 13:54:00,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:00,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-12-24 13:54:00,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-12-24 13:54:00,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 13:54:00,727 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 158 states. [2018-12-24 13:54:01,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:01,363 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-12-24 13:54:01,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-12-24 13:54:01,363 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 234 [2018-12-24 13:54:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:01,365 INFO L225 Difference]: With dead ends: 240 [2018-12-24 13:54:01,365 INFO L226 Difference]: Without dead ends: 239 [2018-12-24 13:54:01,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 544 GetRequests, 310 SyntacticMatches, 56 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23816 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=13107, Invalid=19113, Unknown=0, NotChecked=0, Total=32220 [2018-12-24 13:54:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-12-24 13:54:01,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 238. [2018-12-24 13:54:01,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-12-24 13:54:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-12-24 13:54:01,370 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2018-12-24 13:54:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:01,370 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-12-24 13:54:01,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-12-24 13:54:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-12-24 13:54:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-12-24 13:54:01,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:01,371 INFO L402 BasicCegarLoop]: trace histogram [79, 78, 78, 1, 1] [2018-12-24 13:54:01,372 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1447985312, now seen corresponding path program 78 times [2018-12-24 13:54:01,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:01,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:01,372 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:01,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:01,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:04,500 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:04,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:04,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:04,501 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:04,501 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:04,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:04,501 INFO L193 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-24 13:54:04,509 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:54:04,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:54:04,590 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:54:04,590 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:04,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:04,600 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:54:04,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,608 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:04,608 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:54:08,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:08,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:12,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9165 backedges. 0 proven. 9165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:12,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:12,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 179 [2018-12-24 13:54:12,576 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:12,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-12-24 13:54:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-12-24 13:54:12,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2018-12-24 13:54:12,578 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 160 states. [2018-12-24 13:54:13,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:13,170 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-12-24 13:54:13,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-12-24 13:54:13,171 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 237 [2018-12-24 13:54:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:13,172 INFO L225 Difference]: With dead ends: 243 [2018-12-24 13:54:13,172 INFO L226 Difference]: Without dead ends: 242 [2018-12-24 13:54:13,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 314 SyntacticMatches, 58 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24313 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=13209, Invalid=19371, Unknown=0, NotChecked=0, Total=32580 [2018-12-24 13:54:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-12-24 13:54:13,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-12-24 13:54:13,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-12-24 13:54:13,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-12-24 13:54:13,179 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2018-12-24 13:54:13,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:13,180 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-12-24 13:54:13,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-12-24 13:54:13,180 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-12-24 13:54:13,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-24 13:54:13,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:13,181 INFO L402 BasicCegarLoop]: trace histogram [80, 79, 79, 1, 1] [2018-12-24 13:54:13,181 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:13,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:13,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1721049716, now seen corresponding path program 79 times [2018-12-24 13:54:13,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:13,182 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:13,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:13,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:16,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:16,340 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:16,340 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:16,340 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:16,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:16,340 INFO L193 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-24 13:54:16,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:16,349 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:16,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:16,426 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:54:16,426 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:16,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:16,435 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:54:20,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:20,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 9401 backedges. 0 proven. 9401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:24,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:24,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 180 [2018-12-24 13:54:24,253 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:24,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-12-24 13:54:24,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-12-24 13:54:24,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 13:54:24,255 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 162 states. [2018-12-24 13:54:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:24,907 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-12-24 13:54:24,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-12-24 13:54:24,907 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 240 [2018-12-24 13:54:24,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:24,908 INFO L225 Difference]: With dead ends: 246 [2018-12-24 13:54:24,909 INFO L226 Difference]: Without dead ends: 245 [2018-12-24 13:54:24,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 318 SyntacticMatches, 60 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24810 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=13311, Invalid=19631, Unknown=0, NotChecked=0, Total=32942 [2018-12-24 13:54:24,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-12-24 13:54:24,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 244. [2018-12-24 13:54:24,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-12-24 13:54:24,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-12-24 13:54:24,913 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2018-12-24 13:54:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:24,913 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-12-24 13:54:24,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-12-24 13:54:24,914 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-12-24 13:54:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-12-24 13:54:24,915 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:24,915 INFO L402 BasicCegarLoop]: trace histogram [81, 80, 80, 1, 1] [2018-12-24 13:54:24,915 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:24,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:24,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1527531808, now seen corresponding path program 80 times [2018-12-24 13:54:24,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:24,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:24,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:24,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:24,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:28,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:28,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:28,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:28,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:28,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:28,292 INFO L193 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-24 13:54:28,301 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:54:28,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:54:28,720 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2018-12-24 13:54:28,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:28,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:28,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:54:28,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:28,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:54:32,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:32,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:36,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 0 proven. 9640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:37,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:37,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 181 [2018-12-24 13:54:37,012 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:37,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-12-24 13:54:37,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-12-24 13:54:37,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2018-12-24 13:54:37,014 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 164 states. [2018-12-24 13:54:37,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:37,577 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-12-24 13:54:37,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-12-24 13:54:37,578 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 243 [2018-12-24 13:54:37,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:37,579 INFO L225 Difference]: With dead ends: 249 [2018-12-24 13:54:37,579 INFO L226 Difference]: Without dead ends: 248 [2018-12-24 13:54:37,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 565 GetRequests, 322 SyntacticMatches, 62 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25307 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=13413, Invalid=19893, Unknown=0, NotChecked=0, Total=33306 [2018-12-24 13:54:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-24 13:54:37,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2018-12-24 13:54:37,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-12-24 13:54:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-12-24 13:54:37,584 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2018-12-24 13:54:37,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:37,584 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-12-24 13:54:37,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-12-24 13:54:37,584 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-12-24 13:54:37,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-12-24 13:54:37,585 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:37,585 INFO L402 BasicCegarLoop]: trace histogram [82, 81, 81, 1, 1] [2018-12-24 13:54:37,585 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:37,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:37,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1521632524, now seen corresponding path program 81 times [2018-12-24 13:54:37,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:37,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:37,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:37,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:37,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:37,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:40,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:40,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:40,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:40,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:40,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:40,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:40,835 INFO L193 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-24 13:54:40,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:54:40,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:54:40,929 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:54:40,929 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:54:40,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:40,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:54:40,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:40,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:40,949 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:54:44,633 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:44,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:54:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 9882 backedges. 0 proven. 9882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:48,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:54:48,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 182 [2018-12-24 13:54:48,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:54:48,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-12-24 13:54:48,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-12-24 13:54:48,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 13:54:48,940 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 166 states. [2018-12-24 13:54:49,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:54:49,536 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-12-24 13:54:49,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-12-24 13:54:49,536 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 246 [2018-12-24 13:54:49,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:54:49,537 INFO L225 Difference]: With dead ends: 252 [2018-12-24 13:54:49,538 INFO L226 Difference]: Without dead ends: 251 [2018-12-24 13:54:49,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 326 SyntacticMatches, 64 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25804 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=13515, Invalid=20157, Unknown=0, NotChecked=0, Total=33672 [2018-12-24 13:54:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-12-24 13:54:49,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 250. [2018-12-24 13:54:49,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-12-24 13:54:49,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-12-24 13:54:49,542 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2018-12-24 13:54:49,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:54:49,543 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-12-24 13:54:49,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-12-24 13:54:49,543 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-12-24 13:54:49,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-12-24 13:54:49,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:54:49,544 INFO L402 BasicCegarLoop]: trace histogram [83, 82, 82, 1, 1] [2018-12-24 13:54:49,544 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:54:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:54:49,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1869722016, now seen corresponding path program 82 times [2018-12-24 13:54:49,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:54:49,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:49,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:54:49,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:54:49,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:54:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:52,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:52,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:54:52,913 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:54:52,913 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:54:52,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:54:52,913 INFO L193 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-24 13:54:52,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:54:52,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:54:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:54:53,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:54:53,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:54:53,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:54:53,016 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:54:53,016 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:54:57,097 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:54:57,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:01,471 INFO L134 CoverageAnalysis]: Checked inductivity of 10127 backedges. 0 proven. 10127 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:01,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:01,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 183 [2018-12-24 13:55:01,490 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:01,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-12-24 13:55:01,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-12-24 13:55:01,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2018-12-24 13:55:01,492 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 168 states. [2018-12-24 13:55:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:02,070 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-12-24 13:55:02,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-12-24 13:55:02,070 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 249 [2018-12-24 13:55:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:02,071 INFO L225 Difference]: With dead ends: 255 [2018-12-24 13:55:02,071 INFO L226 Difference]: Without dead ends: 254 [2018-12-24 13:55:02,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 579 GetRequests, 330 SyntacticMatches, 66 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26301 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=13617, Invalid=20423, Unknown=0, NotChecked=0, Total=34040 [2018-12-24 13:55:02,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-12-24 13:55:02,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-12-24 13:55:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-24 13:55:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-12-24 13:55:02,077 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2018-12-24 13:55:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:02,077 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-12-24 13:55:02,077 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-12-24 13:55:02,078 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-12-24 13:55:02,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-12-24 13:55:02,079 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:02,079 INFO L402 BasicCegarLoop]: trace histogram [84, 83, 83, 1, 1] [2018-12-24 13:55:02,079 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:02,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:02,079 INFO L82 PathProgramCache]: Analyzing trace with hash -542241652, now seen corresponding path program 83 times [2018-12-24 13:55:02,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:02,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:02,080 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:02,080 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:02,080 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:02,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:05,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:05,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:05,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:05,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:05,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:05,377 INFO L193 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-24 13:55:05,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:55:05,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:55:05,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 84 check-sat command(s) [2018-12-24 13:55:05,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:05,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:05,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:55:05,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:05,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:05,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:55:09,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:09,760 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:14,031 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 0 proven. 10375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:14,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:14,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 184 [2018-12-24 13:55:14,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:14,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-12-24 13:55:14,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-12-24 13:55:14,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 13:55:14,053 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 170 states. [2018-12-24 13:55:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:14,639 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-12-24 13:55:14,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-12-24 13:55:14,639 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 252 [2018-12-24 13:55:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:14,641 INFO L225 Difference]: With dead ends: 258 [2018-12-24 13:55:14,641 INFO L226 Difference]: Without dead ends: 257 [2018-12-24 13:55:14,642 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 334 SyntacticMatches, 68 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26798 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=13719, Invalid=20691, Unknown=0, NotChecked=0, Total=34410 [2018-12-24 13:55:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-24 13:55:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2018-12-24 13:55:14,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-24 13:55:14,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-12-24 13:55:14,646 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2018-12-24 13:55:14,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:14,647 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-12-24 13:55:14,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-12-24 13:55:14,647 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-12-24 13:55:14,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-12-24 13:55:14,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:14,648 INFO L402 BasicCegarLoop]: trace histogram [85, 84, 84, 1, 1] [2018-12-24 13:55:14,648 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:14,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:14,648 INFO L82 PathProgramCache]: Analyzing trace with hash -549012960, now seen corresponding path program 84 times [2018-12-24 13:55:14,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:14,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:14,649 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:14,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:14,649 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:18,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:18,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:18,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:18,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:18,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:18,279 INFO L193 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-24 13:55:18,291 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:55:18,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:55:18,380 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:55:18,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:18,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:18,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:55:18,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:18,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:18,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:55:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:22,741 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:27,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10626 backedges. 0 proven. 10626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:27,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:27,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 185 [2018-12-24 13:55:27,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:27,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-12-24 13:55:27,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-12-24 13:55:27,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2018-12-24 13:55:27,236 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 172 states. [2018-12-24 13:55:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:27,891 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-12-24 13:55:27,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-12-24 13:55:27,892 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 255 [2018-12-24 13:55:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:27,893 INFO L225 Difference]: With dead ends: 261 [2018-12-24 13:55:27,893 INFO L226 Difference]: Without dead ends: 260 [2018-12-24 13:55:27,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 338 SyntacticMatches, 70 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27295 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=13821, Invalid=20961, Unknown=0, NotChecked=0, Total=34782 [2018-12-24 13:55:27,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-12-24 13:55:27,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2018-12-24 13:55:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-12-24 13:55:27,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-12-24 13:55:27,901 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2018-12-24 13:55:27,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:27,902 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-12-24 13:55:27,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-12-24 13:55:27,902 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-12-24 13:55:27,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-12-24 13:55:27,903 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:27,903 INFO L402 BasicCegarLoop]: trace histogram [86, 85, 85, 1, 1] [2018-12-24 13:55:27,903 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:27,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:27,904 INFO L82 PathProgramCache]: Analyzing trace with hash -409586676, now seen corresponding path program 85 times [2018-12-24 13:55:27,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:27,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:27,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:27,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:31,842 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:31,842 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:31,842 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:31,843 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:31,843 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:31,843 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:31,843 INFO L193 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-24 13:55:31,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:31,852 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:55:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:31,932 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:31,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:55:31,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:31,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:31,947 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:55:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:36,131 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:40,640 INFO L134 CoverageAnalysis]: Checked inductivity of 10880 backedges. 0 proven. 10880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:40,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:40,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 186 [2018-12-24 13:55:40,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:40,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-12-24 13:55:40,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-12-24 13:55:40,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 13:55:40,663 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 174 states. [2018-12-24 13:55:41,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:41,376 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-12-24 13:55:41,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-12-24 13:55:41,377 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 258 [2018-12-24 13:55:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:41,378 INFO L225 Difference]: With dead ends: 264 [2018-12-24 13:55:41,378 INFO L226 Difference]: Without dead ends: 263 [2018-12-24 13:55:41,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 600 GetRequests, 342 SyntacticMatches, 72 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27792 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=13923, Invalid=21233, Unknown=0, NotChecked=0, Total=35156 [2018-12-24 13:55:41,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-12-24 13:55:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2018-12-24 13:55:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-12-24 13:55:41,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-12-24 13:55:41,384 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2018-12-24 13:55:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:41,385 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-12-24 13:55:41,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-12-24 13:55:41,385 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-12-24 13:55:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-12-24 13:55:41,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:41,387 INFO L402 BasicCegarLoop]: trace histogram [87, 86, 86, 1, 1] [2018-12-24 13:55:41,387 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:41,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:41,387 INFO L82 PathProgramCache]: Analyzing trace with hash 5464736, now seen corresponding path program 86 times [2018-12-24 13:55:41,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:41,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:55:41,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:41,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:44,882 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:44,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:44,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:44,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:44,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:44,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:44,883 INFO L193 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-24 13:55:44,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:55:44,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:55:45,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 87 check-sat command(s) [2018-12-24 13:55:45,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:45,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:45,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:55:45,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:45,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:55:49,781 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:49,781 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:55:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 11137 backedges. 0 proven. 11137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:54,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:55:54,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 187 [2018-12-24 13:55:54,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:55:54,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-12-24 13:55:54,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-12-24 13:55:54,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2018-12-24 13:55:54,245 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 176 states. [2018-12-24 13:55:54,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:55:54,926 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-12-24 13:55:54,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-12-24 13:55:54,927 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 261 [2018-12-24 13:55:54,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:55:54,928 INFO L225 Difference]: With dead ends: 267 [2018-12-24 13:55:54,928 INFO L226 Difference]: Without dead ends: 266 [2018-12-24 13:55:54,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 346 SyntacticMatches, 74 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28289 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=14025, Invalid=21507, Unknown=0, NotChecked=0, Total=35532 [2018-12-24 13:55:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-24 13:55:54,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-12-24 13:55:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-12-24 13:55:54,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-12-24 13:55:54,933 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2018-12-24 13:55:54,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:55:54,934 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-12-24 13:55:54,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-12-24 13:55:54,934 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-12-24 13:55:54,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-12-24 13:55:54,934 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:55:54,935 INFO L402 BasicCegarLoop]: trace histogram [88, 87, 87, 1, 1] [2018-12-24 13:55:54,935 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:55:54,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:55:54,935 INFO L82 PathProgramCache]: Analyzing trace with hash -408765556, now seen corresponding path program 87 times [2018-12-24 13:55:54,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:55:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:54,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:55:54,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:55:54,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:55:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:55:58,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:55:58,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:58,801 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:55:58,801 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:55:58,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:55:58,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:55:58,801 INFO L193 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-24 13:55:58,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:55:58,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:55:58,904 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:55:58,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:55:58,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:55:58,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:55:58,920 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:55:58,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:55:58,930 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:56:03,492 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:03,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 11397 backedges. 0 proven. 11397 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:07,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:07,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 188 [2018-12-24 13:56:07,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:07,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-12-24 13:56:07,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-12-24 13:56:07,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 13:56:07,945 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 178 states. [2018-12-24 13:56:08,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:08,571 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-12-24 13:56:08,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-12-24 13:56:08,571 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 264 [2018-12-24 13:56:08,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:08,573 INFO L225 Difference]: With dead ends: 270 [2018-12-24 13:56:08,573 INFO L226 Difference]: Without dead ends: 269 [2018-12-24 13:56:08,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 614 GetRequests, 350 SyntacticMatches, 76 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28786 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=14127, Invalid=21783, Unknown=0, NotChecked=0, Total=35910 [2018-12-24 13:56:08,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-12-24 13:56:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 268. [2018-12-24 13:56:08,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-12-24 13:56:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-12-24 13:56:08,579 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2018-12-24 13:56:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:08,579 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-12-24 13:56:08,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-12-24 13:56:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-12-24 13:56:08,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-12-24 13:56:08,580 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:08,580 INFO L402 BasicCegarLoop]: trace histogram [89, 88, 88, 1, 1] [2018-12-24 13:56:08,581 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:08,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:08,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1302353120, now seen corresponding path program 88 times [2018-12-24 13:56:08,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:08,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:08,581 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:08,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:08,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:12,469 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:12,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:12,469 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:12,469 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:12,470 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:12,470 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:12,470 INFO L193 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-24 13:56:12,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:12,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:12,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:12,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:56:12,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:12,575 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:12,575 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:56:16,991 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:16,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:21,407 INFO L134 CoverageAnalysis]: Checked inductivity of 11660 backedges. 0 proven. 11660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:21,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:21,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 189 [2018-12-24 13:56:21,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:21,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-12-24 13:56:21,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-12-24 13:56:21,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2018-12-24 13:56:21,429 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 180 states. [2018-12-24 13:56:22,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:22,196 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-12-24 13:56:22,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-12-24 13:56:22,197 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 267 [2018-12-24 13:56:22,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:22,198 INFO L225 Difference]: With dead ends: 273 [2018-12-24 13:56:22,198 INFO L226 Difference]: Without dead ends: 272 [2018-12-24 13:56:22,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 354 SyntacticMatches, 78 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29283 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=14229, Invalid=22061, Unknown=0, NotChecked=0, Total=36290 [2018-12-24 13:56:22,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-12-24 13:56:22,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2018-12-24 13:56:22,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-24 13:56:22,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-12-24 13:56:22,205 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2018-12-24 13:56:22,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:22,205 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-12-24 13:56:22,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-12-24 13:56:22,205 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-12-24 13:56:22,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-12-24 13:56:22,206 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:22,206 INFO L402 BasicCegarLoop]: trace histogram [90, 89, 89, 1, 1] [2018-12-24 13:56:22,206 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:22,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:22,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1962171636, now seen corresponding path program 89 times [2018-12-24 13:56:22,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:22,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:22,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:22,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:22,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:22,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:26,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:26,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:26,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:26,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:26,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:26,068 INFO L193 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-24 13:56:26,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:56:26,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:56:26,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 90 check-sat command(s) [2018-12-24 13:56:26,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:26,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:26,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:56:26,646 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:26,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:26,655 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:56:31,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:31,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 11926 backedges. 0 proven. 11926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:35,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:35,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 190 [2018-12-24 13:56:35,921 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:35,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-12-24 13:56:35,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-12-24 13:56:35,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 13:56:35,924 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 182 states. [2018-12-24 13:56:36,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:36,646 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-12-24 13:56:36,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-12-24 13:56:36,646 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 270 [2018-12-24 13:56:36,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:36,648 INFO L225 Difference]: With dead ends: 276 [2018-12-24 13:56:36,648 INFO L226 Difference]: Without dead ends: 275 [2018-12-24 13:56:36,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 628 GetRequests, 358 SyntacticMatches, 80 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29780 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=14331, Invalid=22341, Unknown=0, NotChecked=0, Total=36672 [2018-12-24 13:56:36,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-12-24 13:56:36,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 274. [2018-12-24 13:56:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-12-24 13:56:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2018-12-24 13:56:36,654 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2018-12-24 13:56:36,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:36,654 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2018-12-24 13:56:36,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-12-24 13:56:36,654 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2018-12-24 13:56:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-12-24 13:56:36,655 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:36,655 INFO L402 BasicCegarLoop]: trace histogram [91, 90, 90, 1, 1] [2018-12-24 13:56:36,655 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:36,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash -550268000, now seen corresponding path program 90 times [2018-12-24 13:56:36,656 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:36,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:36,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:40,631 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:40,631 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:40,632 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:40,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:40,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:40,632 INFO L193 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-24 13:56:40,641 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:56:40,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:56:40,738 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:56:40,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:56:40,748 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:40,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:56:40,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:40,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:40,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:56:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:45,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:56:50,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12195 backedges. 0 proven. 12195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:50,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:56:50,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 191 [2018-12-24 13:56:50,122 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:56:50,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-12-24 13:56:50,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-12-24 13:56:50,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2018-12-24 13:56:50,124 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 184 states. [2018-12-24 13:56:50,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:56:50,856 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-12-24 13:56:50,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-12-24 13:56:50,856 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 273 [2018-12-24 13:56:50,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:56:50,858 INFO L225 Difference]: With dead ends: 279 [2018-12-24 13:56:50,858 INFO L226 Difference]: Without dead ends: 278 [2018-12-24 13:56:50,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 635 GetRequests, 362 SyntacticMatches, 82 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30277 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=14433, Invalid=22623, Unknown=0, NotChecked=0, Total=37056 [2018-12-24 13:56:50,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-12-24 13:56:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-12-24 13:56:50,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-12-24 13:56:50,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-12-24 13:56:50,865 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2018-12-24 13:56:50,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:56:50,866 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-12-24 13:56:50,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-12-24 13:56:50,866 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-12-24 13:56:50,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-12-24 13:56:50,867 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:56:50,867 INFO L402 BasicCegarLoop]: trace histogram [92, 91, 91, 1, 1] [2018-12-24 13:56:50,867 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:56:50,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:56:50,867 INFO L82 PathProgramCache]: Analyzing trace with hash 856222348, now seen corresponding path program 91 times [2018-12-24 13:56:50,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:56:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:50,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:56:50,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:56:50,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:56:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:54,980 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:54,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:54,981 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:56:54,981 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:56:54,981 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:56:54,981 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:56:54,981 INFO L193 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-24 13:56:54,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:56:54,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:56:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:56:55,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:56:55,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:56:55,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:56:55,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:56:55,094 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:56:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:56:59,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:04,381 INFO L134 CoverageAnalysis]: Checked inductivity of 12467 backedges. 0 proven. 12467 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:04,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:04,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 192 [2018-12-24 13:57:04,400 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:04,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-12-24 13:57:04,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-12-24 13:57:04,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 13:57:04,403 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 186 states. [2018-12-24 13:57:05,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:05,091 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-12-24 13:57:05,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-12-24 13:57:05,092 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 276 [2018-12-24 13:57:05,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:05,094 INFO L225 Difference]: With dead ends: 282 [2018-12-24 13:57:05,094 INFO L226 Difference]: Without dead ends: 281 [2018-12-24 13:57:05,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 642 GetRequests, 366 SyntacticMatches, 84 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30774 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=14535, Invalid=22907, Unknown=0, NotChecked=0, Total=37442 [2018-12-24 13:57:05,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-12-24 13:57:05,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 280. [2018-12-24 13:57:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-12-24 13:57:05,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-12-24 13:57:05,100 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2018-12-24 13:57:05,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:05,100 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-12-24 13:57:05,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-12-24 13:57:05,100 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-12-24 13:57:05,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-12-24 13:57:05,101 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:05,101 INFO L402 BasicCegarLoop]: trace histogram [93, 92, 92, 1, 1] [2018-12-24 13:57:05,101 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:05,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:05,101 INFO L82 PathProgramCache]: Analyzing trace with hash -90760160, now seen corresponding path program 92 times [2018-12-24 13:57:05,102 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:05,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:05,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:05,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:09,613 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:09,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:09,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:09,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:09,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:09,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:09,614 INFO L193 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-24 13:57:09,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:09,623 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:10,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 93 check-sat command(s) [2018-12-24 13:57:10,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:10,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:10,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:57:10,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:10,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:10,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:57:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:15,241 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12742 backedges. 0 proven. 12742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:19,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:19,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 193 [2018-12-24 13:57:19,761 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:19,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-12-24 13:57:19,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-12-24 13:57:19,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2018-12-24 13:57:19,763 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 188 states. [2018-12-24 13:57:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:20,587 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-12-24 13:57:20,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-12-24 13:57:20,587 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 279 [2018-12-24 13:57:20,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:20,589 INFO L225 Difference]: With dead ends: 285 [2018-12-24 13:57:20,589 INFO L226 Difference]: Without dead ends: 284 [2018-12-24 13:57:20,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 649 GetRequests, 370 SyntacticMatches, 86 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31271 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=14637, Invalid=23193, Unknown=0, NotChecked=0, Total=37830 [2018-12-24 13:57:20,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-12-24 13:57:20,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2018-12-24 13:57:20,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-12-24 13:57:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-12-24 13:57:20,596 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2018-12-24 13:57:20,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:20,597 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-12-24 13:57:20,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-12-24 13:57:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-12-24 13:57:20,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-12-24 13:57:20,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:20,598 INFO L402 BasicCegarLoop]: trace histogram [94, 93, 93, 1, 1] [2018-12-24 13:57:20,598 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:20,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1993511436, now seen corresponding path program 93 times [2018-12-24 13:57:20,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:20,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:20,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:20,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:20,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:24,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:24,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:24,787 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:24,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:24,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:24,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:24,787 INFO L193 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-24 13:57:24,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:57:24,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:57:24,909 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:57:24,909 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:24,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:24,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:57:24,929 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:24,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:24,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:57:30,048 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:30,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:34,545 INFO L134 CoverageAnalysis]: Checked inductivity of 13020 backedges. 0 proven. 13020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:34,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:34,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 194 [2018-12-24 13:57:34,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:34,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-12-24 13:57:34,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-12-24 13:57:34,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 13:57:34,567 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 190 states. [2018-12-24 13:57:35,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:35,353 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-12-24 13:57:35,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-12-24 13:57:35,353 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 282 [2018-12-24 13:57:35,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:35,355 INFO L225 Difference]: With dead ends: 288 [2018-12-24 13:57:35,355 INFO L226 Difference]: Without dead ends: 287 [2018-12-24 13:57:35,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 374 SyntacticMatches, 88 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31768 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=14739, Invalid=23481, Unknown=0, NotChecked=0, Total=38220 [2018-12-24 13:57:35,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-12-24 13:57:35,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 286. [2018-12-24 13:57:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-24 13:57:35,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-12-24 13:57:35,362 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2018-12-24 13:57:35,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:35,362 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-12-24 13:57:35,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-12-24 13:57:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-12-24 13:57:35,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-12-24 13:57:35,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:35,363 INFO L402 BasicCegarLoop]: trace histogram [95, 94, 94, 1, 1] [2018-12-24 13:57:35,363 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:35,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2108537696, now seen corresponding path program 94 times [2018-12-24 13:57:35,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:35,364 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:57:35,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:35,364 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:39,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:39,786 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:39,787 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:39,787 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:39,787 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:39,787 INFO L193 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-24 13:57:39,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:39,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:57:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:39,884 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:39,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:57:39,890 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:39,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:39,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:57:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:45,155 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:57:49,501 INFO L134 CoverageAnalysis]: Checked inductivity of 13301 backedges. 0 proven. 13301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:49,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:57:49,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 195 [2018-12-24 13:57:49,520 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:57:49,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-12-24 13:57:49,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-12-24 13:57:49,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2018-12-24 13:57:49,523 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 192 states. [2018-12-24 13:57:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:57:50,234 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-12-24 13:57:50,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-12-24 13:57:50,235 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 285 [2018-12-24 13:57:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:57:50,237 INFO L225 Difference]: With dead ends: 291 [2018-12-24 13:57:50,237 INFO L226 Difference]: Without dead ends: 290 [2018-12-24 13:57:50,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 663 GetRequests, 378 SyntacticMatches, 90 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32265 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=14841, Invalid=23771, Unknown=0, NotChecked=0, Total=38612 [2018-12-24 13:57:50,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-12-24 13:57:50,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-12-24 13:57:50,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-12-24 13:57:50,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-12-24 13:57:50,243 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2018-12-24 13:57:50,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:57:50,244 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-12-24 13:57:50,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-12-24 13:57:50,244 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-12-24 13:57:50,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-12-24 13:57:50,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:57:50,245 INFO L402 BasicCegarLoop]: trace histogram [96, 95, 95, 1, 1] [2018-12-24 13:57:50,245 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:57:50,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:57:50,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1549756020, now seen corresponding path program 95 times [2018-12-24 13:57:50,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:57:50,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:50,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:57:50,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:57:50,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:57:50,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:57:54,420 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:57:54,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:54,421 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:57:54,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:57:54,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:57:54,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:57:54,421 INFO L193 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-24 13:57:54,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:57:54,429 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:57:55,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 96 check-sat command(s) [2018-12-24 13:57:55,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:57:55,040 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:57:55,046 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:57:55,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:57:55,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:57:55,056 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:58:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:00,325 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:04,669 INFO L134 CoverageAnalysis]: Checked inductivity of 13585 backedges. 0 proven. 13585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:04,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:04,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 196 [2018-12-24 13:58:04,689 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:04,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-12-24 13:58:04,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-12-24 13:58:04,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 13:58:04,691 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 194 states. [2018-12-24 13:58:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:05,566 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2018-12-24 13:58:05,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-12-24 13:58:05,567 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 288 [2018-12-24 13:58:05,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:05,569 INFO L225 Difference]: With dead ends: 294 [2018-12-24 13:58:05,569 INFO L226 Difference]: Without dead ends: 293 [2018-12-24 13:58:05,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 382 SyntacticMatches, 92 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32762 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=14943, Invalid=24063, Unknown=0, NotChecked=0, Total=39006 [2018-12-24 13:58:05,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-12-24 13:58:05,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 292. [2018-12-24 13:58:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-12-24 13:58:05,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-12-24 13:58:05,576 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2018-12-24 13:58:05,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:05,577 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-12-24 13:58:05,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-12-24 13:58:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-12-24 13:58:05,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-12-24 13:58:05,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:05,579 INFO L402 BasicCegarLoop]: trace histogram [97, 96, 96, 1, 1] [2018-12-24 13:58:05,579 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:05,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:05,579 INFO L82 PathProgramCache]: Analyzing trace with hash 2116881696, now seen corresponding path program 96 times [2018-12-24 13:58:05,579 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:05,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:05,580 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:05,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:05,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:09,973 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:09,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:09,974 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:09,974 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:09,974 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:09,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:09,974 INFO L193 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-24 13:58:09,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:58:09,985 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:58:10,089 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:58:10,089 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:10,100 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:10,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:58:10,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:10,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:10,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:58:15,555 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:15,556 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:19,875 INFO L134 CoverageAnalysis]: Checked inductivity of 13872 backedges. 0 proven. 13872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:19,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:19,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 197 [2018-12-24 13:58:19,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:19,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-12-24 13:58:19,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-12-24 13:58:19,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2018-12-24 13:58:19,899 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 196 states. [2018-12-24 13:58:20,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:20,627 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-12-24 13:58:20,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-12-24 13:58:20,628 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 291 [2018-12-24 13:58:20,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:20,630 INFO L225 Difference]: With dead ends: 297 [2018-12-24 13:58:20,630 INFO L226 Difference]: Without dead ends: 296 [2018-12-24 13:58:20,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 677 GetRequests, 386 SyntacticMatches, 94 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33259 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=15045, Invalid=24357, Unknown=0, NotChecked=0, Total=39402 [2018-12-24 13:58:20,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-12-24 13:58:20,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2018-12-24 13:58:20,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-12-24 13:58:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-12-24 13:58:20,636 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2018-12-24 13:58:20,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:20,636 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-12-24 13:58:20,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-12-24 13:58:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-12-24 13:58:20,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-12-24 13:58:20,637 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:20,637 INFO L402 BasicCegarLoop]: trace histogram [98, 97, 97, 1, 1] [2018-12-24 13:58:20,638 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:20,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:20,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1017839884, now seen corresponding path program 97 times [2018-12-24 13:58:20,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:20,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:20,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:20,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:20,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:25,032 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:25,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:25,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:25,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:25,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:25,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:25,033 INFO L193 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-24 13:58:25,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:25,042 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:58:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:25,136 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:25,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:58:25,142 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:25,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:25,153 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:58:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:30,872 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 14162 backedges. 0 proven. 14162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:35,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:35,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 198 [2018-12-24 13:58:35,197 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:35,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-12-24 13:58:35,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-12-24 13:58:35,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 13:58:35,199 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 198 states. [2018-12-24 13:58:36,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:36,046 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-12-24 13:58:36,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-12-24 13:58:36,046 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 294 [2018-12-24 13:58:36,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:36,048 INFO L225 Difference]: With dead ends: 300 [2018-12-24 13:58:36,048 INFO L226 Difference]: Without dead ends: 299 [2018-12-24 13:58:36,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 684 GetRequests, 390 SyntacticMatches, 96 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33756 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=15147, Invalid=24653, Unknown=0, NotChecked=0, Total=39800 [2018-12-24 13:58:36,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-12-24 13:58:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2018-12-24 13:58:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-12-24 13:58:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-12-24 13:58:36,053 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2018-12-24 13:58:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:36,053 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-12-24 13:58:36,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-12-24 13:58:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-12-24 13:58:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-12-24 13:58:36,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:36,055 INFO L402 BasicCegarLoop]: trace histogram [99, 98, 98, 1, 1] [2018-12-24 13:58:36,055 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:36,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:36,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1084000, now seen corresponding path program 98 times [2018-12-24 13:58:36,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:36,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:36,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:58:36,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:36,056 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:40,442 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:40,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:40,442 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:40,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:40,443 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:40,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:40,443 INFO L193 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-24 13:58:40,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-24 13:58:40,452 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-24 13:58:41,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 99 check-sat command(s) [2018-12-24 13:58:41,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:41,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:41,122 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:58:41,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:41,188 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:41,188 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:58:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:46,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:58:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 14455 backedges. 0 proven. 14455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:51,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:58:51,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 199 [2018-12-24 13:58:51,273 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:58:51,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-12-24 13:58:51,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-12-24 13:58:51,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2018-12-24 13:58:51,276 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 200 states. [2018-12-24 13:58:52,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:58:52,140 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-12-24 13:58:52,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-12-24 13:58:52,140 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 297 [2018-12-24 13:58:52,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:58:52,142 INFO L225 Difference]: With dead ends: 303 [2018-12-24 13:58:52,142 INFO L226 Difference]: Without dead ends: 302 [2018-12-24 13:58:52,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 394 SyntacticMatches, 98 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34253 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=15249, Invalid=24951, Unknown=0, NotChecked=0, Total=40200 [2018-12-24 13:58:52,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-12-24 13:58:52,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-12-24 13:58:52,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-12-24 13:58:52,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-12-24 13:58:52,150 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2018-12-24 13:58:52,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:58:52,150 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-12-24 13:58:52,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-12-24 13:58:52,150 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-12-24 13:58:52,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-12-24 13:58:52,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:58:52,152 INFO L402 BasicCegarLoop]: trace histogram [100, 99, 99, 1, 1] [2018-12-24 13:58:52,152 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:58:52,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:58:52,153 INFO L82 PathProgramCache]: Analyzing trace with hash 2066335884, now seen corresponding path program 99 times [2018-12-24 13:58:52,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:58:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:52,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:58:52,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:58:52,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:58:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:58:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:58:56,870 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:56,870 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:58:56,870 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:58:56,870 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:58:56,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:58:56,871 INFO L193 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-24 13:58:56,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-24 13:58:56,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-24 13:58:57,006 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-24 13:58:57,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-24 13:58:57,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:58:57,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-12-24 13:58:57,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-24 13:58:57,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-24 13:58:57,060 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-12-24 13:59:02,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:02,703 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 14751 backedges. 0 proven. 14751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:07,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-24 13:59:07,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 200 [2018-12-24 13:59:07,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-24 13:59:07,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-12-24 13:59:07,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-12-24 13:59:07,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 13:59:07,278 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 202 states. [2018-12-24 13:59:08,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:08,045 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-12-24 13:59:08,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-24 13:59:08,046 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 300 [2018-12-24 13:59:08,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:08,047 INFO L225 Difference]: With dead ends: 306 [2018-12-24 13:59:08,047 INFO L226 Difference]: Without dead ends: 305 [2018-12-24 13:59:08,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 698 GetRequests, 399 SyntacticMatches, 99 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34551 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=15351, Invalid=25251, Unknown=0, NotChecked=0, Total=40602 [2018-12-24 13:59:08,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-12-24 13:59:08,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 304. [2018-12-24 13:59:08,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-24 13:59:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-12-24 13:59:08,054 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2018-12-24 13:59:08,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:08,054 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-12-24 13:59:08,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-12-24 13:59:08,054 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-12-24 13:59:08,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-12-24 13:59:08,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-24 13:59:08,056 INFO L402 BasicCegarLoop]: trace histogram [101, 100, 100, 1, 1] [2018-12-24 13:59:08,056 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-12-24 13:59:08,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-24 13:59:08,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1553891808, now seen corresponding path program 100 times [2018-12-24 13:59:08,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-24 13:59:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:08,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-24 13:59:08,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-24 13:59:08,057 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-24 13:59:08,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:12,719 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 14752 proven. 298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:12,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:12,719 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-24 13:59:12,719 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-24 13:59:12,720 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-24 13:59:12,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-24 13:59:12,720 INFO L193 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-24 13:59:12,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-24 13:59:12,729 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-24 13:59:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-24 13:59:12,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-24 13:59:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:12,999 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-24 13:59:17,404 INFO L134 CoverageAnalysis]: Checked inductivity of 15050 backedges. 15050 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-24 13:59:17,423 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-24 13:59:17,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [102, 102] imperfect sequences [102] total 103 [2018-12-24 13:59:17,424 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-24 13:59:17,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-12-24 13:59:17,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-12-24 13:59:17,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 13:59:17,425 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 103 states. [2018-12-24 13:59:18,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-24 13:59:18,169 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-12-24 13:59:18,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-12-24 13:59:18,170 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 303 [2018-12-24 13:59:18,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-24 13:59:18,171 INFO L225 Difference]: With dead ends: 306 [2018-12-24 13:59:18,171 INFO L226 Difference]: Without dead ends: 0 [2018-12-24 13:59:18,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 504 SyntacticMatches, 100 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5544 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=5256, Invalid=5456, Unknown=0, NotChecked=0, Total=10712 [2018-12-24 13:59:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-24 13:59:18,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-24 13:59:18,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-24 13:59:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-24 13:59:18,174 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 303 [2018-12-24 13:59:18,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-24 13:59:18,174 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-24 13:59:18,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-12-24 13:59:18,186 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-24 13:59:18,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-24 13:59:18,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-24 13:59:18,330 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 511 [2018-12-24 13:59:21,360 WARN L181 SmtUtils]: Spent 3.02 s on a formula simplification. DAG size of input: 511 DAG size of output: 509 [2018-12-24 13:59:21,367 INFO L448 ceAbstractionStarter]: For program point mainENTRY(lines 2 23) no Hoare annotation was computed. [2018-12-24 13:59:21,367 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 2 23) no Hoare annotation was computed. [2018-12-24 13:59:21,367 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONASSERT(line 15) no Hoare annotation was computed. [2018-12-24 13:59:21,367 INFO L448 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-12-24 13:59:21,367 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 19) no Hoare annotation was computed. [2018-12-24 13:59:21,374 INFO L444 ceAbstractionStarter]: At program point L12-1(lines 12 21) the Hoare annotation is: (let ((.cse0 (<= 400 (select |#length| main_q.base)))) (or (and (<= main_q.offset 112) (<= (+ main_p.offset 112) main_q.offset) .cse0) (and (<= main_q.offset 260) (<= (+ main_p.offset 260) main_q.offset) .cse0) (and (<= (+ main_p.offset 128) main_q.offset) (<= main_q.offset 128) .cse0) (and (<= (+ main_p.offset 196) main_q.offset) (<= main_q.offset 196) .cse0) (and (<= main_q.offset 124) (<= (+ main_p.offset 124) main_q.offset) .cse0) (and (<= (+ main_p.offset 308) main_q.offset) (<= main_q.offset 308) .cse0) (and (<= main_q.offset 240) (<= (+ main_p.offset 240) main_q.offset) .cse0) (and (<= main_q.offset 332) (<= (+ main_p.offset 332) main_q.offset) .cse0) (and (<= (+ main_p.offset 296) main_q.offset) (<= main_q.offset 296) .cse0) (and (<= (+ main_p.offset 268) main_q.offset) (<= main_q.offset 268) .cse0) (and (<= main_q.offset 160) (<= (+ main_p.offset 160) main_q.offset) .cse0) (and (<= main_q.offset 180) (<= (+ main_p.offset 180) main_q.offset) .cse0) (and (<= (+ main_p.offset 368) main_q.offset) (<= main_q.offset 368) .cse0) (and (<= main_q.offset 384) (<= (+ main_p.offset 384) main_q.offset) .cse0) (and (<= main_q.offset 392) (<= (+ main_p.offset 392) main_q.offset) .cse0) (and (<= main_q.offset 144) .cse0 (<= (+ main_p.offset 144) main_q.offset)) (and (<= main_q.offset 200) (<= (+ main_p.offset 200) main_q.offset) .cse0) (and (<= (+ main_p.offset 288) main_q.offset) (<= main_q.offset 288) .cse0) (and (<= main_q.offset 340) (<= (+ main_p.offset 340) main_q.offset) .cse0) (and (<= main_q.offset 356) (<= (+ main_p.offset 356) main_q.offset) .cse0) (and (<= (+ main_p.offset 276) main_q.offset) (<= main_q.offset 276) .cse0) (and (<= main_q.offset 336) (<= (+ main_p.offset 336) main_q.offset) .cse0) (and (<= (+ main_p.offset 140) main_q.offset) (<= main_q.offset 140) .cse0) (and (<= main_q.offset 244) (<= (+ main_p.offset 244) main_q.offset) .cse0) (and (<= (+ main_p.offset 396) main_q.offset) (<= main_q.offset 396) .cse0) (and (<= (+ main_p.offset 312) main_q.offset) (<= main_q.offset 312) .cse0) (and (<= main_q.offset 148) (<= (+ main_p.offset 148) main_q.offset) .cse0) (and (<= (+ main_p.offset 352) main_q.offset) (<= main_q.offset 352) .cse0) (and (<= main_q.offset 344) (<= (+ main_p.offset 344) main_q.offset) .cse0) (and (<= main_q.offset 164) (<= (+ main_p.offset 164) main_q.offset) .cse0) (and (<= (+ main_p.offset 304) main_q.offset) (<= main_q.offset 304) .cse0) (and (<= main_q.offset 320) (<= (+ main_p.offset 320) main_q.offset) .cse0) (and (<= (+ main_p.offset 36) main_q.offset) (<= main_q.offset 36) .cse0) (and (<= (+ main_p.offset 44) main_q.offset) (<= main_q.offset 44) .cse0) (and (<= (+ main_p.offset 228) main_q.offset) (<= main_q.offset 228) .cse0) (and (<= main_p.offset main_q.offset) (<= main_q.offset 0) .cse0) (and (<= (+ main_p.offset 284) main_q.offset) (<= main_q.offset 284) .cse0) (and (<= (+ main_p.offset 188) main_q.offset) (<= main_q.offset 188) .cse0) (and (<= (+ main_p.offset 8) main_q.offset) (<= main_q.offset 8) .cse0) (and (<= main_q.offset 348) .cse0 (<= (+ main_p.offset 348) main_q.offset)) (<= (+ main_p.offset 400) main_q.offset) (and (<= (+ main_p.offset 224) main_q.offset) (<= main_q.offset 224) .cse0) (and (<= (+ main_p.offset 120) main_q.offset) (<= main_q.offset 120) .cse0) (and (<= main_q.offset 232) (<= (+ main_p.offset 232) main_q.offset) .cse0) (and (<= main_q.offset 92) (<= (+ main_p.offset 92) main_q.offset) .cse0) (and (<= main_q.offset 236) (<= (+ main_p.offset 236) main_q.offset) .cse0) (and (<= (+ main_p.offset 328) main_q.offset) (<= main_q.offset 328) .cse0) (and (<= main_q.offset 12) (<= (+ main_p.offset 12) main_q.offset) .cse0) (and (<= (+ main_p.offset 64) main_q.offset) (<= main_q.offset 64) .cse0) (and (<= (+ main_p.offset 192) main_q.offset) (<= main_q.offset 192) .cse0) (and (<= (+ main_p.offset 104) main_q.offset) (<= main_q.offset 104) .cse0) (and (<= main_q.offset 280) (<= (+ main_p.offset 280) main_q.offset) .cse0) (and (<= (+ main_p.offset 316) main_q.offset) (<= main_q.offset 316) .cse0) (and (<= main_q.offset 152) (<= (+ main_p.offset 152) main_q.offset) .cse0) (and (<= (+ main_p.offset 248) main_q.offset) (<= main_q.offset 248) .cse0) (and (<= main_q.offset 28) (<= (+ main_p.offset 28) main_q.offset) .cse0) (and (<= (+ main_p.offset 68) main_q.offset) (<= main_q.offset 68) .cse0) (and (<= main_q.offset 4) .cse0 (<= (+ main_p.offset 4) main_q.offset)) (and (<= (+ main_p.offset 204) main_q.offset) (<= main_q.offset 204) .cse0) (and (<= main_q.offset 380) (<= (+ main_p.offset 380) main_q.offset) .cse0) (and (<= main_q.offset 52) (<= (+ main_p.offset 52) main_q.offset) .cse0) (and (<= (+ main_p.offset 172) main_q.offset) (<= main_q.offset 172) .cse0) (and (<= main_q.offset 56) (<= (+ main_p.offset 56) main_q.offset) .cse0) (and (<= main_q.offset 60) (<= (+ main_p.offset 60) main_q.offset) .cse0) (and (<= main_q.offset 100) (<= (+ main_p.offset 100) main_q.offset) .cse0) (and (<= main_q.offset 208) (<= (+ main_p.offset 208) main_q.offset) .cse0) (and (<= (+ main_p.offset 220) main_q.offset) (<= main_q.offset 220) .cse0) (and (<= (+ main_p.offset 132) main_q.offset) (<= main_q.offset 132) .cse0) (and (<= main_q.offset 176) (<= (+ main_p.offset 176) main_q.offset) .cse0) (and (<= main_q.offset 116) (<= (+ main_p.offset 116) main_q.offset) .cse0) (and (<= (+ main_p.offset 136) main_q.offset) (<= main_q.offset 136) .cse0) (and (<= main_q.offset 184) (<= (+ main_p.offset 184) main_q.offset) .cse0) (and (<= main_q.offset 20) (<= (+ main_p.offset 20) main_q.offset) .cse0) (and (<= (+ main_p.offset 216) main_q.offset) (<= main_q.offset 216) .cse0) (and (<= (+ main_p.offset 376) main_q.offset) (<= main_q.offset 376) .cse0) (and (<= (+ main_p.offset 324) main_q.offset) (<= main_q.offset 324) .cse0) (and (<= (+ main_p.offset 72) main_q.offset) (<= main_q.offset 72) .cse0) (and (<= main_q.offset 76) (<= (+ main_p.offset 76) main_q.offset) .cse0) (and (<= main_q.offset 16) (<= (+ main_p.offset 16) main_q.offset) .cse0) (and (<= main_q.offset 84) (<= (+ main_p.offset 84) main_q.offset) .cse0) (and (<= (+ main_p.offset 364) main_q.offset) (<= main_q.offset 364) .cse0) (and (<= (+ main_p.offset 156) main_q.offset) (<= main_q.offset 156) .cse0) (and (<= (+ main_p.offset 88) main_q.offset) .cse0 (<= main_q.offset 88)) (and (<= main_q.offset 168) (<= (+ main_p.offset 168) main_q.offset) .cse0) (and (<= (+ main_p.offset 48) main_q.offset) (<= main_q.offset 48) .cse0) (and (<= main_q.offset 252) (<= (+ main_p.offset 252) main_q.offset) .cse0) (and (<= (+ main_p.offset 264) main_q.offset) (<= main_q.offset 264) .cse0) (and (<= (+ main_p.offset 388) main_q.offset) (<= main_q.offset 388) .cse0) (and (<= main_q.offset 256) (<= (+ main_p.offset 256) main_q.offset) .cse0) (and (<= (+ main_p.offset 40) main_q.offset) (<= main_q.offset 40) .cse0) (and (<= main_q.offset 300) .cse0 (<= (+ main_p.offset 300) main_q.offset)) (and (<= (+ main_p.offset 80) main_q.offset) (<= main_q.offset 80) .cse0) (and (<= main_q.offset 108) .cse0 (<= (+ main_p.offset 108) main_q.offset)) (and (<= main_q.offset 212) (<= (+ main_p.offset 212) main_q.offset) .cse0) (and (<= main_q.offset 372) (<= (+ main_p.offset 372) main_q.offset) .cse0) (and (<= (+ main_p.offset 96) main_q.offset) .cse0 (<= main_q.offset 96)) (and (<= (+ main_p.offset 272) main_q.offset) (<= main_q.offset 272) .cse0) (and (<= main_q.offset 292) (<= (+ main_p.offset 292) main_q.offset) .cse0) (and (<= (+ main_p.offset 360) main_q.offset) (<= main_q.offset 360) .cse0) (and (<= main_q.offset 32) (<= (+ main_p.offset 32) main_q.offset) .cse0) (and (<= (+ main_p.offset 24) main_q.offset) (<= main_q.offset 24) .cse0))) [2018-12-24 13:59:21,374 INFO L448 ceAbstractionStarter]: For program point L12-2(lines 2 23) no Hoare annotation was computed. [2018-12-24 13:59:21,454 INFO L202 PluginConnector]: Adding new model PointerIncrement-simplified03.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:59:21 BoogieIcfgContainer [2018-12-24 13:59:21,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-24 13:59:21,456 INFO L168 Benchmark]: Toolchain (without parser) took 727479.92 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 597.7 MB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 123.9 MB). Peak memory consumption was 721.6 MB. Max. memory is 7.1 GB. [2018-12-24 13:59:21,456 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:59:21,457 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:59:21,457 INFO L168 Benchmark]: Boogie Preprocessor took 30.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-24 13:59:21,457 INFO L168 Benchmark]: RCFGBuilder took 268.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-24 13:59:21,457 INFO L168 Benchmark]: TraceAbstraction took 727109.09 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 597.7 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 102.8 MB). Peak memory consumption was 700.5 MB. Max. memory is 7.1 GB. [2018-12-24 13:59:21,459 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.36 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.51 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 268.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 727109.09 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 597.7 MB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 102.8 MB). Peak memory consumption was 700.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((q!offset <= 112 && p!offset + 112 <= q!offset) && 400 <= #length[q!base]) || ((q!offset <= 260 && p!offset + 260 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 128 <= q!offset && q!offset <= 128) && 400 <= #length[q!base])) || ((p!offset + 196 <= q!offset && q!offset <= 196) && 400 <= #length[q!base])) || ((q!offset <= 124 && p!offset + 124 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 308 <= q!offset && q!offset <= 308) && 400 <= #length[q!base])) || ((q!offset <= 240 && p!offset + 240 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 332 && p!offset + 332 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 296 <= q!offset && q!offset <= 296) && 400 <= #length[q!base])) || ((p!offset + 268 <= q!offset && q!offset <= 268) && 400 <= #length[q!base])) || ((q!offset <= 160 && p!offset + 160 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 180 && p!offset + 180 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 368 <= q!offset && q!offset <= 368) && 400 <= #length[q!base])) || ((q!offset <= 384 && p!offset + 384 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 392 && p!offset + 392 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 144 && 400 <= #length[q!base]) && p!offset + 144 <= q!offset)) || ((q!offset <= 200 && p!offset + 200 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 288 <= q!offset && q!offset <= 288) && 400 <= #length[q!base])) || ((q!offset <= 340 && p!offset + 340 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 356 && p!offset + 356 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 276 <= q!offset && q!offset <= 276) && 400 <= #length[q!base])) || ((q!offset <= 336 && p!offset + 336 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 140 <= q!offset && q!offset <= 140) && 400 <= #length[q!base])) || ((q!offset <= 244 && p!offset + 244 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 396 <= q!offset && q!offset <= 396) && 400 <= #length[q!base])) || ((p!offset + 312 <= q!offset && q!offset <= 312) && 400 <= #length[q!base])) || ((q!offset <= 148 && p!offset + 148 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 352 <= q!offset && q!offset <= 352) && 400 <= #length[q!base])) || ((q!offset <= 344 && p!offset + 344 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 164 && p!offset + 164 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 304 <= q!offset && q!offset <= 304) && 400 <= #length[q!base])) || ((q!offset <= 320 && p!offset + 320 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 36 <= q!offset && q!offset <= 36) && 400 <= #length[q!base])) || ((p!offset + 44 <= q!offset && q!offset <= 44) && 400 <= #length[q!base])) || ((p!offset + 228 <= q!offset && q!offset <= 228) && 400 <= #length[q!base])) || ((p!offset <= q!offset && q!offset <= 0) && 400 <= #length[q!base])) || ((p!offset + 284 <= q!offset && q!offset <= 284) && 400 <= #length[q!base])) || ((p!offset + 188 <= q!offset && q!offset <= 188) && 400 <= #length[q!base])) || ((p!offset + 8 <= q!offset && q!offset <= 8) && 400 <= #length[q!base])) || ((q!offset <= 348 && 400 <= #length[q!base]) && p!offset + 348 <= q!offset)) || p!offset + 400 <= q!offset) || ((p!offset + 224 <= q!offset && q!offset <= 224) && 400 <= #length[q!base])) || ((p!offset + 120 <= q!offset && q!offset <= 120) && 400 <= #length[q!base])) || ((q!offset <= 232 && p!offset + 232 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 92 && p!offset + 92 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 236 && p!offset + 236 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 328 <= q!offset && q!offset <= 328) && 400 <= #length[q!base])) || ((q!offset <= 12 && p!offset + 12 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 64 <= q!offset && q!offset <= 64) && 400 <= #length[q!base])) || ((p!offset + 192 <= q!offset && q!offset <= 192) && 400 <= #length[q!base])) || ((p!offset + 104 <= q!offset && q!offset <= 104) && 400 <= #length[q!base])) || ((q!offset <= 280 && p!offset + 280 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 316 <= q!offset && q!offset <= 316) && 400 <= #length[q!base])) || ((q!offset <= 152 && p!offset + 152 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 248 <= q!offset && q!offset <= 248) && 400 <= #length[q!base])) || ((q!offset <= 28 && p!offset + 28 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 68 <= q!offset && q!offset <= 68) && 400 <= #length[q!base])) || ((q!offset <= 4 && 400 <= #length[q!base]) && p!offset + 4 <= q!offset)) || ((p!offset + 204 <= q!offset && q!offset <= 204) && 400 <= #length[q!base])) || ((q!offset <= 380 && p!offset + 380 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 52 && p!offset + 52 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 172 <= q!offset && q!offset <= 172) && 400 <= #length[q!base])) || ((q!offset <= 56 && p!offset + 56 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 60 && p!offset + 60 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 100 && p!offset + 100 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 208 && p!offset + 208 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 220 <= q!offset && q!offset <= 220) && 400 <= #length[q!base])) || ((p!offset + 132 <= q!offset && q!offset <= 132) && 400 <= #length[q!base])) || ((q!offset <= 176 && p!offset + 176 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 116 && p!offset + 116 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 136 <= q!offset && q!offset <= 136) && 400 <= #length[q!base])) || ((q!offset <= 184 && p!offset + 184 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 20 && p!offset + 20 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 216 <= q!offset && q!offset <= 216) && 400 <= #length[q!base])) || ((p!offset + 376 <= q!offset && q!offset <= 376) && 400 <= #length[q!base])) || ((p!offset + 324 <= q!offset && q!offset <= 324) && 400 <= #length[q!base])) || ((p!offset + 72 <= q!offset && q!offset <= 72) && 400 <= #length[q!base])) || ((q!offset <= 76 && p!offset + 76 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 16 && p!offset + 16 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 84 && p!offset + 84 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 364 <= q!offset && q!offset <= 364) && 400 <= #length[q!base])) || ((p!offset + 156 <= q!offset && q!offset <= 156) && 400 <= #length[q!base])) || ((p!offset + 88 <= q!offset && 400 <= #length[q!base]) && q!offset <= 88)) || ((q!offset <= 168 && p!offset + 168 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 48 <= q!offset && q!offset <= 48) && 400 <= #length[q!base])) || ((q!offset <= 252 && p!offset + 252 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 264 <= q!offset && q!offset <= 264) && 400 <= #length[q!base])) || ((p!offset + 388 <= q!offset && q!offset <= 388) && 400 <= #length[q!base])) || ((q!offset <= 256 && p!offset + 256 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 40 <= q!offset && q!offset <= 40) && 400 <= #length[q!base])) || ((q!offset <= 300 && 400 <= #length[q!base]) && p!offset + 300 <= q!offset)) || ((p!offset + 80 <= q!offset && q!offset <= 80) && 400 <= #length[q!base])) || ((q!offset <= 108 && 400 <= #length[q!base]) && p!offset + 108 <= q!offset)) || ((q!offset <= 212 && p!offset + 212 <= q!offset) && 400 <= #length[q!base])) || ((q!offset <= 372 && p!offset + 372 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 96 <= q!offset && 400 <= #length[q!base]) && q!offset <= 96)) || ((p!offset + 272 <= q!offset && q!offset <= 272) && 400 <= #length[q!base])) || ((q!offset <= 292 && p!offset + 292 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 360 <= q!offset && q!offset <= 360) && 400 <= #length[q!base])) || ((q!offset <= 32 && p!offset + 32 <= q!offset) && 400 <= #length[q!base])) || ((p!offset + 24 <= q!offset && q!offset <= 24) && 400 <= #length[q!base]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. SAFE Result, 726.9s OverallTime, 101 OverallIterations, 101 TraceHistogramMax, 41.6s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 202 SDtfs, 7321 SDslu, 1 SDs, 0 SdLazy, 27597 SolverSat, 353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 26.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35852 GetRequests, 20503 SyntacticMatches, 2649 SemanticMatches, 12700 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303168 ImplicationChecksByTransitivity, 635.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=304occurred in iteration=100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 101 MinimizatonAttempts, 100 StatesRemovedByMinimization, 100 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 102 NumberOfFragments, 1404 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 1 FomulaSimplificationsInter, 7 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 13.0s SatisfiabilityAnalysisTime, 659.4s InterpolantComputationTime, 30903 NumberOfCodeBlocks, 30903 NumberOfCodeBlocksAsserted, 1884 NumberOfCheckSat, 46052 ConstructedInterpolants, 0 QuantifiedInterpolants, 70702786 SizeOfPredicates, 596 NumberOfNonLiveVariables, 32500 ConjunctsInSsa, 15942 ConjunctsInUnsatCore, 301 InterpolantComputations, 3 PerfectInterpolantSequences, 44852/1530150 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...