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/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:26:35,960 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:26:35,962 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:26:35,979 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:26:35,979 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:26:35,981 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:26:35,982 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:26:35,984 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:26:35,987 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:26:35,988 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:26:35,996 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:26:35,997 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:26:35,998 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:26:36,001 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:26:36,003 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:26:36,004 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:26:36,005 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:26:36,007 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:26:36,011 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:26:36,014 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:26:36,015 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:26:36,017 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:26:36,021 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:26:36,021 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:26:36,021 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:26:36,023 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:26:36,025 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:26:36,026 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:26:36,027 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:26:36,028 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:26:36,028 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:26:36,030 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:26:36,030 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:26:36,031 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:26:36,032 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:26:36,032 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:26:36,033 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 [2019-01-18 17:26:36,061 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:26:36,061 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:26:36,062 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:26:36,062 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:26:36,062 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:26:36,062 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:26:36,063 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:26:36,063 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:26:36,063 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 17:26:36,063 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:26:36,063 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 17:26:36,064 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-18 17:26:36,065 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:26:36,069 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:26:36,070 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:26:36,070 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:26:36,070 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:26:36,070 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:26:36,071 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:26:36,071 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:26:36,071 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:26:36,073 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:26:36,073 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:26:36,073 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:26:36,073 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:26:36,074 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:26:36,074 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:26:36,074 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:26:36,074 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:26:36,074 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:26:36,074 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:26:36,076 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:26:36,076 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:26:36,076 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:26:36,076 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:26:36,077 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:26:36,077 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:26:36,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:26:36,077 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:26:36,077 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:26:36,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:26:36,125 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:26:36,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:26:36,130 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:26:36,131 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:26:36,132 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2019-01-18 17:26:36,132 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2019-01-18 17:26:36,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:26:36,176 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:26:36,177 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:26:36,177 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:26:36,177 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:26:36,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,214 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:26:36,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:26:36,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:26:36,216 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:26:36,227 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,227 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,235 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,236 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/1) ... [2019-01-18 17:26:36,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:26:36,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:26:36,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:26:36,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:26:36,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (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 [2019-01-18 17:26:36,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:26:36,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:26:36,614 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:26:36,614 INFO L286 CfgBuilder]: Removed 3 assue(true) statements. [2019-01-18 17:26:36,615 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:26:36 BoogieIcfgContainer [2019-01-18 17:26:36,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:26:36,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:26:36,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:26:36,620 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:26:36,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:26:36" (1/2) ... [2019-01-18 17:26:36,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b1f167 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:26:36, skipping insertion in model container [2019-01-18 17:26:36,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:26:36" (2/2) ... [2019-01-18 17:26:36,625 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2019-01-18 17:26:36,636 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:26:36,645 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 17:26:36,662 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 17:26:36,704 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:26:36,704 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:26:36,704 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:26:36,704 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:26:36,704 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:26:36,705 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:26:36,705 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:26:36,705 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:26:36,724 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-01-18 17:26:36,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:26:36,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:36,742 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:26:36,745 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:36,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:36,750 INFO L82 PathProgramCache]: Analyzing trace with hash 928714, now seen corresponding path program 1 times [2019-01-18 17:26:36,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:36,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:36,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:36,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:36,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:26:36,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:26:36,906 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:26:36,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:26:36,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:26:36,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:26:36,931 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 3 states. [2019-01-18 17:26:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:37,043 INFO L93 Difference]: Finished difference Result 10 states and 12 transitions. [2019-01-18 17:26:37,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:26:37,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2019-01-18 17:26:37,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:37,056 INFO L225 Difference]: With dead ends: 10 [2019-01-18 17:26:37,057 INFO L226 Difference]: Without dead ends: 6 [2019-01-18 17:26:37,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:26:37,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-18 17:26:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-18 17:26:37,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 17:26:37,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-01-18 17:26:37,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 4 [2019-01-18 17:26:37,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:37,095 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-01-18 17:26:37,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:26:37,095 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-01-18 17:26:37,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:26:37,096 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:37,096 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-18 17:26:37,096 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:37,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:37,097 INFO L82 PathProgramCache]: Analyzing trace with hash 28791948, now seen corresponding path program 1 times [2019-01-18 17:26:37,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:37,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:37,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:37,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:37,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:26:37,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-18 17:26:37,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:26:37,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:26:37,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:26:37,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:26:37,195 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-01-18 17:26:37,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:37,239 INFO L93 Difference]: Finished difference Result 11 states and 13 transitions. [2019-01-18 17:26:37,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:26:37,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-01-18 17:26:37,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:37,240 INFO L225 Difference]: With dead ends: 11 [2019-01-18 17:26:37,240 INFO L226 Difference]: Without dead ends: 7 [2019-01-18 17:26:37,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-18 17:26:37,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-18 17:26:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-18 17:26:37,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 17:26:37,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-01-18 17:26:37,244 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-01-18 17:26:37,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:37,244 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-01-18 17:26:37,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:26:37,245 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-01-18 17:26:37,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:26:37,245 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:37,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-18 17:26:37,246 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:37,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:37,246 INFO L82 PathProgramCache]: Analyzing trace with hash 894131125, now seen corresponding path program 1 times [2019-01-18 17:26:37,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:37,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:37,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:37,248 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:37,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:37,497 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:37,498 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:37,498 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:37,499 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-01-18 17:26:37,501 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [12], [14], [16] [2019-01-18 17:26:37,553 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-18 17:26:37,553 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:26:37,728 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:26:37,730 INFO L272 AbstractInterpreter]: Visited 6 different actions 16 times. Merged at 2 different actions 5 times. Never widened. Performed 274 root evaluator evaluations with a maximum evaluation depth of 4. Performed 274 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 7 fixpoints after 4 different actions. Largest state had 0 variables. [2019-01-18 17:26:37,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:37,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:26:37,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:37,744 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 [2019-01-18 17:26:37,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:37,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:37,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:37,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:38,294 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 8 treesize of output 7 [2019-01-18 17:26:38,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:38,311 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:38,312 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:26:38,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,408 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:38,523 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:26:38,524 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:38,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:38,546 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:26:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:38,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:38,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-18 17:26:38,605 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:38,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:26:38,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:26:38,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:26:38,607 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 10 states. [2019-01-18 17:26:38,767 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2019-01-18 17:26:38,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:38,968 INFO L93 Difference]: Finished difference Result 12 states and 14 transitions. [2019-01-18 17:26:38,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:26:38,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2019-01-18 17:26:38,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:38,969 INFO L225 Difference]: With dead ends: 12 [2019-01-18 17:26:38,969 INFO L226 Difference]: Without dead ends: 8 [2019-01-18 17:26:38,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:26:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-18 17:26:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-18 17:26:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 17:26:38,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2019-01-18 17:26:38,974 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 6 [2019-01-18 17:26:38,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:38,975 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2019-01-18 17:26:38,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:26:38,975 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2019-01-18 17:26:38,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:26:38,975 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:38,976 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2019-01-18 17:26:38,976 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:38,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:38,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1949841836, now seen corresponding path program 2 times [2019-01-18 17:26:38,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:38,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:38,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:38,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:38,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:39,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:39,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:39,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,078 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 [2019-01-18 17:26:39,095 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:39,095 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:39,131 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:26:39,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:39,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,137 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:39,185 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:39,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2019-01-18 17:26:39,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:39,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:26:39,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:26:39,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-18 17:26:39,205 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 5 states. [2019-01-18 17:26:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:39,544 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2019-01-18 17:26:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:26:39,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-01-18 17:26:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:39,545 INFO L225 Difference]: With dead ends: 11 [2019-01-18 17:26:39,546 INFO L226 Difference]: Without dead ends: 9 [2019-01-18 17:26:39,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:26:39,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-18 17:26:39,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-18 17:26:39,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-18 17:26:39,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2019-01-18 17:26:39,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 7 [2019-01-18 17:26:39,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:39,550 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2019-01-18 17:26:39,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:26:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2019-01-18 17:26:39,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:26:39,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:39,551 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2019-01-18 17:26:39,552 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:39,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:39,552 INFO L82 PathProgramCache]: Analyzing trace with hash 315556586, now seen corresponding path program 3 times [2019-01-18 17:26:39,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:39,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:39,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:39,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:39,729 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:39,730 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,730 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:39,730 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:39,730 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:39,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:39,731 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 [2019-01-18 17:26:39,740 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:39,740 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:39,758 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:39,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:39,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:39,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 8 treesize of output 7 [2019-01-18 17:26:39,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:39,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:39,830 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:26:39,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:26:39,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:39,934 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:26:39,935 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:39,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:39,950 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:26:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-18 17:26:40,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:40,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 14 [2019-01-18 17:26:40,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:40,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:26:40,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:26:40,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:26:40,145 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 11 states. [2019-01-18 17:26:40,446 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2019-01-18 17:26:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:40,687 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2019-01-18 17:26:40,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-18 17:26:40,688 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 8 [2019-01-18 17:26:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:40,688 INFO L225 Difference]: With dead ends: 17 [2019-01-18 17:26:40,688 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 17:26:40,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:26:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 17:26:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-18 17:26:40,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 17:26:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2019-01-18 17:26:40,694 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2019-01-18 17:26:40,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:40,695 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2019-01-18 17:26:40,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:26:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2019-01-18 17:26:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:26:40,696 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:40,696 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1] [2019-01-18 17:26:40,696 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:40,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:40,697 INFO L82 PathProgramCache]: Analyzing trace with hash -175395819, now seen corresponding path program 4 times [2019-01-18 17:26:40,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:40,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:40,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:40,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:40,892 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:40,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:40,893 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:40,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:40,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:40,893 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 [2019-01-18 17:26:40,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:40,903 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:40,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:41,043 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 8 treesize of output 7 [2019-01-18 17:26:41,044 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:41,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:41,054 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:26:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:41,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:26:41,098 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:41,100 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:41,101 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:26:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:41,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2019-01-18 17:26:41,309 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:41,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-18 17:26:41,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-18 17:26:41,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:26:41,310 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 16 states. [2019-01-18 17:26:41,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:41,732 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2019-01-18 17:26:41,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-18 17:26:41,732 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 10 [2019-01-18 17:26:41,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:41,733 INFO L225 Difference]: With dead ends: 18 [2019-01-18 17:26:41,734 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 17:26:41,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:26:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 17:26:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-18 17:26:41,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:26:41,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2019-01-18 17:26:41,739 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 10 [2019-01-18 17:26:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:41,739 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2019-01-18 17:26:41,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-18 17:26:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2019-01-18 17:26:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-18 17:26:41,740 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:41,740 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1] [2019-01-18 17:26:41,740 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:41,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:41,740 INFO L82 PathProgramCache]: Analyzing trace with hash 375043724, now seen corresponding path program 5 times [2019-01-18 17:26:41,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:41,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:41,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:41,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:41,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:41,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:41,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:41,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:41,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:41,814 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 [2019-01-18 17:26:41,823 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:41,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:41,859 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-18 17:26:41,859 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:41,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:41,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:41,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:41,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2019-01-18 17:26:41,959 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:41,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:26:41,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:26:41,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-18 17:26:41,960 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 7 states. [2019-01-18 17:26:42,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:42,090 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2019-01-18 17:26:42,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:26:42,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-01-18 17:26:42,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:42,091 INFO L225 Difference]: With dead ends: 15 [2019-01-18 17:26:42,091 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 17:26:42,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 17 SyntacticMatches, 8 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:26:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 17:26:42,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-18 17:26:42,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 17:26:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2019-01-18 17:26:42,096 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2019-01-18 17:26:42,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:42,096 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2019-01-18 17:26:42,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:26:42,097 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2019-01-18 17:26:42,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-18 17:26:42,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:42,097 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2019-01-18 17:26:42,098 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:42,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:42,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1258544630, now seen corresponding path program 6 times [2019-01-18 17:26:42,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:42,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:42,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:42,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:42,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:42,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:42,298 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:42,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:42,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:42,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:42,299 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 [2019-01-18 17:26:42,314 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:42,315 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:42,328 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:42,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:42,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:42,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 8 treesize of output 7 [2019-01-18 17:26:42,428 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:42,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:42,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:26:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-18 17:26:42,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:42,522 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:26:42,522 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:42,531 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:42,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:26:42,639 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-18 17:26:42,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:42,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 22 [2019-01-18 17:26:42,659 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:42,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-18 17:26:42,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-18 17:26:42,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:26:42,660 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 17 states. [2019-01-18 17:26:43,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:43,298 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-01-18 17:26:43,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-18 17:26:43,299 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 12 [2019-01-18 17:26:43,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:43,299 INFO L225 Difference]: With dead ends: 23 [2019-01-18 17:26:43,300 INFO L226 Difference]: Without dead ends: 15 [2019-01-18 17:26:43,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2019-01-18 17:26:43,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-18 17:26:43,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-18 17:26:43,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-18 17:26:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-01-18 17:26:43,307 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-01-18 17:26:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:43,307 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-01-18 17:26:43,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-18 17:26:43,307 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-01-18 17:26:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-18 17:26:43,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:43,308 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1] [2019-01-18 17:26:43,308 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:43,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash -400886667, now seen corresponding path program 7 times [2019-01-18 17:26:43,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:43,310 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:43,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:43,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:43,743 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:43,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:43,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:43,744 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:43,744 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:43,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:43,745 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 [2019-01-18 17:26:43,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:43,753 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:43,783 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:43,977 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 8 treesize of output 7 [2019-01-18 17:26:43,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:43,981 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:43,982 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:26:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:44,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:44,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:26:44,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:44,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:44,029 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:26:44,061 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:44,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:44,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 21 [2019-01-18 17:26:44,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:44,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-18 17:26:44,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-18 17:26:44,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:26:44,081 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 22 states. [2019-01-18 17:26:44,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:44,995 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-01-18 17:26:44,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-18 17:26:44,996 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 14 [2019-01-18 17:26:44,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:44,997 INFO L225 Difference]: With dead ends: 24 [2019-01-18 17:26:44,997 INFO L226 Difference]: Without dead ends: 16 [2019-01-18 17:26:44,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:26:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-18 17:26:45,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-18 17:26:45,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 17:26:45,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-01-18 17:26:45,003 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-01-18 17:26:45,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:45,004 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-01-18 17:26:45,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-18 17:26:45,004 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-01-18 17:26:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-18 17:26:45,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:45,005 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1] [2019-01-18 17:26:45,005 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:45,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:45,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1662915732, now seen corresponding path program 8 times [2019-01-18 17:26:45,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:45,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:45,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:45,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:45,007 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:45,107 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:45,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:45,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:45,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:45,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:45,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:45,109 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 [2019-01-18 17:26:45,119 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:45,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:45,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:26:45,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:45,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:45,209 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:45,209 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:45,503 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:45,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:45,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 8 [2019-01-18 17:26:45,523 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:45,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:26:45,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:26:45,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-18 17:26:45,524 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 9 states. [2019-01-18 17:26:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:45,620 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2019-01-18 17:26:45,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-18 17:26:45,621 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-01-18 17:26:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:45,622 INFO L225 Difference]: With dead ends: 19 [2019-01-18 17:26:45,622 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:26:45,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:26:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:26:45,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-18 17:26:45,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:26:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-01-18 17:26:45,628 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2019-01-18 17:26:45,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:45,628 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-01-18 17:26:45,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:26:45,628 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-01-18 17:26:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-18 17:26:45,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:45,629 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1] [2019-01-18 17:26:45,629 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:45,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:45,630 INFO L82 PathProgramCache]: Analyzing trace with hash -10778326, now seen corresponding path program 9 times [2019-01-18 17:26:45,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:45,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:45,631 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:45,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:45,631 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:45,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:45,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:45,889 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:45,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:45,890 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:45,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:45,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 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 [2019-01-18 17:26:45,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:45,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:45,923 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:45,923 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:45,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:46,066 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 8 treesize of output 7 [2019-01-18 17:26:46,067 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:46,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:46,074 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:26:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-18 17:26:46,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:46,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:26:46,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:46,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:46,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:26:46,396 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-18 17:26:46,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:46,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 9] total 30 [2019-01-18 17:26:46,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:46,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-18 17:26:46,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-18 17:26:46,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=728, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:26:46,421 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 23 states. [2019-01-18 17:26:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:47,285 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2019-01-18 17:26:47,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-18 17:26:47,286 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 16 [2019-01-18 17:26:47,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:47,287 INFO L225 Difference]: With dead ends: 29 [2019-01-18 17:26:47,287 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 17:26:47,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=277, Invalid=1363, Unknown=0, NotChecked=0, Total=1640 [2019-01-18 17:26:47,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 17:26:47,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-18 17:26:47,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-18 17:26:47,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-01-18 17:26:47,294 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2019-01-18 17:26:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:47,294 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-01-18 17:26:47,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-18 17:26:47,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-01-18 17:26:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-18 17:26:47,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:47,295 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1] [2019-01-18 17:26:47,295 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:47,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:47,296 INFO L82 PathProgramCache]: Analyzing trace with hash 701707477, now seen corresponding path program 10 times [2019-01-18 17:26:47,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:47,297 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:47,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:47,297 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:47,734 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:47,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:47,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:47,735 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:47,735 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:47,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:47,736 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 [2019-01-18 17:26:47,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:47,748 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:47,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:48,093 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 8 treesize of output 7 [2019-01-18 17:26:48,093 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:48,098 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:48,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:26:48,125 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:48,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:48,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:26:48,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:48,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:48,149 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:26:48,184 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:48,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:48,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 27 [2019-01-18 17:26:48,204 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:48,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-18 17:26:48,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-18 17:26:48,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:26:48,206 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 28 states. [2019-01-18 17:26:49,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:49,055 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-01-18 17:26:49,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-18 17:26:49,055 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 18 [2019-01-18 17:26:49,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:49,056 INFO L225 Difference]: With dead ends: 30 [2019-01-18 17:26:49,056 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 17:26:49,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=168, Invalid=1238, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:26:49,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 17:26:49,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-18 17:26:49,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-18 17:26:49,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-18 17:26:49,064 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 18 [2019-01-18 17:26:49,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:49,064 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-18 17:26:49,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-18 17:26:49,064 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-18 17:26:49,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-18 17:26:49,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:49,065 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1, 1] [2019-01-18 17:26:49,065 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:49,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:49,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1547184052, now seen corresponding path program 11 times [2019-01-18 17:26:49,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:49,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:49,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:49,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:49,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:49,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:49,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:49,199 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:49,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:49,199 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 [2019-01-18 17:26:49,210 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:49,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:49,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-18 17:26:49,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:49,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:49,239 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:49,239 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 28 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:49,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:49,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 10 [2019-01-18 17:26:49,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:49,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:26:49,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:26:49,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-01-18 17:26:49,376 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 11 states. [2019-01-18 17:26:49,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:49,886 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-18 17:26:49,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-18 17:26:49,887 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-01-18 17:26:49,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:49,888 INFO L225 Difference]: With dead ends: 23 [2019-01-18 17:26:49,888 INFO L226 Difference]: Without dead ends: 21 [2019-01-18 17:26:49,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 29 SyntacticMatches, 16 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:26:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-18 17:26:49,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-18 17:26:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-18 17:26:49,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-01-18 17:26:49,895 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2019-01-18 17:26:49,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:49,895 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-01-18 17:26:49,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:26:49,895 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-01-18 17:26:49,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-18 17:26:49,895 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:49,896 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1] [2019-01-18 17:26:49,896 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:49,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:49,896 INFO L82 PathProgramCache]: Analyzing trace with hash -718063542, now seen corresponding path program 12 times [2019-01-18 17:26:49,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:49,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:49,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:49,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:49,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:50,738 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:50,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:50,739 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:50,739 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:50,739 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:50,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:50,739 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 [2019-01-18 17:26:50,749 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:50,749 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:50,761 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:50,761 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:50,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:50,965 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 8 treesize of output 7 [2019-01-18 17:26:50,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:50,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:50,972 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:26:51,003 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-18 17:26:51,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:51,078 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:26:51,078 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:51,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:51,093 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:26:51,411 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-18 17:26:51,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:51,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11, 11] total 38 [2019-01-18 17:26:51,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:51,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-18 17:26:51,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-18 17:26:51,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1188, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:26:51,432 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 29 states. [2019-01-18 17:26:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:52,508 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2019-01-18 17:26:52,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-18 17:26:52,509 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 20 [2019-01-18 17:26:52,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:52,509 INFO L225 Difference]: With dead ends: 35 [2019-01-18 17:26:52,509 INFO L226 Difference]: Without dead ends: 23 [2019-01-18 17:26:52,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=403, Invalid=2147, Unknown=0, NotChecked=0, Total=2550 [2019-01-18 17:26:52,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-18 17:26:52,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-18 17:26:52,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 17:26:52,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-18 17:26:52,518 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-01-18 17:26:52,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:52,518 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-18 17:26:52,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-18 17:26:52,518 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-18 17:26:52,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-18 17:26:52,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:52,519 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1] [2019-01-18 17:26:52,519 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:52,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:52,519 INFO L82 PathProgramCache]: Analyzing trace with hash -317821643, now seen corresponding path program 13 times [2019-01-18 17:26:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:52,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:52,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:52,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:52,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:52,908 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:52,909 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:52,909 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:52,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:52,909 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 [2019-01-18 17:26:52,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:52,920 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:52,943 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:53,285 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 8 treesize of output 7 [2019-01-18 17:26:53,285 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:53,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:53,290 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:26:53,323 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:53,323 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:53,341 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:26:53,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:53,344 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:53,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:26:53,514 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:53,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:53,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 33 [2019-01-18 17:26:53,533 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:53,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-18 17:26:53,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-18 17:26:53,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:26:53,534 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 34 states. [2019-01-18 17:26:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:54,543 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-01-18 17:26:54,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-18 17:26:54,543 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 22 [2019-01-18 17:26:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:54,545 INFO L225 Difference]: With dead ends: 36 [2019-01-18 17:26:54,545 INFO L226 Difference]: Without dead ends: 24 [2019-01-18 17:26:54,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:26:54,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-18 17:26:54,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-18 17:26:54,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-18 17:26:54,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-18 17:26:54,554 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-01-18 17:26:54,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:54,554 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-18 17:26:54,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-18 17:26:54,554 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-18 17:26:54,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-18 17:26:54,554 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:54,555 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1, 1] [2019-01-18 17:26:54,555 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:54,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:54,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1283882284, now seen corresponding path program 14 times [2019-01-18 17:26:54,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:54,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:54,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:54,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:54,556 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:54,894 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:54,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:54,895 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:54,895 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:54,895 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:54,895 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:54,895 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 [2019-01-18 17:26:54,904 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:26:54,904 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:26:54,932 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-18 17:26:54,932 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:54,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:54,943 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:55,094 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 45 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:55,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:55,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 12 [2019-01-18 17:26:55,113 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:55,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:26:55,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:26:55,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2019-01-18 17:26:55,113 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 13 states. [2019-01-18 17:26:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:55,247 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-18 17:26:55,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-18 17:26:55,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2019-01-18 17:26:55,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:55,248 INFO L225 Difference]: With dead ends: 27 [2019-01-18 17:26:55,249 INFO L226 Difference]: Without dead ends: 25 [2019-01-18 17:26:55,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 35 SyntacticMatches, 20 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=198, Invalid=308, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:26:55,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-18 17:26:55,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-18 17:26:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-18 17:26:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-18 17:26:55,260 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 23 [2019-01-18 17:26:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:55,260 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-18 17:26:55,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:26:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-18 17:26:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-18 17:26:55,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:55,261 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1] [2019-01-18 17:26:55,261 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1145646954, now seen corresponding path program 15 times [2019-01-18 17:26:55,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:55,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:55,262 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:55,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:55,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:55,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:55,705 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:55,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:55,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:55,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:55,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:55,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:55,706 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 [2019-01-18 17:26:55,714 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:26:55,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:26:55,729 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:26:55,729 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:26:55,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:56,115 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 8 treesize of output 7 [2019-01-18 17:26:56,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:56,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:56,120 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:26:56,156 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-18 17:26:56,156 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:56,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:26:56,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:56,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:56,218 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:26:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-01-18 17:26:56,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:56,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 46 [2019-01-18 17:26:56,625 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:56,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-18 17:26:56,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-18 17:26:56,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=310, Invalid=1760, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:26:56,627 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 35 states. [2019-01-18 17:26:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:26:58,287 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-01-18 17:26:58,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-18 17:26:58,288 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 24 [2019-01-18 17:26:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:26:58,289 INFO L225 Difference]: With dead ends: 41 [2019-01-18 17:26:58,289 INFO L226 Difference]: Without dead ends: 27 [2019-01-18 17:26:58,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=553, Invalid=3107, Unknown=0, NotChecked=0, Total=3660 [2019-01-18 17:26:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-18 17:26:58,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-18 17:26:58,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-18 17:26:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-01-18 17:26:58,301 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-01-18 17:26:58,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:26:58,301 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-01-18 17:26:58,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-18 17:26:58,301 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-01-18 17:26:58,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-18 17:26:58,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:26:58,302 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1] [2019-01-18 17:26:58,302 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:26:58,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:26:58,303 INFO L82 PathProgramCache]: Analyzing trace with hash 430349717, now seen corresponding path program 16 times [2019-01-18 17:26:58,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:26:58,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:58,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:26:58,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:26:58,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:26:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:58,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:58,918 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:26:58,918 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:26:58,918 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:26:58,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:26:58,918 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 [2019-01-18 17:26:58,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:26:58,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:26:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:26:58,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:26:59,532 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 8 treesize of output 7 [2019-01-18 17:26:59,533 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:59,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:59,536 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:26:59,575 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:59,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:26:59,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:26:59,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:26:59,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:26:59,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:26:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:26:59,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:26:59,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 39 [2019-01-18 17:26:59,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:26:59,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-18 17:26:59,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-18 17:26:59,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1445, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:26:59,703 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 40 states. [2019-01-18 17:27:00,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:00,936 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-01-18 17:27:00,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-18 17:27:00,936 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 26 [2019-01-18 17:27:00,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:00,937 INFO L225 Difference]: With dead ends: 42 [2019-01-18 17:27:00,937 INFO L226 Difference]: Without dead ends: 28 [2019-01-18 17:27:00,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=244, Invalid=2618, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:27:00,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-18 17:27:00,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-18 17:27:00,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-18 17:27:00,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-01-18 17:27:00,948 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 26 [2019-01-18 17:27:00,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:00,948 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-01-18 17:27:00,948 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-18 17:27:00,948 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-01-18 17:27:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-18 17:27:00,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:00,949 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1, 1] [2019-01-18 17:27:00,949 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:00,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash -568862196, now seen corresponding path program 17 times [2019-01-18 17:27:00,949 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:00,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:00,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:00,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:00,950 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:01,144 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:01,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:01,145 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:01,145 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:01,145 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:01,145 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:01,145 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 [2019-01-18 17:27:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:01,156 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:01,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-18 17:27:01,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:01,198 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:01,207 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:01,207 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 66 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:01,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:01,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 14 [2019-01-18 17:27:01,565 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:01,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-18 17:27:01,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-18 17:27:01,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=117, Unknown=0, NotChecked=0, Total=210 [2019-01-18 17:27:01,566 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 15 states. [2019-01-18 17:27:01,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:01,793 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-18 17:27:01,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-18 17:27:01,793 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-01-18 17:27:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:01,794 INFO L225 Difference]: With dead ends: 31 [2019-01-18 17:27:01,794 INFO L226 Difference]: Without dead ends: 29 [2019-01-18 17:27:01,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 41 SyntacticMatches, 24 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=429, Unknown=0, NotChecked=0, Total=702 [2019-01-18 17:27:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-18 17:27:01,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-18 17:27:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-18 17:27:01,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-01-18 17:27:01,804 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 27 [2019-01-18 17:27:01,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:01,804 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-01-18 17:27:01,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-18 17:27:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-01-18 17:27:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-18 17:27:01,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:01,805 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1] [2019-01-18 17:27:01,805 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:01,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:01,805 INFO L82 PathProgramCache]: Analyzing trace with hash -454857078, now seen corresponding path program 18 times [2019-01-18 17:27:01,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:01,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:01,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:01,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:01,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:01,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:02,269 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:02,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:02,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:02,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:02,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:02,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:02,270 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 [2019-01-18 17:27:02,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:02,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:02,297 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:02,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:02,300 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:02,862 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 8 treesize of output 7 [2019-01-18 17:27:02,863 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:02,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:02,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:27:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-18 17:27:02,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:02,973 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:27:02,973 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:02,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:02,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:27:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-18 17:27:03,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:03,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15, 15] total 54 [2019-01-18 17:27:03,476 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:03,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-18 17:27:03,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-18 17:27:03,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=418, Invalid=2444, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:27:03,477 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 41 states. [2019-01-18 17:27:04,772 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-18 17:27:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:05,789 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2019-01-18 17:27:05,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-18 17:27:05,790 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 28 [2019-01-18 17:27:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:05,790 INFO L225 Difference]: With dead ends: 47 [2019-01-18 17:27:05,791 INFO L226 Difference]: Without dead ends: 31 [2019-01-18 17:27:05,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=727, Invalid=4243, Unknown=0, NotChecked=0, Total=4970 [2019-01-18 17:27:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-18 17:27:05,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-18 17:27:05,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:27:05,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-01-18 17:27:05,803 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-01-18 17:27:05,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:05,804 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-01-18 17:27:05,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-18 17:27:05,804 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-01-18 17:27:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-18 17:27:05,805 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:05,805 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1] [2019-01-18 17:27:05,805 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:05,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash -319437323, now seen corresponding path program 19 times [2019-01-18 17:27:05,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:05,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:05,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:05,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:05,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:06,453 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:06,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:06,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:06,454 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:06,454 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:06,454 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:06,454 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 [2019-01-18 17:27:06,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:06,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:06,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:07,103 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 8 treesize of output 7 [2019-01-18 17:27:07,103 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:07,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:07,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:27:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:07,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:07,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:27:07,192 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:07,194 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:07,194 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:27:07,321 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:07,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:07,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 45 [2019-01-18 17:27:07,353 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:07,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-18 17:27:07,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-18 17:27:07,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:27:07,355 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 46 states. [2019-01-18 17:27:08,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:08,894 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-01-18 17:27:08,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-18 17:27:08,894 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 30 [2019-01-18 17:27:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:08,895 INFO L225 Difference]: With dead ends: 48 [2019-01-18 17:27:08,895 INFO L226 Difference]: Without dead ends: 32 [2019-01-18 17:27:08,898 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 35 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 545 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:27:08,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-18 17:27:08,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-18 17:27:08,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 17:27:08,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-01-18 17:27:08,909 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 30 [2019-01-18 17:27:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:08,909 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-01-18 17:27:08,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-18 17:27:08,909 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-01-18 17:27:08,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-18 17:27:08,910 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:08,910 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1, 1] [2019-01-18 17:27:08,910 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:08,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:08,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1693839084, now seen corresponding path program 20 times [2019-01-18 17:27:08,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:08,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:08,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:08,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:08,912 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:09,337 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:09,337 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:09,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:09,338 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:09,338 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:09,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:09,338 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 [2019-01-18 17:27:09,348 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:09,348 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:09,387 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-18 17:27:09,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:09,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:09,400 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:09,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 91 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:09,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:09,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 16 [2019-01-18 17:27:09,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:09,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-18 17:27:09,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-18 17:27:09,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=150, Unknown=0, NotChecked=0, Total=272 [2019-01-18 17:27:09,623 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 17 states. [2019-01-18 17:27:09,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:09,874 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2019-01-18 17:27:09,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-18 17:27:09,876 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2019-01-18 17:27:09,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:09,877 INFO L225 Difference]: With dead ends: 35 [2019-01-18 17:27:09,877 INFO L226 Difference]: Without dead ends: 33 [2019-01-18 17:27:09,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=360, Invalid=570, Unknown=0, NotChecked=0, Total=930 [2019-01-18 17:27:09,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-18 17:27:09,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-18 17:27:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 17:27:09,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-01-18 17:27:09,891 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 31 [2019-01-18 17:27:09,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:09,892 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-01-18 17:27:09,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-18 17:27:09,892 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-01-18 17:27:09,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-18 17:27:09,893 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:09,893 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1] [2019-01-18 17:27:09,893 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:09,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:09,893 INFO L82 PathProgramCache]: Analyzing trace with hash 969405866, now seen corresponding path program 21 times [2019-01-18 17:27:09,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:09,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:09,894 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:09,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:09,894 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:09,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:10,660 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:10,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:10,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:10,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:10,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:10,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:10,661 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 [2019-01-18 17:27:10,672 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:10,672 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:10,690 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:10,690 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:10,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:11,215 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 8 treesize of output 7 [2019-01-18 17:27:11,216 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:11,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:11,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:27:11,301 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-18 17:27:11,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:11,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:27:11,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:11,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:11,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:27:12,017 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-01-18 17:27:12,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:12,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17, 17] total 62 [2019-01-18 17:27:12,039 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:12,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:27:12,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:27:12,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:27:12,041 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 47 states. [2019-01-18 17:27:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:13,826 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2019-01-18 17:27:13,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-18 17:27:13,827 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 32 [2019-01-18 17:27:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:13,828 INFO L225 Difference]: With dead ends: 53 [2019-01-18 17:27:13,828 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 17:27:13,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=925, Invalid=5555, Unknown=0, NotChecked=0, Total=6480 [2019-01-18 17:27:13,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 17:27:13,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-18 17:27:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-18 17:27:13,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-01-18 17:27:13,840 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2019-01-18 17:27:13,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:13,841 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-01-18 17:27:13,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:27:13,841 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-01-18 17:27:13,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-18 17:27:13,841 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:13,841 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1] [2019-01-18 17:27:13,842 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:13,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1714035115, now seen corresponding path program 22 times [2019-01-18 17:27:13,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:13,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:13,843 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:13,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:13,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:13,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:14,964 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:14,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:14,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:14,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:14,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:14,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:14,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 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 [2019-01-18 17:27:14,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:14,973 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:15,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:15,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:15,657 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 8 treesize of output 7 [2019-01-18 17:27:15,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:15,663 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:15,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:27:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:15,711 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:15,725 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:27:15,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:15,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:15,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:27:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:15,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:15,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 51 [2019-01-18 17:27:15,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:15,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-18 17:27:15,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-18 17:27:15,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2501, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:27:15,944 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 52 states. [2019-01-18 17:27:17,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:17,700 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2019-01-18 17:27:17,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-18 17:27:17,700 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 34 [2019-01-18 17:27:17,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:17,701 INFO L225 Difference]: With dead ends: 54 [2019-01-18 17:27:17,701 INFO L226 Difference]: Without dead ends: 36 [2019-01-18 17:27:17,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=320, Invalid=4510, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:27:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-18 17:27:17,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-18 17:27:17,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:27:17,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2019-01-18 17:27:17,716 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 34 [2019-01-18 17:27:17,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:17,716 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2019-01-18 17:27:17,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-18 17:27:17,716 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2019-01-18 17:27:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-18 17:27:17,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:17,717 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1, 1] [2019-01-18 17:27:17,717 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:17,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:17,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1394260940, now seen corresponding path program 23 times [2019-01-18 17:27:17,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:17,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:17,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:17,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:17,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:17,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:18,281 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:18,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:18,282 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:18,282 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:18,283 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:18,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:18,283 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 [2019-01-18 17:27:18,291 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:18,291 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:18,342 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-01-18 17:27:18,342 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:18,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:18,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 120 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:18,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:18,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 18 [2019-01-18 17:27:18,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:18,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-18 17:27:18,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-18 17:27:18,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=187, Unknown=0, NotChecked=0, Total=342 [2019-01-18 17:27:18,618 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 19 states. [2019-01-18 17:27:18,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:18,850 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-18 17:27:18,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-18 17:27:18,850 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2019-01-18 17:27:18,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:18,851 INFO L225 Difference]: With dead ends: 39 [2019-01-18 17:27:18,851 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 17:27:18,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 53 SyntacticMatches, 32 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=459, Invalid=731, Unknown=0, NotChecked=0, Total=1190 [2019-01-18 17:27:18,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 17:27:18,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-18 17:27:18,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:27:18,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-01-18 17:27:18,868 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 35 [2019-01-18 17:27:18,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:18,868 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-01-18 17:27:18,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-18 17:27:18,868 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-01-18 17:27:18,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-18 17:27:18,869 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:18,869 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1] [2019-01-18 17:27:18,869 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:18,869 INFO L82 PathProgramCache]: Analyzing trace with hash 272417994, now seen corresponding path program 24 times [2019-01-18 17:27:18,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:18,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:18,870 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:18,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:18,871 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:19,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:19,926 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:19,926 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:19,926 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:19,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:19,926 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 [2019-01-18 17:27:19,935 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:19,936 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:19,960 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:19,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:19,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:20,691 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 8 treesize of output 7 [2019-01-18 17:27:20,692 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:20,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:20,697 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:27:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-18 17:27:20,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:20,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:27:20,808 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:20,819 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:20,819 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:27:21,637 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-01-18 17:27:21,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:21,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 19, 19] total 70 [2019-01-18 17:27:21,656 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:21,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-18 17:27:21,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-18 17:27:21,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=682, Invalid=4148, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:27:21,657 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 53 states. [2019-01-18 17:27:23,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:23,968 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-01-18 17:27:23,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-18 17:27:23,968 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 36 [2019-01-18 17:27:23,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:23,969 INFO L225 Difference]: With dead ends: 59 [2019-01-18 17:27:23,969 INFO L226 Difference]: Without dead ends: 39 [2019-01-18 17:27:23,970 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1147, Invalid=7043, Unknown=0, NotChecked=0, Total=8190 [2019-01-18 17:27:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-18 17:27:23,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-18 17:27:23,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 17:27:23,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-01-18 17:27:23,985 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-01-18 17:27:23,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:23,985 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-01-18 17:27:23,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-18 17:27:23,985 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-01-18 17:27:23,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-18 17:27:23,985 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:23,986 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1] [2019-01-18 17:27:23,986 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:23,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:23,986 INFO L82 PathProgramCache]: Analyzing trace with hash -392102219, now seen corresponding path program 25 times [2019-01-18 17:27:23,986 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:23,987 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:23,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:23,987 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:24,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:25,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:25,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:25,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:25,046 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:25,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:25,046 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 [2019-01-18 17:27:25,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:25,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:25,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:25,948 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 8 treesize of output 7 [2019-01-18 17:27:25,948 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:25,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:25,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:27:26,004 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:26,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:26,017 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:27:26,017 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:26,020 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:26,020 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:27:26,302 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:26,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:26,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 57 [2019-01-18 17:27:26,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:26,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-18 17:27:26,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-18 17:27:26,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:27:26,321 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 58 states. [2019-01-18 17:27:28,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:28,436 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-18 17:27:28,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-18 17:27:28,436 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 38 [2019-01-18 17:27:28,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:28,437 INFO L225 Difference]: With dead ends: 60 [2019-01-18 17:27:28,437 INFO L226 Difference]: Without dead ends: 40 [2019-01-18 17:27:28,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:27:28,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-18 17:27:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-18 17:27:28,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-18 17:27:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2019-01-18 17:27:28,454 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 38 [2019-01-18 17:27:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:28,454 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2019-01-18 17:27:28,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-18 17:27:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2019-01-18 17:27:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-18 17:27:28,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:28,455 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1, 1] [2019-01-18 17:27:28,455 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:28,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:28,455 INFO L82 PathProgramCache]: Analyzing trace with hash 536887468, now seen corresponding path program 26 times [2019-01-18 17:27:28,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:28,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:28,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:28,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:28,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:28,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:28,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:28,696 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:28,696 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:28,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:28,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:28,696 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 [2019-01-18 17:27:28,705 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:28,706 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:28,825 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-18 17:27:28,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:28,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:28,839 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:28,840 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:29,126 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 153 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:29,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:29,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 20 [2019-01-18 17:27:29,145 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:29,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-18 17:27:29,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-18 17:27:29,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=228, Unknown=0, NotChecked=0, Total=420 [2019-01-18 17:27:29,146 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 21 states. [2019-01-18 17:27:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:29,408 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2019-01-18 17:27:29,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-18 17:27:29,408 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2019-01-18 17:27:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:29,408 INFO L225 Difference]: With dead ends: 43 [2019-01-18 17:27:29,409 INFO L226 Difference]: Without dead ends: 41 [2019-01-18 17:27:29,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 59 SyntacticMatches, 36 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=570, Invalid=912, Unknown=0, NotChecked=0, Total=1482 [2019-01-18 17:27:29,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-18 17:27:29,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-18 17:27:29,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:27:29,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2019-01-18 17:27:29,425 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 39 [2019-01-18 17:27:29,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:29,425 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2019-01-18 17:27:29,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-18 17:27:29,425 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2019-01-18 17:27:29,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-18 17:27:29,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:29,425 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1] [2019-01-18 17:27:29,426 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:29,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:29,426 INFO L82 PathProgramCache]: Analyzing trace with hash -536355862, now seen corresponding path program 27 times [2019-01-18 17:27:29,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:29,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:29,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:29,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:29,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:29,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:30,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:30,691 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:30,691 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:30,691 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:30,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:30,691 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 [2019-01-18 17:27:30,701 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:30,701 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:30,727 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:30,727 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:30,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:31,558 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 8 treesize of output 7 [2019-01-18 17:27:31,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:31,562 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:31,562 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:27:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-18 17:27:31,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:31,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:27:31,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:31,717 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:31,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:27:32,802 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-01-18 17:27:32,820 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:32,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 21, 21] total 78 [2019-01-18 17:27:32,820 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:32,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-18 17:27:32,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-18 17:27:32,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=838, Invalid=5168, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:27:32,821 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 59 states. [2019-01-18 17:27:35,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:35,575 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2019-01-18 17:27:35,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-18 17:27:35,576 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 40 [2019-01-18 17:27:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:35,576 INFO L225 Difference]: With dead ends: 65 [2019-01-18 17:27:35,576 INFO L226 Difference]: Without dead ends: 43 [2019-01-18 17:27:35,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1393, Invalid=8707, Unknown=0, NotChecked=0, Total=10100 [2019-01-18 17:27:35,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-18 17:27:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-18 17:27:35,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-18 17:27:35,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2019-01-18 17:27:35,601 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2019-01-18 17:27:35,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:35,601 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2019-01-18 17:27:35,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-18 17:27:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2019-01-18 17:27:35,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-18 17:27:35,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:35,602 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1] [2019-01-18 17:27:35,602 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:35,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:35,602 INFO L82 PathProgramCache]: Analyzing trace with hash -684650731, now seen corresponding path program 28 times [2019-01-18 17:27:35,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:35,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:35,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:35,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:36,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:36,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:36,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:36,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:36,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:36,530 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 [2019-01-18 17:27:36,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:36,540 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:36,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:37,581 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 8 treesize of output 7 [2019-01-18 17:27:37,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:37,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:37,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:27:37,640 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:37,640 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:37,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:27:37,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:37,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:37,657 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:27:37,976 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:37,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:37,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 63 [2019-01-18 17:27:37,995 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:37,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-18 17:27:37,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-18 17:27:37,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3845, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:27:37,997 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 64 states. [2019-01-18 17:27:40,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:40,584 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2019-01-18 17:27:40,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-18 17:27:40,585 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 42 [2019-01-18 17:27:40,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:40,585 INFO L225 Difference]: With dead ends: 66 [2019-01-18 17:27:40,585 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 17:27:40,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 47 SyntacticMatches, 14 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=396, Invalid=6914, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:27:40,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 17:27:40,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-18 17:27:40,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-18 17:27:40,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 45 transitions. [2019-01-18 17:27:40,611 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 45 transitions. Word has length 42 [2019-01-18 17:27:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:40,612 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 45 transitions. [2019-01-18 17:27:40,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-18 17:27:40,612 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 45 transitions. [2019-01-18 17:27:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-18 17:27:40,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:40,613 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1, 1] [2019-01-18 17:27:40,613 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:40,613 INFO L82 PathProgramCache]: Analyzing trace with hash -392135284, now seen corresponding path program 29 times [2019-01-18 17:27:40,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:40,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:40,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:40,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:40,615 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:40,943 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:40,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:40,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:40,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:40,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:40,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:40,944 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 [2019-01-18 17:27:40,953 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:40,954 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:41,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-18 17:27:41,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:41,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:41,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 190 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:41,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:41,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 22 [2019-01-18 17:27:41,452 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:41,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-18 17:27:41,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-18 17:27:41,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2019-01-18 17:27:41,453 INFO L87 Difference]: Start difference. First operand 44 states and 45 transitions. Second operand 23 states. [2019-01-18 17:27:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:41,751 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2019-01-18 17:27:41,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-18 17:27:41,752 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2019-01-18 17:27:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:41,752 INFO L225 Difference]: With dead ends: 47 [2019-01-18 17:27:41,753 INFO L226 Difference]: Without dead ends: 45 [2019-01-18 17:27:41,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 65 SyntacticMatches, 40 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=693, Invalid=1113, Unknown=0, NotChecked=0, Total=1806 [2019-01-18 17:27:41,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-18 17:27:41,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-18 17:27:41,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-18 17:27:41,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-01-18 17:27:41,769 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 43 [2019-01-18 17:27:41,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:41,770 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-01-18 17:27:41,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-18 17:27:41,770 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-01-18 17:27:41,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-18 17:27:41,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:41,770 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1] [2019-01-18 17:27:41,770 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:41,771 INFO L82 PathProgramCache]: Analyzing trace with hash 728709898, now seen corresponding path program 30 times [2019-01-18 17:27:41,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:41,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:41,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:41,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:41,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:42,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:42,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:42,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:42,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:42,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:42,854 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 [2019-01-18 17:27:42,862 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:42,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:42,889 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:42,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:42,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:43,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 8 treesize of output 7 [2019-01-18 17:27:43,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:43,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:43,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:27:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-18 17:27:44,000 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:44,073 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:27:44,073 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:44,083 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:44,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:27:45,533 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-01-18 17:27:45,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:45,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 23, 23] total 86 [2019-01-18 17:27:45,553 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:45,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-18 17:27:45,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-18 17:27:45,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1010, Invalid=6300, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:27:45,554 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 65 states. [2019-01-18 17:27:48,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:48,998 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2019-01-18 17:27:48,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-18 17:27:48,999 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 44 [2019-01-18 17:27:48,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:49,000 INFO L225 Difference]: With dead ends: 71 [2019-01-18 17:27:49,000 INFO L226 Difference]: Without dead ends: 47 [2019-01-18 17:27:49,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 988 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1663, Invalid=10547, Unknown=0, NotChecked=0, Total=12210 [2019-01-18 17:27:49,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-18 17:27:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-18 17:27:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 17:27:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2019-01-18 17:27:49,019 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2019-01-18 17:27:49,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:49,019 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2019-01-18 17:27:49,019 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-18 17:27:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2019-01-18 17:27:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-18 17:27:49,020 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:49,020 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1] [2019-01-18 17:27:49,020 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:49,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:49,020 INFO L82 PathProgramCache]: Analyzing trace with hash 954210165, now seen corresponding path program 31 times [2019-01-18 17:27:49,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:49,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:49,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:49,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:49,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:50,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:50,667 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:50,667 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:50,667 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:50,668 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:50,668 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 [2019-01-18 17:27:50,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:50,676 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:27:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:50,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:51,880 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 8 treesize of output 7 [2019-01-18 17:27:51,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:51,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:51,886 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:27:51,948 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:51,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:51,961 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:27:51,961 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:51,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:51,965 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:27:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:52,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:52,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 69 [2019-01-18 17:27:52,388 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:52,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-18 17:27:52,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-18 17:27:52,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:27:52,389 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 70 states. [2019-01-18 17:27:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:55,557 INFO L93 Difference]: Finished difference Result 72 states and 74 transitions. [2019-01-18 17:27:55,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-18 17:27:55,557 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 46 [2019-01-18 17:27:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:55,558 INFO L225 Difference]: With dead ends: 72 [2019-01-18 17:27:55,558 INFO L226 Difference]: Without dead ends: 48 [2019-01-18 17:27:55,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 51 SyntacticMatches, 16 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:27:55,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-18 17:27:55,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-18 17:27:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 17:27:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2019-01-18 17:27:55,579 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 46 [2019-01-18 17:27:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:55,579 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2019-01-18 17:27:55,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-18 17:27:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2019-01-18 17:27:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-18 17:27:55,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:55,579 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1, 1] [2019-01-18 17:27:55,579 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:55,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:55,580 INFO L82 PathProgramCache]: Analyzing trace with hash 259355244, now seen corresponding path program 32 times [2019-01-18 17:27:55,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:55,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:27:55,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:55,581 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:55,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:55,999 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:55,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:55,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:55,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:55,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:55,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:55,999 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 [2019-01-18 17:27:56,008 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:27:56,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:27:56,086 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-01-18 17:27:56,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:56,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:56,099 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:56,485 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 231 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:56,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:27:56,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 24 [2019-01-18 17:27:56,504 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:27:56,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-18 17:27:56,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-18 17:27:56,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=322, Unknown=0, NotChecked=0, Total=600 [2019-01-18 17:27:56,505 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 25 states. [2019-01-18 17:27:56,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:27:56,849 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2019-01-18 17:27:56,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-18 17:27:56,850 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2019-01-18 17:27:56,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:27:56,850 INFO L225 Difference]: With dead ends: 51 [2019-01-18 17:27:56,851 INFO L226 Difference]: Without dead ends: 49 [2019-01-18 17:27:56,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 71 SyntacticMatches, 44 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=828, Invalid=1334, Unknown=0, NotChecked=0, Total=2162 [2019-01-18 17:27:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-18 17:27:56,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-18 17:27:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-18 17:27:56,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2019-01-18 17:27:56,871 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 47 [2019-01-18 17:27:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:27:56,871 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2019-01-18 17:27:56,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-18 17:27:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2019-01-18 17:27:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-18 17:27:56,872 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:27:56,872 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1] [2019-01-18 17:27:56,872 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:27:56,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:27:56,872 INFO L82 PathProgramCache]: Analyzing trace with hash -549920214, now seen corresponding path program 33 times [2019-01-18 17:27:56,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:27:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:56,873 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:27:56,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:27:56,873 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:27:56,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:27:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:27:58,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:58,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:27:58,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:27:58,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:27:58,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:27:58,200 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 [2019-01-18 17:27:58,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:27:58,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:27:58,248 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:27:58,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:27:58,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:27:59,523 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 8 treesize of output 7 [2019-01-18 17:27:59,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:59,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:59,530 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:27:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-18 17:27:59,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:27:59,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:27:59,674 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:27:59,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:27:59,685 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:28:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2019-01-18 17:28:01,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:01,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 25, 25] total 94 [2019-01-18 17:28:01,498 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:01,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-18 17:28:01,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-18 17:28:01,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1198, Invalid=7544, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:28:01,499 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 71 states. [2019-01-18 17:28:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:05,402 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2019-01-18 17:28:05,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-18 17:28:05,402 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 48 [2019-01-18 17:28:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:05,403 INFO L225 Difference]: With dead ends: 77 [2019-01-18 17:28:05,403 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 17:28:05,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1174 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1957, Invalid=12563, Unknown=0, NotChecked=0, Total=14520 [2019-01-18 17:28:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 17:28:05,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-18 17:28:05,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 17:28:05,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2019-01-18 17:28:05,425 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 48 [2019-01-18 17:28:05,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:05,425 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2019-01-18 17:28:05,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-18 17:28:05,425 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2019-01-18 17:28:05,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-18 17:28:05,426 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:05,426 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1] [2019-01-18 17:28:05,426 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:05,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:05,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1451759573, now seen corresponding path program 34 times [2019-01-18 17:28:05,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:05,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:05,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:05,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:05,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:07,452 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:07,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:07,452 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:07,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:07,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:07,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:07,453 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 [2019-01-18 17:28:07,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:07,462 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:07,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:07,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:08,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 8 treesize of output 7 [2019-01-18 17:28:08,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:08,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:08,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:28:08,962 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:08,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:08,980 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:28:08,980 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:08,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:08,983 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:28:09,481 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:09,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:09,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 75 [2019-01-18 17:28:09,500 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:09,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-18 17:28:09,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-18 17:28:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=5477, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:28:09,501 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 76 states. [2019-01-18 17:28:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:12,717 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-01-18 17:28:12,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-18 17:28:12,717 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 50 [2019-01-18 17:28:12,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:12,718 INFO L225 Difference]: With dead ends: 78 [2019-01-18 17:28:12,718 INFO L226 Difference]: Without dead ends: 52 [2019-01-18 17:28:12,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 55 SyntacticMatches, 18 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=472, Invalid=9830, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:28:12,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-18 17:28:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-18 17:28:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-18 17:28:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2019-01-18 17:28:12,740 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 50 [2019-01-18 17:28:12,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:12,740 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2019-01-18 17:28:12,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-18 17:28:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2019-01-18 17:28:12,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-18 17:28:12,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:12,741 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1, 1] [2019-01-18 17:28:12,741 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:12,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:12,741 INFO L82 PathProgramCache]: Analyzing trace with hash -596041908, now seen corresponding path program 35 times [2019-01-18 17:28:12,741 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:12,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:12,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:12,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:12,742 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:13,238 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:13,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:13,238 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:13,239 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:13,239 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:13,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:13,239 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 [2019-01-18 17:28:13,252 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:13,253 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:13,345 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-18 17:28:13,345 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:13,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:13,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 276 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:13,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:13,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 26 [2019-01-18 17:28:13,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:13,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-18 17:28:13,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-18 17:28:13,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=375, Unknown=0, NotChecked=0, Total=702 [2019-01-18 17:28:13,841 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand 27 states. [2019-01-18 17:28:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:14,225 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2019-01-18 17:28:14,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-18 17:28:14,225 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2019-01-18 17:28:14,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:14,226 INFO L225 Difference]: With dead ends: 55 [2019-01-18 17:28:14,226 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 17:28:14,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 77 SyntacticMatches, 48 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=975, Invalid=1575, Unknown=0, NotChecked=0, Total=2550 [2019-01-18 17:28:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 17:28:14,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-18 17:28:14,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-18 17:28:14,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2019-01-18 17:28:14,248 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 51 [2019-01-18 17:28:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:14,249 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2019-01-18 17:28:14,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-18 17:28:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2019-01-18 17:28:14,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-18 17:28:14,249 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:14,250 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1] [2019-01-18 17:28:14,250 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:14,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:14,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1297428150, now seen corresponding path program 36 times [2019-01-18 17:28:14,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:14,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:14,251 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:14,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:14,251 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:14,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:16,114 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:16,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:16,114 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:16,115 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:16,115 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:16,115 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:16,115 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 [2019-01-18 17:28:16,123 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:16,123 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:16,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:16,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:16,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:17,592 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 8 treesize of output 7 [2019-01-18 17:28:17,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:17,601 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:17,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:28:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-18 17:28:17,677 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:17,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:28:17,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:17,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:17,769 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:28:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-01-18 17:28:20,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:20,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 27, 27] total 102 [2019-01-18 17:28:20,098 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:20,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-18 17:28:20,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-18 17:28:20,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1402, Invalid=8900, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:28:20,099 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 77 states. [2019-01-18 17:28:24,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:24,481 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2019-01-18 17:28:24,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-18 17:28:24,481 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 52 [2019-01-18 17:28:24,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:24,482 INFO L225 Difference]: With dead ends: 83 [2019-01-18 17:28:24,482 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:28:24,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1376 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2275, Invalid=14755, Unknown=0, NotChecked=0, Total=17030 [2019-01-18 17:28:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:28:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-18 17:28:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-18 17:28:24,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2019-01-18 17:28:24,512 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 52 [2019-01-18 17:28:24,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:24,512 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2019-01-18 17:28:24,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-18 17:28:24,513 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2019-01-18 17:28:24,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-18 17:28:24,513 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:24,513 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1] [2019-01-18 17:28:24,513 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:24,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:24,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1904013259, now seen corresponding path program 37 times [2019-01-18 17:28:24,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:24,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:24,515 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:24,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:24,515 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:26,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:26,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:26,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:26,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:26,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:26,308 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 [2019-01-18 17:28:26,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:26,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:26,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:27,966 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 8 treesize of output 7 [2019-01-18 17:28:27,967 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:27,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:27,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:28:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:28,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:28,070 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:28:28,070 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:28,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:28,111 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:28:28,731 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:28,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:28,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 81 [2019-01-18 17:28:28,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:28,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-18 17:28:28,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-18 17:28:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:28:28,753 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 82 states. [2019-01-18 17:28:32,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:32,897 INFO L93 Difference]: Finished difference Result 84 states and 86 transitions. [2019-01-18 17:28:32,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-18 17:28:32,897 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 54 [2019-01-18 17:28:32,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:32,898 INFO L225 Difference]: With dead ends: 84 [2019-01-18 17:28:32,898 INFO L226 Difference]: Without dead ends: 56 [2019-01-18 17:28:32,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 59 SyntacticMatches, 20 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1961 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:28:32,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-18 17:28:32,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-18 17:28:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-18 17:28:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2019-01-18 17:28:32,922 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 54 [2019-01-18 17:28:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:32,922 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2019-01-18 17:28:32,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-18 17:28:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2019-01-18 17:28:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-18 17:28:32,923 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:32,923 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1, 1] [2019-01-18 17:28:32,923 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:32,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:32,923 INFO L82 PathProgramCache]: Analyzing trace with hash 488997932, now seen corresponding path program 38 times [2019-01-18 17:28:32,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:32,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:32,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:32,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:32,925 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:33,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:33,342 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:33,342 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:33,342 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:33,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:33,342 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 [2019-01-18 17:28:33,351 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:33,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:33,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-18 17:28:33,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:33,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:33,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 325 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:34,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:34,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 28 [2019-01-18 17:28:34,133 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:34,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-18 17:28:34,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-18 17:28:34,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=380, Invalid=432, Unknown=0, NotChecked=0, Total=812 [2019-01-18 17:28:34,134 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand 29 states. [2019-01-18 17:28:34,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:34,578 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2019-01-18 17:28:34,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-18 17:28:34,578 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2019-01-18 17:28:34,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:34,579 INFO L225 Difference]: With dead ends: 59 [2019-01-18 17:28:34,579 INFO L226 Difference]: Without dead ends: 57 [2019-01-18 17:28:34,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 83 SyntacticMatches, 52 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1134, Invalid=1836, Unknown=0, NotChecked=0, Total=2970 [2019-01-18 17:28:34,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-18 17:28:34,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-18 17:28:34,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-18 17:28:34,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2019-01-18 17:28:34,605 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 55 [2019-01-18 17:28:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:34,605 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2019-01-18 17:28:34,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-18 17:28:34,605 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2019-01-18 17:28:34,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-18 17:28:34,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:34,605 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1] [2019-01-18 17:28:34,606 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:34,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:34,606 INFO L82 PathProgramCache]: Analyzing trace with hash -2020931478, now seen corresponding path program 39 times [2019-01-18 17:28:34,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:34,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:34,607 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:34,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:34,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:37,309 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:37,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:37,309 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:37,309 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:37,309 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:37,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:37,309 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 [2019-01-18 17:28:37,318 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:28:37,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:28:37,353 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:28:37,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:37,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:39,017 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 8 treesize of output 7 [2019-01-18 17:28:39,018 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:39,024 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:39,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:28:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-18 17:28:39,101 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:39,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:28:39,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:39,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:39,198 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:28:41,121 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-01-18 17:28:41,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:41,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 29, 29] total 110 [2019-01-18 17:28:41,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:41,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-18 17:28:41,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-18 17:28:41,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1622, Invalid=10368, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:28:41,144 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 83 states. [2019-01-18 17:28:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:46,391 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2019-01-18 17:28:46,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-18 17:28:46,392 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 56 [2019-01-18 17:28:46,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:46,393 INFO L225 Difference]: With dead ends: 89 [2019-01-18 17:28:46,393 INFO L226 Difference]: Without dead ends: 59 [2019-01-18 17:28:46,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1594 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2617, Invalid=17123, Unknown=0, NotChecked=0, Total=19740 [2019-01-18 17:28:46,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-18 17:28:46,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-18 17:28:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-18 17:28:46,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2019-01-18 17:28:46,421 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 56 [2019-01-18 17:28:46,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:46,421 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2019-01-18 17:28:46,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-18 17:28:46,421 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2019-01-18 17:28:46,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-18 17:28:46,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:46,422 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1] [2019-01-18 17:28:46,422 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:46,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:46,422 INFO L82 PathProgramCache]: Analyzing trace with hash -190119787, now seen corresponding path program 40 times [2019-01-18 17:28:46,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:46,423 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:46,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:46,423 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:48,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:48,969 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:48,969 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:48,970 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:48,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:48,970 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 [2019-01-18 17:28:48,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:48,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:28:49,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:49,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:50,848 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 8 treesize of output 7 [2019-01-18 17:28:50,849 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:50,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:50,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:28:50,928 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:50,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:50,942 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:28:50,942 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:28:50,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:28:50,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:28:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:51,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:51,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 87 [2019-01-18 17:28:51,999 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:51,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-18 17:28:52,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-18 17:28:52,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=7397, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:28:52,000 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 88 states. [2019-01-18 17:28:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:56,434 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2019-01-18 17:28:56,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-18 17:28:56,434 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 58 [2019-01-18 17:28:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:56,435 INFO L225 Difference]: With dead ends: 90 [2019-01-18 17:28:56,435 INFO L226 Difference]: Without dead ends: 60 [2019-01-18 17:28:56,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 63 SyntacticMatches, 22 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2281 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=548, Invalid=13258, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:28:56,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-18 17:28:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-18 17:28:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-18 17:28:56,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-01-18 17:28:56,463 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 58 [2019-01-18 17:28:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:56,464 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-01-18 17:28:56,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-18 17:28:56,464 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-01-18 17:28:56,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-18 17:28:56,464 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:56,464 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1, 1] [2019-01-18 17:28:56,465 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:56,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:56,465 INFO L82 PathProgramCache]: Analyzing trace with hash -998989556, now seen corresponding path program 41 times [2019-01-18 17:28:56,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:56,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:56,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:28:56,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:56,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:28:57,141 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:57,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:57,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:28:57,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:28:57,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:28:57,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:28:57,142 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 [2019-01-18 17:28:57,150 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:28:57,150 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:28:57,284 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-01-18 17:28:57,284 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:28:57,288 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:28:57,311 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:57,311 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:28:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 378 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:28:57,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:28:57,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 30 [2019-01-18 17:28:57,958 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:28:57,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-18 17:28:57,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-18 17:28:57,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2019-01-18 17:28:57,959 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 31 states. [2019-01-18 17:28:58,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:28:58,436 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2019-01-18 17:28:58,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-18 17:28:58,437 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2019-01-18 17:28:58,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:28:58,437 INFO L225 Difference]: With dead ends: 63 [2019-01-18 17:28:58,437 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 17:28:58,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 89 SyntacticMatches, 56 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1305, Invalid=2117, Unknown=0, NotChecked=0, Total=3422 [2019-01-18 17:28:58,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 17:28:58,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-18 17:28:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 17:28:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2019-01-18 17:28:58,477 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 59 [2019-01-18 17:28:58,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:28:58,478 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2019-01-18 17:28:58,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-18 17:28:58,478 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2019-01-18 17:28:58,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-18 17:28:58,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:28:58,479 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1] [2019-01-18 17:28:58,479 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:28:58,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:28:58,479 INFO L82 PathProgramCache]: Analyzing trace with hash -903903350, now seen corresponding path program 42 times [2019-01-18 17:28:58,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:28:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:58,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:28:58,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:28:58,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:28:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:00,888 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:00,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:00,888 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:00,889 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:00,889 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:00,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:00,889 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 [2019-01-18 17:29:00,898 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:00,898 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:00,935 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:00,935 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:00,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:03,081 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 8 treesize of output 7 [2019-01-18 17:29:03,081 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:03,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:03,088 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:29:03,171 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-18 17:29:03,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:03,297 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:29:03,297 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:03,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:03,309 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:29:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 406 trivial. 0 not checked. [2019-01-18 17:29:05,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:05,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 31, 31] total 118 [2019-01-18 17:29:05,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:05,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-18 17:29:05,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-18 17:29:05,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1858, Invalid=11948, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:29:05,581 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 89 states. [2019-01-18 17:29:11,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:11,097 INFO L93 Difference]: Finished difference Result 95 states and 99 transitions. [2019-01-18 17:29:11,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-18 17:29:11,098 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 60 [2019-01-18 17:29:11,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:11,099 INFO L225 Difference]: With dead ends: 95 [2019-01-18 17:29:11,099 INFO L226 Difference]: Without dead ends: 63 [2019-01-18 17:29:11,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=2983, Invalid=19667, Unknown=0, NotChecked=0, Total=22650 [2019-01-18 17:29:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-18 17:29:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-18 17:29:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-18 17:29:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2019-01-18 17:29:11,133 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2019-01-18 17:29:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:11,133 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2019-01-18 17:29:11,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-18 17:29:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2019-01-18 17:29:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-18 17:29:11,134 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:11,134 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1] [2019-01-18 17:29:11,134 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:11,134 INFO L82 PathProgramCache]: Analyzing trace with hash -228988683, now seen corresponding path program 43 times [2019-01-18 17:29:11,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:11,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:11,135 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:11,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:11,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:11,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:13,370 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:13,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:13,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:13,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:13,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:13,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:13,371 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 [2019-01-18 17:29:13,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:13,379 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:13,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:15,506 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 8 treesize of output 7 [2019-01-18 17:29:15,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:15,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:15,512 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:29:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:15,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:15,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:29:15,610 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:15,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:15,615 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:29:16,481 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:16,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:16,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 93 [2019-01-18 17:29:16,501 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:16,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-18 17:29:16,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-18 17:29:16,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=8465, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:29:16,502 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 94 states. [2019-01-18 17:29:21,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:21,688 INFO L93 Difference]: Finished difference Result 96 states and 98 transitions. [2019-01-18 17:29:21,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-18 17:29:21,689 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 62 [2019-01-18 17:29:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:21,689 INFO L225 Difference]: With dead ends: 96 [2019-01-18 17:29:21,690 INFO L226 Difference]: Without dead ends: 64 [2019-01-18 17:29:21,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 67 SyntacticMatches, 24 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=586, Invalid=15164, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:29:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-18 17:29:21,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-18 17:29:21,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-18 17:29:21,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2019-01-18 17:29:21,721 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 62 [2019-01-18 17:29:21,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:21,721 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2019-01-18 17:29:21,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-18 17:29:21,722 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2019-01-18 17:29:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-18 17:29:21,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:21,722 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1, 1] [2019-01-18 17:29:21,722 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:21,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:21,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1965001236, now seen corresponding path program 44 times [2019-01-18 17:29:21,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:21,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:21,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:21,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:21,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:22,544 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:22,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:22,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:22,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:22,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:22,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:22,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 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 [2019-01-18 17:29:22,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:29:22,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:29:22,715 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-18 17:29:22,715 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:22,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:22,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:23,528 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 435 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:23,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:23,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 32 [2019-01-18 17:29:23,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:23,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-18 17:29:23,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-18 17:29:23,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=558, Unknown=0, NotChecked=0, Total=1056 [2019-01-18 17:29:23,550 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand 33 states. [2019-01-18 17:29:24,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:24,105 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2019-01-18 17:29:24,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-18 17:29:24,105 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2019-01-18 17:29:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:24,106 INFO L225 Difference]: With dead ends: 67 [2019-01-18 17:29:24,106 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:29:24,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 95 SyntacticMatches, 60 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1488, Invalid=2418, Unknown=0, NotChecked=0, Total=3906 [2019-01-18 17:29:24,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:29:24,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-18 17:29:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-18 17:29:24,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2019-01-18 17:29:24,139 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 63 [2019-01-18 17:29:24,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:24,139 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2019-01-18 17:29:24,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-18 17:29:24,139 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2019-01-18 17:29:24,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-18 17:29:24,139 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:24,140 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1] [2019-01-18 17:29:24,140 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:24,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:24,140 INFO L82 PathProgramCache]: Analyzing trace with hash -785494358, now seen corresponding path program 45 times [2019-01-18 17:29:24,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:24,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:24,141 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:24,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:24,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:26,268 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:26,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:26,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:26,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:26,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:26,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:26,269 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 [2019-01-18 17:29:26,278 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:26,278 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:26,315 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:26,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:26,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:29,552 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 8 treesize of output 7 [2019-01-18 17:29:29,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:29,559 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:29,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:29:29,648 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-18 17:29:29,649 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:29,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:29:29,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:29,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:29,754 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:29:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2019-01-18 17:29:32,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:32,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 33, 33] total 126 [2019-01-18 17:29:32,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:32,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-18 17:29:32,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-18 17:29:32,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2110, Invalid=13640, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:29:32,435 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 95 states. [2019-01-18 17:29:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:38,830 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2019-01-18 17:29:38,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-18 17:29:38,830 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 64 [2019-01-18 17:29:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:38,831 INFO L225 Difference]: With dead ends: 101 [2019-01-18 17:29:38,831 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 17:29:38,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2078 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=3373, Invalid=22387, Unknown=0, NotChecked=0, Total=25760 [2019-01-18 17:29:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 17:29:38,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-18 17:29:38,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-18 17:29:38,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2019-01-18 17:29:38,866 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 64 [2019-01-18 17:29:38,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:38,866 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2019-01-18 17:29:38,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-18 17:29:38,866 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2019-01-18 17:29:38,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-18 17:29:38,867 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:38,867 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1] [2019-01-18 17:29:38,867 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:38,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:38,867 INFO L82 PathProgramCache]: Analyzing trace with hash -429274795, now seen corresponding path program 46 times [2019-01-18 17:29:38,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:38,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:38,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:38,868 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:38,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:42,216 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:42,216 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:42,216 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:42,216 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:42,217 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:42,217 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 [2019-01-18 17:29:42,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:42,234 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:29:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:42,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:44,855 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 8 treesize of output 7 [2019-01-18 17:29:44,855 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:44,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:44,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:29:44,960 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:44,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:44,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:29:44,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:44,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:44,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:29:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:45,988 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:45,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 99 [2019-01-18 17:29:45,988 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:45,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-18 17:29:45,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-18 17:29:45,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:29:45,989 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 100 states. [2019-01-18 17:29:51,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:51,018 INFO L93 Difference]: Finished difference Result 102 states and 104 transitions. [2019-01-18 17:29:51,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-18 17:29:51,018 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 66 [2019-01-18 17:29:51,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:51,019 INFO L225 Difference]: With dead ends: 102 [2019-01-18 17:29:51,019 INFO L226 Difference]: Without dead ends: 68 [2019-01-18 17:29:51,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2958 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:29:51,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-18 17:29:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-18 17:29:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-18 17:29:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-01-18 17:29:51,061 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 66 [2019-01-18 17:29:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:51,061 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-01-18 17:29:51,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-18 17:29:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-01-18 17:29:51,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-18 17:29:51,061 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:51,061 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1, 1] [2019-01-18 17:29:51,061 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:51,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:51,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1906113844, now seen corresponding path program 47 times [2019-01-18 17:29:51,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:51,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:51,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:29:51,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:51,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:51,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:51,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:51,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:51,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:51,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:51,655 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 [2019-01-18 17:29:51,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:29:51,666 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:29:51,834 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-18 17:29:51,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:51,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:51,852 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:52,909 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 496 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:52,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:29:52,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 34 [2019-01-18 17:29:52,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:29:52,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-18 17:29:52,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-18 17:29:52,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=563, Invalid=627, Unknown=0, NotChecked=0, Total=1190 [2019-01-18 17:29:52,929 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 35 states. [2019-01-18 17:29:53,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:29:53,614 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2019-01-18 17:29:53,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-18 17:29:53,614 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2019-01-18 17:29:53,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:29:53,615 INFO L225 Difference]: With dead ends: 71 [2019-01-18 17:29:53,615 INFO L226 Difference]: Without dead ends: 69 [2019-01-18 17:29:53,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 101 SyntacticMatches, 64 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1683, Invalid=2739, Unknown=0, NotChecked=0, Total=4422 [2019-01-18 17:29:53,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-18 17:29:53,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-18 17:29:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-18 17:29:53,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2019-01-18 17:29:53,651 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 67 [2019-01-18 17:29:53,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:29:53,651 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2019-01-18 17:29:53,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-18 17:29:53,652 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2019-01-18 17:29:53,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-18 17:29:53,652 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:29:53,652 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1] [2019-01-18 17:29:53,652 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:29:53,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:29:53,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1040014794, now seen corresponding path program 48 times [2019-01-18 17:29:53,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:29:53,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:53,653 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:29:53,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:29:53,653 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:29:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:29:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:29:55,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:55,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:29:55,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:29:55,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:29:55,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:29:55,893 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 [2019-01-18 17:29:55,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:29:55,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:29:55,943 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:29:55,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:29:55,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:29:58,780 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 8 treesize of output 7 [2019-01-18 17:29:58,780 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:58,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:58,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:29:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-18 17:29:58,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:29:58,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:29:58,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:29:58,999 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:29:58,999 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:30:01,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-18 17:30:01,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:01,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 35, 35] total 134 [2019-01-18 17:30:01,942 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:01,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-18 17:30:01,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-18 17:30:01,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2378, Invalid=15444, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:30:01,944 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 101 states. [2019-01-18 17:30:09,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:09,811 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2019-01-18 17:30:09,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-18 17:30:09,811 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 68 [2019-01-18 17:30:09,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:09,811 INFO L225 Difference]: With dead ends: 107 [2019-01-18 17:30:09,812 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 17:30:09,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2344 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=3787, Invalid=25283, Unknown=0, NotChecked=0, Total=29070 [2019-01-18 17:30:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 17:30:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-18 17:30:09,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-18 17:30:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2019-01-18 17:30:09,851 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 68 [2019-01-18 17:30:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:09,851 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2019-01-18 17:30:09,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-18 17:30:09,851 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2019-01-18 17:30:09,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-18 17:30:09,851 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:09,851 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1] [2019-01-18 17:30:09,851 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:09,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:09,852 INFO L82 PathProgramCache]: Analyzing trace with hash -986406475, now seen corresponding path program 49 times [2019-01-18 17:30:09,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:09,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:09,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:09,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:09,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:09,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:12,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:12,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:12,196 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:12,197 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:12,197 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:12,197 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 [2019-01-18 17:30:12,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:12,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:12,272 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:15,203 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 8 treesize of output 7 [2019-01-18 17:30:15,203 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:15,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:15,208 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:30:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:15,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:15,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:30:15,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:15,352 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:15,352 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:30:16,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:16,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:16,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 105 [2019-01-18 17:30:16,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:16,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-18 17:30:16,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-18 17:30:16,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:30:16,942 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 106 states. [2019-01-18 17:30:23,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:23,285 INFO L93 Difference]: Finished difference Result 108 states and 110 transitions. [2019-01-18 17:30:23,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-18 17:30:23,285 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 70 [2019-01-18 17:30:23,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:23,286 INFO L225 Difference]: With dead ends: 108 [2019-01-18 17:30:23,287 INFO L226 Difference]: Without dead ends: 72 [2019-01-18 17:30:23,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 78 SyntacticMatches, 25 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3274 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:30:23,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-18 17:30:23,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-18 17:30:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-18 17:30:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2019-01-18 17:30:23,326 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 70 [2019-01-18 17:30:23,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:23,326 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2019-01-18 17:30:23,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-18 17:30:23,326 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2019-01-18 17:30:23,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-18 17:30:23,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:23,327 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1, 1] [2019-01-18 17:30:23,327 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:23,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:23,328 INFO L82 PathProgramCache]: Analyzing trace with hash -227129428, now seen corresponding path program 50 times [2019-01-18 17:30:23,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:23,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:23,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:23,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:23,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:23,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:24,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:24,157 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:24,157 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:24,157 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:24,157 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:24,158 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:24,158 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 [2019-01-18 17:30:24,168 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:30:24,168 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:30:24,368 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-01-18 17:30:24,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:24,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:24,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:25,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 561 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:25,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:25,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 36 [2019-01-18 17:30:25,430 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:25,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-18 17:30:25,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-18 17:30:25,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=632, Invalid=700, Unknown=0, NotChecked=0, Total=1332 [2019-01-18 17:30:25,431 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 37 states. [2019-01-18 17:30:26,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:26,080 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2019-01-18 17:30:26,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-18 17:30:26,080 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2019-01-18 17:30:26,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:26,081 INFO L225 Difference]: With dead ends: 75 [2019-01-18 17:30:26,081 INFO L226 Difference]: Without dead ends: 73 [2019-01-18 17:30:26,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 107 SyntacticMatches, 68 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1890, Invalid=3080, Unknown=0, NotChecked=0, Total=4970 [2019-01-18 17:30:26,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-18 17:30:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-18 17:30:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-18 17:30:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2019-01-18 17:30:26,132 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 71 [2019-01-18 17:30:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:26,132 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2019-01-18 17:30:26,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-18 17:30:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2019-01-18 17:30:26,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-18 17:30:26,132 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:26,132 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1] [2019-01-18 17:30:26,132 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:26,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:26,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1548924138, now seen corresponding path program 51 times [2019-01-18 17:30:26,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:26,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:26,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:26,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:26,134 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:28,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:28,699 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:28,699 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:28,699 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:28,699 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:28,699 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 [2019-01-18 17:30:28,717 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:30:28,717 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:30:28,763 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:30:28,763 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:28,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:31,709 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 8 treesize of output 7 [2019-01-18 17:30:31,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:31,715 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:31,715 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:30:31,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-18 17:30:31,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:31,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:30:31,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:31,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:31,951 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:30:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 595 trivial. 0 not checked. [2019-01-18 17:30:35,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:35,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 37, 37] total 142 [2019-01-18 17:30:35,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:35,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-18 17:30:35,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-18 17:30:35,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2662, Invalid=17360, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:30:35,435 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 107 states. [2019-01-18 17:30:43,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:43,420 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-01-18 17:30:43,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-18 17:30:43,420 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 72 [2019-01-18 17:30:43,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:43,421 INFO L225 Difference]: With dead ends: 113 [2019-01-18 17:30:43,421 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:30:43,423 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=4225, Invalid=28355, Unknown=0, NotChecked=0, Total=32580 [2019-01-18 17:30:43,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:30:43,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-18 17:30:43,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-18 17:30:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2019-01-18 17:30:43,464 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 72 [2019-01-18 17:30:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:43,464 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2019-01-18 17:30:43,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-18 17:30:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2019-01-18 17:30:43,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-18 17:30:43,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:43,465 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1] [2019-01-18 17:30:43,465 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:43,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:43,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1198231019, now seen corresponding path program 52 times [2019-01-18 17:30:43,465 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:43,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:43,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:30:43,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:43,466 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:43,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:46,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:46,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:46,491 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:46,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:46,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:46,491 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 [2019-01-18 17:30:46,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:46,500 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:30:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:46,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:49,792 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 8 treesize of output 7 [2019-01-18 17:30:49,792 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:49,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:49,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:30:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:49,895 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:30:49,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:30:49,908 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:30:49,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:30:49,911 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:30:51,061 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:51,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:30:51,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 111 [2019-01-18 17:30:51,080 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:30:51,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-18 17:30:51,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-18 17:30:51,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=12101, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:30:51,081 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 112 states. [2019-01-18 17:30:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:30:57,763 INFO L93 Difference]: Finished difference Result 114 states and 116 transitions. [2019-01-18 17:30:57,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-18 17:30:57,763 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 74 [2019-01-18 17:30:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:30:57,764 INFO L225 Difference]: With dead ends: 114 [2019-01-18 17:30:57,764 INFO L226 Difference]: Without dead ends: 76 [2019-01-18 17:30:57,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 83 SyntacticMatches, 26 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3645 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=700, Invalid=21650, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:30:57,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-18 17:30:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-18 17:30:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-18 17:30:57,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2019-01-18 17:30:57,807 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 74 [2019-01-18 17:30:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:30:57,807 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2019-01-18 17:30:57,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-18 17:30:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2019-01-18 17:30:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-18 17:30:57,808 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:30:57,808 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1, 1] [2019-01-18 17:30:57,808 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:30:57,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:30:57,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2146155380, now seen corresponding path program 53 times [2019-01-18 17:30:57,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:30:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:57,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:30:57,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:30:57,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:30:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:30:58,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:58,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:58,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:30:58,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:30:58,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:30:58,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:30:58,918 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 [2019-01-18 17:30:58,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:30:58,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:30:59,139 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-18 17:30:59,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:30:59,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:30:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:30:59,157 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 630 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:00,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:00,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 38 [2019-01-18 17:31:00,594 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:00,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-18 17:31:00,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-18 17:31:00,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=705, Invalid=777, Unknown=0, NotChecked=0, Total=1482 [2019-01-18 17:31:00,595 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 39 states. [2019-01-18 17:31:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:01,324 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2019-01-18 17:31:01,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-18 17:31:01,325 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2019-01-18 17:31:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:01,326 INFO L225 Difference]: With dead ends: 79 [2019-01-18 17:31:01,326 INFO L226 Difference]: Without dead ends: 77 [2019-01-18 17:31:01,327 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 113 SyntacticMatches, 72 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2109, Invalid=3441, Unknown=0, NotChecked=0, Total=5550 [2019-01-18 17:31:01,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-18 17:31:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-18 17:31:01,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:31:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2019-01-18 17:31:01,387 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 75 [2019-01-18 17:31:01,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:01,387 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2019-01-18 17:31:01,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-18 17:31:01,387 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2019-01-18 17:31:01,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-18 17:31:01,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:01,388 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1] [2019-01-18 17:31:01,388 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:01,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:01,389 INFO L82 PathProgramCache]: Analyzing trace with hash -2106305526, now seen corresponding path program 54 times [2019-01-18 17:31:01,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:01,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:01,389 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:01,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:01,389 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:04,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:04,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:04,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:04,480 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:04,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:04,480 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 [2019-01-18 17:31:04,491 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:31:04,491 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:31:04,536 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:31:04,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:04,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:07,867 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 8 treesize of output 7 [2019-01-18 17:31:07,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:07,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:07,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:31:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-18 17:31:07,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:08,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:31:08,095 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:08,106 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:08,107 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:31:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-01-18 17:31:11,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:11,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 39, 39] total 150 [2019-01-18 17:31:11,915 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:11,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-18 17:31:11,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-18 17:31:11,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2962, Invalid=19388, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:31:11,917 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 113 states. [2019-01-18 17:31:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:21,480 INFO L93 Difference]: Finished difference Result 119 states and 123 transitions. [2019-01-18 17:31:21,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2019-01-18 17:31:21,481 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 76 [2019-01-18 17:31:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:21,482 INFO L225 Difference]: With dead ends: 119 [2019-01-18 17:31:21,482 INFO L226 Difference]: Without dead ends: 79 [2019-01-18 17:31:21,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2924 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=4687, Invalid=31603, Unknown=0, NotChecked=0, Total=36290 [2019-01-18 17:31:21,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-18 17:31:21,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-18 17:31:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-18 17:31:21,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2019-01-18 17:31:21,568 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2019-01-18 17:31:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:21,569 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2019-01-18 17:31:21,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-18 17:31:21,569 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2019-01-18 17:31:21,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-18 17:31:21,569 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:21,569 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1] [2019-01-18 17:31:21,570 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:21,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:21,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1075627403, now seen corresponding path program 55 times [2019-01-18 17:31:21,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:21,571 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:21,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:21,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:26,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:26,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:26,028 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:26,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:26,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:26,028 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 [2019-01-18 17:31:26,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:26,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:31:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:26,118 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:29,375 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 8 treesize of output 7 [2019-01-18 17:31:29,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,380 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,381 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:31:29,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:29,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:29,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:31:29,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:29,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:31:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:30,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:30,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 117 [2019-01-18 17:31:30,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:30,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2019-01-18 17:31:30,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2019-01-18 17:31:30,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=13457, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:31:30,984 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 118 states. [2019-01-18 17:31:39,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:39,170 INFO L93 Difference]: Finished difference Result 120 states and 122 transitions. [2019-01-18 17:31:39,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-18 17:31:39,170 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 78 [2019-01-18 17:31:39,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:39,172 INFO L225 Difference]: With dead ends: 120 [2019-01-18 17:31:39,172 INFO L226 Difference]: Without dead ends: 80 [2019-01-18 17:31:39,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 89 SyntacticMatches, 26 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3995 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=738, Invalid=24068, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:31:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-18 17:31:39,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-18 17:31:39,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-18 17:31:39,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2019-01-18 17:31:39,227 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 78 [2019-01-18 17:31:39,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:39,228 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2019-01-18 17:31:39,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2019-01-18 17:31:39,228 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2019-01-18 17:31:39,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-18 17:31:39,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:39,229 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1, 1] [2019-01-18 17:31:39,229 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:39,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:39,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1169619308, now seen corresponding path program 56 times [2019-01-18 17:31:39,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:39,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:39,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:31:39,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:39,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:39,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:39,935 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:39,935 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:39,935 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:39,935 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:39,935 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 [2019-01-18 17:31:39,944 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:31:39,944 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:31:40,187 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-18 17:31:40,187 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:40,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:40,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:40,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:41,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 703 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:41,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:41,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 40 [2019-01-18 17:31:41,752 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:41,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-18 17:31:41,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-18 17:31:41,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=782, Invalid=858, Unknown=0, NotChecked=0, Total=1640 [2019-01-18 17:31:41,753 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand 41 states. [2019-01-18 17:31:42,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:31:42,535 INFO L93 Difference]: Finished difference Result 83 states and 84 transitions. [2019-01-18 17:31:42,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-18 17:31:42,535 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2019-01-18 17:31:42,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:31:42,536 INFO L225 Difference]: With dead ends: 83 [2019-01-18 17:31:42,536 INFO L226 Difference]: Without dead ends: 81 [2019-01-18 17:31:42,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 119 SyntacticMatches, 76 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2340, Invalid=3822, Unknown=0, NotChecked=0, Total=6162 [2019-01-18 17:31:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-18 17:31:42,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-18 17:31:42,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-18 17:31:42,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2019-01-18 17:31:42,588 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 79 [2019-01-18 17:31:42,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:31:42,588 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2019-01-18 17:31:42,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-18 17:31:42,589 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2019-01-18 17:31:42,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-18 17:31:42,589 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:31:42,589 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1] [2019-01-18 17:31:42,589 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:31:42,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:31:42,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1898461994, now seen corresponding path program 57 times [2019-01-18 17:31:42,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:31:42,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:42,590 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:31:42,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:31:42,591 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:31:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:31:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:31:46,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:46,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:31:46,173 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:31:46,173 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:31:46,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:31:46,173 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 [2019-01-18 17:31:46,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:31:46,182 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:31:46,229 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:31:46,230 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:31:46,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:31:49,653 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 8 treesize of output 7 [2019-01-18 17:31:49,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,659 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:31:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-18 17:31:49,773 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:31:49,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:31:49,886 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:31:49,898 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:31:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 741 trivial. 0 not checked. [2019-01-18 17:31:54,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:31:54,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 41, 41] total 158 [2019-01-18 17:31:54,185 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:31:54,185 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-01-18 17:31:54,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-01-18 17:31:54,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3278, Invalid=21528, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:31:54,186 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 119 states. [2019-01-18 17:32:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:04,179 INFO L93 Difference]: Finished difference Result 125 states and 129 transitions. [2019-01-18 17:32:04,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2019-01-18 17:32:04,180 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 80 [2019-01-18 17:32:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:04,181 INFO L225 Difference]: With dead ends: 125 [2019-01-18 17:32:04,181 INFO L226 Difference]: Without dead ends: 83 [2019-01-18 17:32:04,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3238 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=5173, Invalid=35027, Unknown=0, NotChecked=0, Total=40200 [2019-01-18 17:32:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-18 17:32:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-18 17:32:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-18 17:32:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2019-01-18 17:32:04,243 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2019-01-18 17:32:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:04,243 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2019-01-18 17:32:04,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-01-18 17:32:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2019-01-18 17:32:04,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-18 17:32:04,243 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:04,244 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1] [2019-01-18 17:32:04,244 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:04,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848277, now seen corresponding path program 58 times [2019-01-18 17:32:04,244 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:04,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:04,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:04,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:04,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:04,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:07,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:07,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:07,626 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:07,626 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:07,626 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:07,626 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:07,626 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 [2019-01-18 17:32:07,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:07,637 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:07,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:12,429 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 8 treesize of output 7 [2019-01-18 17:32:12,430 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,436 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:32:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:12,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:12,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:32:12,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,564 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:12,565 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:32:13,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:13,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:13,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 123 [2019-01-18 17:32:13,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:13,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2019-01-18 17:32:13,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2019-01-18 17:32:13,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=14885, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:32:13,999 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 124 states. [2019-01-18 17:32:22,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:22,978 INFO L93 Difference]: Finished difference Result 126 states and 128 transitions. [2019-01-18 17:32:22,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-18 17:32:22,978 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 82 [2019-01-18 17:32:22,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:22,979 INFO L225 Difference]: With dead ends: 126 [2019-01-18 17:32:22,979 INFO L226 Difference]: Without dead ends: 84 [2019-01-18 17:32:22,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 93 SyntacticMatches, 28 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4447 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=776, Invalid=26614, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:32:22,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-18 17:32:23,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-18 17:32:23,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-18 17:32:23,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2019-01-18 17:32:23,032 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 82 [2019-01-18 17:32:23,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:23,032 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2019-01-18 17:32:23,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2019-01-18 17:32:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2019-01-18 17:32:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-18 17:32:23,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:23,033 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1, 1] [2019-01-18 17:32:23,033 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:23,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:23,033 INFO L82 PathProgramCache]: Analyzing trace with hash 928540236, now seen corresponding path program 59 times [2019-01-18 17:32:23,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:23,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:23,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:23,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:23,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:23,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:23,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:23,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:23,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:23,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:23,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:23,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:23,879 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 [2019-01-18 17:32:23,888 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:32:23,889 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:32:24,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-01-18 17:32:24,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:24,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:24,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 780 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:25,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:25,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 42 [2019-01-18 17:32:25,420 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:25,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-18 17:32:25,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-18 17:32:25,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=943, Unknown=0, NotChecked=0, Total=1806 [2019-01-18 17:32:25,421 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 43 states. [2019-01-18 17:32:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:26,237 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2019-01-18 17:32:26,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-18 17:32:26,237 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2019-01-18 17:32:26,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:26,238 INFO L225 Difference]: With dead ends: 87 [2019-01-18 17:32:26,238 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 17:32:26,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 125 SyntacticMatches, 80 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2583, Invalid=4223, Unknown=0, NotChecked=0, Total=6806 [2019-01-18 17:32:26,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 17:32:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-18 17:32:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-18 17:32:26,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2019-01-18 17:32:26,291 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 83 [2019-01-18 17:32:26,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:26,291 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2019-01-18 17:32:26,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-18 17:32:26,291 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2019-01-18 17:32:26,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-18 17:32:26,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:26,292 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1] [2019-01-18 17:32:26,292 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:26,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:26,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1280021942, now seen corresponding path program 60 times [2019-01-18 17:32:26,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:26,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:26,293 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:26,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:26,293 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:30,328 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:30,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:30,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:30,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:30,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:30,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:30,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 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 [2019-01-18 17:32:30,338 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:32:30,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:32:30,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:32:30,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:32:30,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:34,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 8 treesize of output 7 [2019-01-18 17:32:34,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:34,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:34,514 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:32:34,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-18 17:32:34,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:34,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:32:34,745 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:34,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:34,756 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:32:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-01-18 17:32:39,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:32:39,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 43, 43] total 166 [2019-01-18 17:32:39,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:32:39,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-01-18 17:32:39,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-01-18 17:32:39,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3610, Invalid=23780, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:32:39,516 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 125 states. [2019-01-18 17:32:50,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:32:50,550 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-01-18 17:32:50,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2019-01-18 17:32:50,550 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 84 [2019-01-18 17:32:50,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:32:50,551 INFO L225 Difference]: With dead ends: 131 [2019-01-18 17:32:50,551 INFO L226 Difference]: Without dead ends: 87 [2019-01-18 17:32:50,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3568 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=5683, Invalid=38627, Unknown=0, NotChecked=0, Total=44310 [2019-01-18 17:32:50,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-18 17:32:50,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-18 17:32:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-18 17:32:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2019-01-18 17:32:50,618 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 84 [2019-01-18 17:32:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:32:50,618 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2019-01-18 17:32:50,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-01-18 17:32:50,618 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2019-01-18 17:32:50,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-18 17:32:50,619 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:32:50,619 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1] [2019-01-18 17:32:50,619 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:32:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:32:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash -214584523, now seen corresponding path program 61 times [2019-01-18 17:32:50,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:32:50,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:50,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:32:50,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:32:50,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:32:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:54,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:54,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:54,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:32:54,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:32:54,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:32:54,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:32:54,414 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 [2019-01-18 17:32:54,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:32:54,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:32:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:32:54,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:32:58,609 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 8 treesize of output 7 [2019-01-18 17:32:58,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:58,614 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:58,614 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:32:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:32:58,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:32:58,746 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:32:58,746 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:32:58,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:32:58,750 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:33:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:00,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:00,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 129 [2019-01-18 17:33:00,327 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:00,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2019-01-18 17:33:00,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2019-01-18 17:33:00,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=385, Invalid=16385, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:33:00,329 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 130 states. [2019-01-18 17:33:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:09,888 INFO L93 Difference]: Finished difference Result 132 states and 134 transitions. [2019-01-18 17:33:09,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-18 17:33:09,888 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 86 [2019-01-18 17:33:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:09,889 INFO L225 Difference]: With dead ends: 132 [2019-01-18 17:33:09,889 INFO L226 Difference]: Without dead ends: 88 [2019-01-18 17:33:09,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 97 SyntacticMatches, 30 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4923 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=814, Invalid=29288, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:33:09,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-18 17:33:09,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-18 17:33:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-18 17:33:09,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2019-01-18 17:33:09,949 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 86 [2019-01-18 17:33:09,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:09,949 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2019-01-18 17:33:09,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2019-01-18 17:33:09,949 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2019-01-18 17:33:09,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-18 17:33:09,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:09,950 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1, 1] [2019-01-18 17:33:09,950 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:09,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:09,951 INFO L82 PathProgramCache]: Analyzing trace with hash -831354068, now seen corresponding path program 62 times [2019-01-18 17:33:09,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:09,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:09,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:09,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:09,952 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:10,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:10,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:10,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:10,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:10,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:10,736 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 [2019-01-18 17:33:10,746 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:33:10,746 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:33:11,057 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-18 17:33:11,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:11,064 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:11,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:11,102 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:12,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 861 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:12,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:12,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 44 [2019-01-18 17:33:12,415 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:12,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-18 17:33:12,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-18 17:33:12,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=948, Invalid=1032, Unknown=0, NotChecked=0, Total=1980 [2019-01-18 17:33:12,416 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 45 states. [2019-01-18 17:33:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:13,552 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2019-01-18 17:33:13,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-18 17:33:13,552 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2019-01-18 17:33:13,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:13,553 INFO L225 Difference]: With dead ends: 91 [2019-01-18 17:33:13,553 INFO L226 Difference]: Without dead ends: 89 [2019-01-18 17:33:13,554 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 131 SyntacticMatches, 84 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2838, Invalid=4644, Unknown=0, NotChecked=0, Total=7482 [2019-01-18 17:33:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-18 17:33:13,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-18 17:33:13,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-18 17:33:13,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2019-01-18 17:33:13,648 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 87 [2019-01-18 17:33:13,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:13,648 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2019-01-18 17:33:13,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-18 17:33:13,648 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2019-01-18 17:33:13,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-18 17:33:13,649 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:13,649 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1] [2019-01-18 17:33:13,649 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:13,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:13,649 INFO L82 PathProgramCache]: Analyzing trace with hash -2170518, now seen corresponding path program 63 times [2019-01-18 17:33:13,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:13,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:13,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:13,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:13,651 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:17,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:17,993 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:17,993 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:17,993 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:17,993 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:17,993 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) [2019-01-18 17:33:18,006 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:33:18,006 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:33:18,056 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:33:18,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:33:18,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:22,348 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 8 treesize of output 7 [2019-01-18 17:33:22,348 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:22,354 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:33:22,354 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:33:22,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-18 17:33:22,473 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:22,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:33:22,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:22,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:33:22,604 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:33:27,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2019-01-18 17:33:27,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:27,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 45, 45] total 174 [2019-01-18 17:33:27,688 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:27,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-01-18 17:33:27,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-01-18 17:33:27,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3958, Invalid=26144, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:33:27,690 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 131 states. [2019-01-18 17:33:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:33:40,110 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2019-01-18 17:33:40,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2019-01-18 17:33:40,110 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 88 [2019-01-18 17:33:40,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:33:40,111 INFO L225 Difference]: With dead ends: 137 [2019-01-18 17:33:40,111 INFO L226 Difference]: Without dead ends: 91 [2019-01-18 17:33:40,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3914 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=6217, Invalid=42403, Unknown=0, NotChecked=0, Total=48620 [2019-01-18 17:33:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-18 17:33:40,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-18 17:33:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-18 17:33:40,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2019-01-18 17:33:40,174 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 88 [2019-01-18 17:33:40,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:33:40,174 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2019-01-18 17:33:40,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-01-18 17:33:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2019-01-18 17:33:40,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-18 17:33:40,175 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:33:40,175 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1] [2019-01-18 17:33:40,175 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:33:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:33:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash -378707051, now seen corresponding path program 64 times [2019-01-18 17:33:40,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:33:40,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:40,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:33:40,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:33:40,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:33:40,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:44,266 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:44,266 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:33:44,266 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:33:44,266 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:33:44,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:33:44,267 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 [2019-01-18 17:33:44,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:33:44,277 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:33:44,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:33:44,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:33:48,831 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 8 treesize of output 7 [2019-01-18 17:33:48,831 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:48,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:33:48,837 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:33:48,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:48,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:33:48,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:33:48,979 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:33:48,984 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:33:48,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:33:50,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:33:50,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:33:50,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 135 [2019-01-18 17:33:50,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:33:50,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2019-01-18 17:33:50,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2019-01-18 17:33:50,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=17957, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:33:50,674 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 136 states. [2019-01-18 17:34:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:01,304 INFO L93 Difference]: Finished difference Result 138 states and 140 transitions. [2019-01-18 17:34:01,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-18 17:34:01,304 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 90 [2019-01-18 17:34:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:01,305 INFO L225 Difference]: With dead ends: 138 [2019-01-18 17:34:01,305 INFO L226 Difference]: Without dead ends: 92 [2019-01-18 17:34:01,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 102 SyntacticMatches, 31 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5376 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=852, Invalid=32090, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 17:34:01,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-18 17:34:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-18 17:34:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-18 17:34:01,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2019-01-18 17:34:01,367 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 90 [2019-01-18 17:34:01,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:01,367 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2019-01-18 17:34:01,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2019-01-18 17:34:01,367 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2019-01-18 17:34:01,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-18 17:34:01,368 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:01,368 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1, 1] [2019-01-18 17:34:01,368 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:01,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:01,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1442879476, now seen corresponding path program 65 times [2019-01-18 17:34:01,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:01,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:01,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:01,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:01,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:02,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:02,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:02,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:02,287 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:02,287 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:02,287 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:02,287 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 [2019-01-18 17:34:02,296 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:34:02,296 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:34:02,633 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-18 17:34:02,633 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:02,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:02,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 946 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:04,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:04,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 46 [2019-01-18 17:34:04,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:04,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:34:04,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:34:04,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1037, Invalid=1125, Unknown=0, NotChecked=0, Total=2162 [2019-01-18 17:34:04,396 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand 47 states. [2019-01-18 17:34:05,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:05,381 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2019-01-18 17:34:05,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-18 17:34:05,381 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2019-01-18 17:34:05,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:05,382 INFO L225 Difference]: With dead ends: 95 [2019-01-18 17:34:05,382 INFO L226 Difference]: Without dead ends: 93 [2019-01-18 17:34:05,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 137 SyntacticMatches, 88 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3105, Invalid=5085, Unknown=0, NotChecked=0, Total=8190 [2019-01-18 17:34:05,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-18 17:34:05,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-18 17:34:05,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-18 17:34:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2019-01-18 17:34:05,448 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 91 [2019-01-18 17:34:05,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:05,448 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2019-01-18 17:34:05,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:34:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2019-01-18 17:34:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-18 17:34:05,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:05,448 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1] [2019-01-18 17:34:05,448 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1779588982, now seen corresponding path program 66 times [2019-01-18 17:34:05,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:05,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:05,449 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:05,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:05,450 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:09,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:09,484 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:09,484 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:09,484 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:09,484 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:09,485 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 [2019-01-18 17:34:09,511 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:34:09,512 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:34:09,566 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:34:09,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:09,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:14,359 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 8 treesize of output 7 [2019-01-18 17:34:14,359 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:14,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:14,366 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:34:14,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-18 17:34:14,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:14,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:34:14,615 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:14,624 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:14,625 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:34:20,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [2019-01-18 17:34:20,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:20,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 47, 47] total 182 [2019-01-18 17:34:20,233 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:20,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-01-18 17:34:20,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-01-18 17:34:20,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4322, Invalid=28620, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 17:34:20,234 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 137 states. [2019-01-18 17:34:32,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:32,914 INFO L93 Difference]: Finished difference Result 143 states and 147 transitions. [2019-01-18 17:34:32,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2019-01-18 17:34:32,915 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 92 [2019-01-18 17:34:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:32,915 INFO L225 Difference]: With dead ends: 143 [2019-01-18 17:34:32,916 INFO L226 Difference]: Without dead ends: 95 [2019-01-18 17:34:32,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4276 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=6775, Invalid=46355, Unknown=0, NotChecked=0, Total=53130 [2019-01-18 17:34:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-18 17:34:32,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-18 17:34:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-18 17:34:32,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2019-01-18 17:34:32,982 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2019-01-18 17:34:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:32,982 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2019-01-18 17:34:32,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-01-18 17:34:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2019-01-18 17:34:32,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-18 17:34:32,982 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:32,982 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1] [2019-01-18 17:34:32,983 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:32,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash -939783179, now seen corresponding path program 67 times [2019-01-18 17:34:32,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:32,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:32,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:32,984 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:37,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:37,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:37,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:37,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:37,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:37,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:37,408 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 [2019-01-18 17:34:37,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:37,416 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:34:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:37,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:42,406 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 8 treesize of output 7 [2019-01-18 17:34:42,407 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:42,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:42,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:34:42,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:42,542 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:42,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:34:42,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:34:42,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:34:42,558 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:34:44,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:44,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:44,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 141 [2019-01-18 17:34:44,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:44,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2019-01-18 17:34:44,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2019-01-18 17:34:44,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=421, Invalid=19601, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:34:44,456 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 142 states. [2019-01-18 17:34:55,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:55,598 INFO L93 Difference]: Finished difference Result 144 states and 146 transitions. [2019-01-18 17:34:55,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-18 17:34:55,598 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 94 [2019-01-18 17:34:55,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:55,599 INFO L225 Difference]: With dead ends: 144 [2019-01-18 17:34:55,599 INFO L226 Difference]: Without dead ends: 96 [2019-01-18 17:34:55,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 106 SyntacticMatches, 33 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5898 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=890, Invalid=35020, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 17:34:55,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-18 17:34:55,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-18 17:34:55,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-18 17:34:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2019-01-18 17:34:55,665 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 94 [2019-01-18 17:34:55,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:55,665 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2019-01-18 17:34:55,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2019-01-18 17:34:55,665 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2019-01-18 17:34:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-18 17:34:55,665 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:55,665 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1, 1] [2019-01-18 17:34:55,665 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:55,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:55,666 INFO L82 PathProgramCache]: Analyzing trace with hash 779681004, now seen corresponding path program 68 times [2019-01-18 17:34:55,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:55,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:55,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:34:55,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:55,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:55,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:34:56,559 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:56,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:56,559 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:34:56,559 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:34:56,559 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:34:56,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:34:56,559 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 [2019-01-18 17:34:56,568 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:34:56,568 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:34:56,954 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-01-18 17:34:56,954 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:34:56,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:34:56,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:56,986 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:34:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 1035 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:34:58,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:34:58,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 48 [2019-01-18 17:34:58,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:34:58,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-18 17:34:58,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-18 17:34:58,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1130, Invalid=1222, Unknown=0, NotChecked=0, Total=2352 [2019-01-18 17:34:58,609 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 49 states. [2019-01-18 17:34:59,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:34:59,634 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2019-01-18 17:34:59,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-18 17:34:59,635 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2019-01-18 17:34:59,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:34:59,636 INFO L225 Difference]: With dead ends: 99 [2019-01-18 17:34:59,636 INFO L226 Difference]: Without dead ends: 97 [2019-01-18 17:34:59,637 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 143 SyntacticMatches, 92 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3384, Invalid=5546, Unknown=0, NotChecked=0, Total=8930 [2019-01-18 17:34:59,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-18 17:34:59,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-18 17:34:59,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-18 17:34:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2019-01-18 17:34:59,704 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 95 [2019-01-18 17:34:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:34:59,704 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2019-01-18 17:34:59,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-18 17:34:59,704 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2019-01-18 17:34:59,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-18 17:34:59,704 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:34:59,704 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1] [2019-01-18 17:34:59,705 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:34:59,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:34:59,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1599690838, now seen corresponding path program 69 times [2019-01-18 17:34:59,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:34:59,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:59,706 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:34:59,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:34:59,706 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:34:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:04,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:04,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:04,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:04,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:04,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:04,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:04,109 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 [2019-01-18 17:35:04,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:35:04,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:35:04,174 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:35:04,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:04,179 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:09,355 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 8 treesize of output 7 [2019-01-18 17:35:09,355 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:35:09,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-18 17:35:09,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:09,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:35:09,631 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:09,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:35:15,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 1081 trivial. 0 not checked. [2019-01-18 17:35:15,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:15,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 49, 49] total 190 [2019-01-18 17:35:15,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:15,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2019-01-18 17:35:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2019-01-18 17:35:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4702, Invalid=31208, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 17:35:15,966 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 143 states. [2019-01-18 17:35:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:30,402 INFO L93 Difference]: Finished difference Result 149 states and 153 transitions. [2019-01-18 17:35:30,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2019-01-18 17:35:30,403 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 96 [2019-01-18 17:35:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:30,403 INFO L225 Difference]: With dead ends: 149 [2019-01-18 17:35:30,403 INFO L226 Difference]: Without dead ends: 99 [2019-01-18 17:35:30,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4654 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=7357, Invalid=50483, Unknown=0, NotChecked=0, Total=57840 [2019-01-18 17:35:30,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-18 17:35:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-18 17:35:30,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-18 17:35:30,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2019-01-18 17:35:30,477 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2019-01-18 17:35:30,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:30,477 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2019-01-18 17:35:30,477 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2019-01-18 17:35:30,477 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2019-01-18 17:35:30,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-18 17:35:30,477 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:30,477 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1] [2019-01-18 17:35:30,478 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:30,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:30,478 INFO L82 PathProgramCache]: Analyzing trace with hash 431729749, now seen corresponding path program 70 times [2019-01-18 17:35:30,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:30,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:30,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:30,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:30,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:34,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:34,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:34,972 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:34,972 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:34,973 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:34,973 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 [2019-01-18 17:35:34,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:34,982 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:35:35,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:35,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:40,340 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 8 treesize of output 7 [2019-01-18 17:35:40,341 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,345 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:35:40,479 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:40,480 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:40,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:35:40,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,495 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:35:40,496 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:35:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:42,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:42,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 147 [2019-01-18 17:35:42,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:42,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2019-01-18 17:35:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2019-01-18 17:35:42,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=439, Invalid=21317, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:35:42,749 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 148 states. [2019-01-18 17:35:53,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:53,901 INFO L93 Difference]: Finished difference Result 150 states and 152 transitions. [2019-01-18 17:35:53,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-18 17:35:53,901 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 98 [2019-01-18 17:35:53,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:53,902 INFO L225 Difference]: With dead ends: 150 [2019-01-18 17:35:53,902 INFO L226 Difference]: Without dead ends: 100 [2019-01-18 17:35:53,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 35 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6444 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=928, Invalid=38078, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 17:35:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-18 17:35:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-18 17:35:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-18 17:35:53,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2019-01-18 17:35:53,975 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 98 [2019-01-18 17:35:53,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:53,976 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2019-01-18 17:35:53,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2019-01-18 17:35:53,976 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2019-01-18 17:35:53,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-18 17:35:53,976 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:53,976 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1, 1] [2019-01-18 17:35:53,977 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:53,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:53,977 INFO L82 PathProgramCache]: Analyzing trace with hash 634997196, now seen corresponding path program 71 times [2019-01-18 17:35:53,977 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:53,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:53,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:35:53,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:53,978 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:54,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:35:54,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:54,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:54,909 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:35:54,910 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:35:54,910 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:35:54,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:35:54,910 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 [2019-01-18 17:35:54,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:35:54,918 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:35:55,364 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-18 17:35:55,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:35:55,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:35:55,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:55,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:35:57,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 1128 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:35:57,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:35:57,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 50 [2019-01-18 17:35:57,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:35:57,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-18 17:35:57,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-18 17:35:57,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1227, Invalid=1323, Unknown=0, NotChecked=0, Total=2550 [2019-01-18 17:35:57,336 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand 51 states. [2019-01-18 17:35:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:35:58,472 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2019-01-18 17:35:58,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-18 17:35:58,472 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2019-01-18 17:35:58,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:35:58,473 INFO L225 Difference]: With dead ends: 103 [2019-01-18 17:35:58,473 INFO L226 Difference]: Without dead ends: 101 [2019-01-18 17:35:58,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 149 SyntacticMatches, 96 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3675, Invalid=6027, Unknown=0, NotChecked=0, Total=9702 [2019-01-18 17:35:58,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-18 17:35:58,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-18 17:35:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-18 17:35:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 102 transitions. [2019-01-18 17:35:58,545 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 102 transitions. Word has length 99 [2019-01-18 17:35:58,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:35:58,545 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 102 transitions. [2019-01-18 17:35:58,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-18 17:35:58,545 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2019-01-18 17:35:58,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-18 17:35:58,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:35:58,546 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1] [2019-01-18 17:35:58,546 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:35:58,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:35:58,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1789921590, now seen corresponding path program 72 times [2019-01-18 17:35:58,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:35:58,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:58,546 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:35:58,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:35:58,547 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:35:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:03,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:03,268 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:03,268 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:03,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:03,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:03,268 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 [2019-01-18 17:36:03,276 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:36:03,276 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:36:03,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:36:03,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:03,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:09,034 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 8 treesize of output 7 [2019-01-18 17:36:09,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,040 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:36:09,176 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-18 17:36:09,176 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:09,308 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:36:09,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:09,320 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:36:15,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 1176 trivial. 0 not checked. [2019-01-18 17:36:15,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:15,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 51, 51] total 198 [2019-01-18 17:36:15,992 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:15,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2019-01-18 17:36:15,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2019-01-18 17:36:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5098, Invalid=33908, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 17:36:15,995 INFO L87 Difference]: Start difference. First operand 101 states and 102 transitions. Second operand 149 states. [2019-01-18 17:36:31,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:31,739 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2019-01-18 17:36:31,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2019-01-18 17:36:31,740 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 100 [2019-01-18 17:36:31,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:31,740 INFO L225 Difference]: With dead ends: 155 [2019-01-18 17:36:31,740 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 17:36:31,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5048 ImplicationChecksByTransitivity, 22.2s TimeCoverageRelationStatistics Valid=7963, Invalid=54787, Unknown=0, NotChecked=0, Total=62750 [2019-01-18 17:36:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 17:36:31,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-18 17:36:31,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-18 17:36:31,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2019-01-18 17:36:31,817 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 100 [2019-01-18 17:36:31,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:31,817 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2019-01-18 17:36:31,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2019-01-18 17:36:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2019-01-18 17:36:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-18 17:36:31,817 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:31,817 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1] [2019-01-18 17:36:31,818 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:31,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:31,818 INFO L82 PathProgramCache]: Analyzing trace with hash -16366411, now seen corresponding path program 73 times [2019-01-18 17:36:31,818 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:31,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:31,818 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:36:31,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:31,819 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:36,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:36,713 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:36,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:36,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:36,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:36,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:36,714 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 [2019-01-18 17:36:36,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:36,723 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:36:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:36,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:42,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 8 treesize of output 7 [2019-01-18 17:36:42,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:42,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:42,945 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:36:43,089 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:43,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:36:43,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:36:43,102 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:36:43,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:36:43,105 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:36:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:45,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:36:45,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 153 [2019-01-18 17:36:45,401 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:36:45,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2019-01-18 17:36:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2019-01-18 17:36:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=23105, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:36:45,402 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 154 states. [2019-01-18 17:36:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:36:57,337 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2019-01-18 17:36:57,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-18 17:36:57,338 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 102 [2019-01-18 17:36:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:36:57,339 INFO L225 Difference]: With dead ends: 156 [2019-01-18 17:36:57,339 INFO L226 Difference]: Without dead ends: 104 [2019-01-18 17:36:57,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 114 SyntacticMatches, 37 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7014 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=966, Invalid=41264, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 17:36:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-18 17:36:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-18 17:36:57,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-18 17:36:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2019-01-18 17:36:57,415 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 102 [2019-01-18 17:36:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:36:57,416 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2019-01-18 17:36:57,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2019-01-18 17:36:57,416 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2019-01-18 17:36:57,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-18 17:36:57,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:36:57,416 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1, 1] [2019-01-18 17:36:57,416 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:36:57,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:36:57,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1603948204, now seen corresponding path program 74 times [2019-01-18 17:36:57,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:36:57,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:57,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:36:57,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:36:57,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:36:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:36:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:58,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:58,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:36:58,655 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:36:58,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:36:58,656 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:36:58,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 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 [2019-01-18 17:36:58,665 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:36:58,665 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:36:59,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-18 17:36:59,153 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:36:59,160 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:36:59,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:36:59,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:01,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 1225 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:01,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:01,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 52 [2019-01-18 17:37:01,179 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:01,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-18 17:37:01,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-18 17:37:01,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1328, Invalid=1428, Unknown=0, NotChecked=0, Total=2756 [2019-01-18 17:37:01,180 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand 53 states. [2019-01-18 17:37:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:02,418 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2019-01-18 17:37:02,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-18 17:37:02,418 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2019-01-18 17:37:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:02,419 INFO L225 Difference]: With dead ends: 107 [2019-01-18 17:37:02,419 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 17:37:02,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 356 GetRequests, 155 SyntacticMatches, 100 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3978, Invalid=6528, Unknown=0, NotChecked=0, Total=10506 [2019-01-18 17:37:02,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 17:37:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-18 17:37:02,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-18 17:37:02,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2019-01-18 17:37:02,505 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 103 [2019-01-18 17:37:02,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:02,505 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2019-01-18 17:37:02,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-18 17:37:02,505 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2019-01-18 17:37:02,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-18 17:37:02,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:02,506 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1] [2019-01-18 17:37:02,506 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:02,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1817211414, now seen corresponding path program 75 times [2019-01-18 17:37:02,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:02,507 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:02,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:02,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:07,660 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:07,660 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:07,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:07,661 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:07,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:07,661 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 [2019-01-18 17:37:07,669 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:37:07,669 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:37:07,732 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:37:07,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:37:07,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:14,159 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 8 treesize of output 7 [2019-01-18 17:37:14,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:14,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:14,165 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:37:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-18 17:37:14,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:14,444 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:37:14,445 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:14,454 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:14,454 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:37:21,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 1275 trivial. 0 not checked. [2019-01-18 17:37:21,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:21,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 53, 53] total 206 [2019-01-18 17:37:21,461 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:21,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2019-01-18 17:37:21,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2019-01-18 17:37:21,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5510, Invalid=36720, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 17:37:21,463 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 155 states. [2019-01-18 17:37:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:37:37,385 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2019-01-18 17:37:37,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2019-01-18 17:37:37,385 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 104 [2019-01-18 17:37:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:37:37,386 INFO L225 Difference]: With dead ends: 161 [2019-01-18 17:37:37,386 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 17:37:37,389 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5458 ImplicationChecksByTransitivity, 24.0s TimeCoverageRelationStatistics Valid=8593, Invalid=59267, Unknown=0, NotChecked=0, Total=67860 [2019-01-18 17:37:37,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 17:37:37,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-18 17:37:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-18 17:37:37,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2019-01-18 17:37:37,468 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 104 [2019-01-18 17:37:37,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:37:37,468 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2019-01-18 17:37:37,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2019-01-18 17:37:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2019-01-18 17:37:37,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-18 17:37:37,468 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:37:37,468 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1] [2019-01-18 17:37:37,468 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:37:37,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:37:37,469 INFO L82 PathProgramCache]: Analyzing trace with hash -843721451, now seen corresponding path program 76 times [2019-01-18 17:37:37,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:37:37,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:37,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:37:37,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:37:37,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:37:37,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:42,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:42,834 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:37:42,834 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:37:42,834 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:37:42,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:37:42,834 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 [2019-01-18 17:37:42,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:37:42,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:37:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:37:42,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:37:49,308 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 8 treesize of output 7 [2019-01-18 17:37:49,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:49,313 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:49,313 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:37:49,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:49,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:37:49,474 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:37:49,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:37:49,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:37:49,478 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:37:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:37:51,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:37:51,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 159 [2019-01-18 17:37:51,943 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:37:51,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2019-01-18 17:37:51,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2019-01-18 17:37:51,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=475, Invalid=24965, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:37:51,945 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 160 states. [2019-01-18 17:38:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:04,015 INFO L93 Difference]: Finished difference Result 162 states and 164 transitions. [2019-01-18 17:38:04,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-18 17:38:04,015 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 106 [2019-01-18 17:38:04,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:04,016 INFO L225 Difference]: With dead ends: 162 [2019-01-18 17:38:04,016 INFO L226 Difference]: Without dead ends: 108 [2019-01-18 17:38:04,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 118 SyntacticMatches, 39 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7608 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=1004, Invalid=44578, Unknown=0, NotChecked=0, Total=45582 [2019-01-18 17:38:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-18 17:38:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-18 17:38:04,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-18 17:38:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2019-01-18 17:38:04,105 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 106 [2019-01-18 17:38:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:04,105 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2019-01-18 17:38:04,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2019-01-18 17:38:04,105 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2019-01-18 17:38:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-18 17:38:04,105 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:04,105 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1, 1] [2019-01-18 17:38:04,106 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:04,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:04,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1354107788, now seen corresponding path program 77 times [2019-01-18 17:38:04,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:04,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:04,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:04,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:04,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:04,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:05,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:05,493 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:05,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:05,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:05,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:05,494 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 [2019-01-18 17:38:05,502 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:38:05,502 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:38:06,045 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-01-18 17:38:06,045 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:06,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:06,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:06,096 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 1326 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:08,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:08,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 54 [2019-01-18 17:38:08,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:08,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-18 17:38:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-18 17:38:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1433, Invalid=1537, Unknown=0, NotChecked=0, Total=2970 [2019-01-18 17:38:08,041 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 55 states. [2019-01-18 17:38:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:09,339 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2019-01-18 17:38:09,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-18 17:38:09,340 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2019-01-18 17:38:09,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:09,340 INFO L225 Difference]: With dead ends: 111 [2019-01-18 17:38:09,340 INFO L226 Difference]: Without dead ends: 109 [2019-01-18 17:38:09,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 161 SyntacticMatches, 104 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4293, Invalid=7049, Unknown=0, NotChecked=0, Total=11342 [2019-01-18 17:38:09,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-18 17:38:09,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-18 17:38:09,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-18 17:38:09,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2019-01-18 17:38:09,428 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 107 [2019-01-18 17:38:09,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:09,428 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2019-01-18 17:38:09,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-18 17:38:09,428 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2019-01-18 17:38:09,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-18 17:38:09,428 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:09,428 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1] [2019-01-18 17:38:09,429 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:09,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:09,429 INFO L82 PathProgramCache]: Analyzing trace with hash -972329718, now seen corresponding path program 78 times [2019-01-18 17:38:09,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:09,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:09,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:09,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:09,430 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:15,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:15,264 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:15,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:15,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:15,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:15,265 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 [2019-01-18 17:38:15,273 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:38:15,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:38:15,337 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:38:15,337 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:38:15,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:21,918 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 8 treesize of output 7 [2019-01-18 17:38:21,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:21,923 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:21,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2019-01-18 17:38:22,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-18 17:38:22,070 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:22,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:38:22,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:22,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:22,227 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:12 [2019-01-18 17:38:29,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 1378 trivial. 0 not checked. [2019-01-18 17:38:29,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:38:29,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 55, 55] total 214 [2019-01-18 17:38:29,934 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:38:29,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2019-01-18 17:38:29,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2019-01-18 17:38:29,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5938, Invalid=39644, Unknown=0, NotChecked=0, Total=45582 [2019-01-18 17:38:29,936 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 161 states. [2019-01-18 17:38:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:38:46,997 INFO L93 Difference]: Finished difference Result 167 states and 171 transitions. [2019-01-18 17:38:46,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2019-01-18 17:38:46,998 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 108 [2019-01-18 17:38:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:38:46,998 INFO L225 Difference]: With dead ends: 167 [2019-01-18 17:38:46,999 INFO L226 Difference]: Without dead ends: 111 [2019-01-18 17:38:47,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5884 ImplicationChecksByTransitivity, 25.9s TimeCoverageRelationStatistics Valid=9247, Invalid=63923, Unknown=0, NotChecked=0, Total=73170 [2019-01-18 17:38:47,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-18 17:38:47,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-18 17:38:47,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-18 17:38:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2019-01-18 17:38:47,090 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2019-01-18 17:38:47,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:38:47,091 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2019-01-18 17:38:47,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2019-01-18 17:38:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2019-01-18 17:38:47,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-18 17:38:47,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:38:47,091 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1] [2019-01-18 17:38:47,091 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:38:47,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:38:47,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1323016843, now seen corresponding path program 79 times [2019-01-18 17:38:47,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:38:47,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:47,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:38:47,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:38:47,092 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:38:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:52,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:52,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:52,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:38:52,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:38:52,708 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:38:52,708 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:38:52,708 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 [2019-01-18 17:38:52,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:38:52,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:38:52,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:38:52,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:38:59,350 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 8 treesize of output 7 [2019-01-18 17:38:59,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,355 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,355 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2019-01-18 17:38:59,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:38:59,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:38:59,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2019-01-18 17:38:59,517 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-18 17:38:59,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2019-01-18 17:39:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:02,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:02,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 165 [2019-01-18 17:39:02,481 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:02,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2019-01-18 17:39:02,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2019-01-18 17:39:02,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=493, Invalid=26897, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:39:02,482 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 166 states. [2019-01-18 17:39:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:16,002 INFO L93 Difference]: Finished difference Result 168 states and 170 transitions. [2019-01-18 17:39:16,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-18 17:39:16,002 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 110 [2019-01-18 17:39:16,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:16,003 INFO L225 Difference]: With dead ends: 168 [2019-01-18 17:39:16,003 INFO L226 Difference]: Without dead ends: 112 [2019-01-18 17:39:16,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 122 SyntacticMatches, 41 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8226 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=1042, Invalid=48020, Unknown=0, NotChecked=0, Total=49062 [2019-01-18 17:39:16,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-18 17:39:16,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-18 17:39:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-18 17:39:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2019-01-18 17:39:16,096 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 110 [2019-01-18 17:39:16,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:16,097 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2019-01-18 17:39:16,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2019-01-18 17:39:16,097 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2019-01-18 17:39:16,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-18 17:39:16,097 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:16,097 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1, 1] [2019-01-18 17:39:16,097 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:16,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:16,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1280933780, now seen corresponding path program 80 times [2019-01-18 17:39:16,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:16,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:16,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:39:16,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:16,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:16,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:17,420 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:17,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:17,420 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:17,421 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:17,421 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:17,421 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:17,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 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 [2019-01-18 17:39:17,429 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:39:17,430 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:39:18,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-18 17:39:18,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:18,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:39:18,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:18,053 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:39:20,144 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 1431 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:20,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:39:20,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 56 [2019-01-18 17:39:20,165 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:39:20,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-18 17:39:20,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-18 17:39:20,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1542, Invalid=1650, Unknown=0, NotChecked=0, Total=3192 [2019-01-18 17:39:20,166 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand 57 states. [2019-01-18 17:39:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:39:21,695 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2019-01-18 17:39:21,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-18 17:39:21,696 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2019-01-18 17:39:21,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:39:21,697 INFO L225 Difference]: With dead ends: 115 [2019-01-18 17:39:21,697 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 17:39:21,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 167 SyntacticMatches, 108 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4620, Invalid=7590, Unknown=0, NotChecked=0, Total=12210 [2019-01-18 17:39:21,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 17:39:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-18 17:39:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-18 17:39:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2019-01-18 17:39:21,793 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 111 [2019-01-18 17:39:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:39:21,793 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2019-01-18 17:39:21,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-18 17:39:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2019-01-18 17:39:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-18 17:39:21,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:39:21,794 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1] [2019-01-18 17:39:21,794 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:39:21,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:39:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1054239702, now seen corresponding path program 81 times [2019-01-18 17:39:21,794 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:39:21,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:21,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:39:21,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:39:21,795 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:39:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:39:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:39:27,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:27,675 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:39:27,675 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:39:27,675 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:39:27,675 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:39:27,676 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 [2019-01-18 17:39:27,683 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:39:27,683 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:39:27,747 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:39:27,747 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:39:27,752 INFO L273 TraceCheckSpWp]: Computing forward predicates...