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/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-08 13:51:49,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-08 13:51:49,041 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-08 13:51:49,054 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-08 13:51:49,055 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-08 13:51:49,056 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-08 13:51:49,057 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-08 13:51:49,060 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-08 13:51:49,062 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-08 13:51:49,063 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-08 13:51:49,064 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-08 13:51:49,065 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-08 13:51:49,066 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-08 13:51:49,067 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-08 13:51:49,068 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-08 13:51:49,069 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-08 13:51:49,070 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-08 13:51:49,072 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-08 13:51:49,075 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-08 13:51:49,076 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-08 13:51:49,078 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-08 13:51:49,079 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-08 13:51:49,082 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-08 13:51:49,082 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-08 13:51:49,083 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-08 13:51:49,084 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-08 13:51:49,085 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-08 13:51:49,086 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-08 13:51:49,090 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-08 13:51:49,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-08 13:51:49,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-08 13:51:49,093 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-08 13:51:49,093 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-08 13:51:49,096 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-08 13:51:49,097 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-08 13:51:49,097 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-08 13:51:49,099 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-08 13:51:49,124 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-08 13:51:49,125 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-08 13:51:49,126 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-08 13:51:49,126 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-08 13:51:49,126 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-08 13:51:49,126 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-08 13:51:49,127 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-08 13:51:49,127 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-08 13:51:49,127 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-08 13:51:49,127 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-08 13:51:49,128 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-08 13:51:49,128 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-08 13:51:49,128 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-08 13:51:49,128 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-08 13:51:49,129 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-08 13:51:49,129 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-08 13:51:49,129 INFO L133 SettingsManager]: * Use SBE=true [2019-01-08 13:51:49,130 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-08 13:51:49,130 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-08 13:51:49,130 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-08 13:51:49,130 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-08 13:51:49,130 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-08 13:51:49,131 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-08 13:51:49,131 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-08 13:51:49,131 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-08 13:51:49,131 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-08 13:51:49,131 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-08 13:51:49,132 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-08 13:51:49,132 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-08 13:51:49,132 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-08 13:51:49,132 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-08 13:51:49,132 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-08 13:51:49,133 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-08 13:51:49,133 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-08 13:51:49,133 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-08 13:51:49,133 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-08 13:51:49,134 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-08 13:51:49,134 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-08 13:51:49,134 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-08 13:51:49,134 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-08 13:51:49,182 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-08 13:51:49,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-08 13:51:49,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-08 13:51:49,206 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-08 13:51:49,206 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-08 13:51:49,209 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2019-01-08 13:51:49,210 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-01-08 13:51:49,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-08 13:51:49,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-08 13:51:49,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-08 13:51:49,262 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-08 13:51:49,262 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-08 13:51:49,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-08 13:51:49,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-08 13:51:49,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-08 13:51:49,311 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-08 13:51:49,326 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,326 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/1) ... [2019-01-08 13:51:49,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-08 13:51:49,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-08 13:51:49,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-08 13:51:49,340 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-08 13:51:49,341 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-08 13:51:49,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-08 13:51:49,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-08 13:51:49,603 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-08 13:51:49,603 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-08 13:51:49,605 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:51:49 BoogieIcfgContainer [2019-01-08 13:51:49,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-08 13:51:49,606 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-08 13:51:49,606 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-08 13:51:49,610 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-08 13:51:49,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 08.01 01:51:49" (1/2) ... [2019-01-08 13:51:49,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d459243 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 01:51:49, skipping insertion in model container [2019-01-08 13:51:49,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 01:51:49" (2/2) ... [2019-01-08 13:51:49,614 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2019-01-08 13:51:49,624 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-08 13:51:49,633 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-08 13:51:49,652 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-08 13:51:49,688 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-08 13:51:49,688 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-08 13:51:49,688 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-08 13:51:49,688 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-08 13:51:49,689 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-08 13:51:49,689 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-08 13:51:49,689 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-08 13:51:49,689 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-08 13:51:49,706 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-08 13:51:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-08 13:51:49,712 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:49,714 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-08 13:51:49,716 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:49,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:49,723 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-08 13:51:49,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:49,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:49,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:49,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:49,787 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:49,950 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-08 13:51:49,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-08 13:51:49,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-08 13:51:49,953 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-08 13:51:49,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-08 13:51:49,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-08 13:51:49,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:51:49,980 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-08 13:51:50,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:50,052 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-08 13:51:50,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-08 13:51:50,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-08 13:51:50,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:50,073 INFO L225 Difference]: With dead ends: 9 [2019-01-08 13:51:50,073 INFO L226 Difference]: Without dead ends: 5 [2019-01-08 13:51:50,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-08 13:51:50,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-08 13:51:50,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-08 13:51:50,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-08 13:51:50,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-08 13:51:50,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-08 13:51:50,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:50,122 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-08 13:51:50,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-08 13:51:50,122 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-08 13:51:50,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-08 13:51:50,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:50,123 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-08 13:51:50,123 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:50,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,124 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-08 13:51:50,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:50,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,126 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,247 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:50,248 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-08 13:51:50,250 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-08 13:51:50,295 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-01-08 13:51:50,295 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-08 13:51:50,464 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-08 13:51:50,467 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 88 root evaluator evaluations with a maximum evaluation depth of 5. Performed 88 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2019-01-08 13:51:50,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-08 13:51:50,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,475 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-08 13:51:50,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,490 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:50,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:50,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-08 13:51:50,639 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:50,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-08 13:51:50,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-08 13:51:50,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-08 13:51:50,641 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-08 13:51:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:50,684 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-08 13:51:50,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-08 13:51:50,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-08 13:51:50,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:50,686 INFO L225 Difference]: With dead ends: 8 [2019-01-08 13:51:50,686 INFO L226 Difference]: Without dead ends: 6 [2019-01-08 13:51:50,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-08 13:51:50,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-08 13:51:50,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-08 13:51:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-08 13:51:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-08 13:51:50,689 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-08 13:51:50,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:50,689 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-08 13:51:50,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-08 13:51:50,690 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-08 13:51:50,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-08 13:51:50,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:50,690 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-08 13:51:50,691 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:50,691 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-08 13:51:50,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:50,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:50,693 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,764 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:50,764 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:50,765 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:50,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:50,765 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-08 13:51:50,776 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:50,776 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:50,791 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-08 13:51:50,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:50,795 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,800 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:50,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:50,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-08 13:51:50,935 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:50,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-08 13:51:50,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-08 13:51:50,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-08 13:51:50,936 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-08 13:51:50,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:51,000 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-08 13:51:51,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-08 13:51:51,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-08 13:51:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:51,001 INFO L225 Difference]: With dead ends: 9 [2019-01-08 13:51:51,001 INFO L226 Difference]: Without dead ends: 7 [2019-01-08 13:51:51,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-08 13:51:51,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-08 13:51:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-08 13:51:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-08 13:51:51,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-08 13:51:51,005 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-08 13:51:51,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:51,005 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-08 13:51:51,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-08 13:51:51,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-08 13:51:51,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-08 13:51:51,006 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:51,006 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-08 13:51:51,007 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:51,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:51,007 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-08 13:51:51,007 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:51,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,008 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:51,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,148 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-08 13:51:51,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:51,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:51,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:51,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,149 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-08 13:51:51,167 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:51,167 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:51,215 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:51,215 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:51,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:51,227 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-08 13:51:51,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:51,409 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-08 13:51:51,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:51,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-08 13:51:51,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:51,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-08 13:51:51,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-08 13:51:51,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-08 13:51:51,430 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-08 13:51:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:51,452 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-08 13:51:51,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-08 13:51:51,453 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-08 13:51:51,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:51,454 INFO L225 Difference]: With dead ends: 10 [2019-01-08 13:51:51,454 INFO L226 Difference]: Without dead ends: 8 [2019-01-08 13:51:51,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-08 13:51:51,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-08 13:51:51,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-08 13:51:51,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-08 13:51:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-08 13:51:51,458 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-08 13:51:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:51,458 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-08 13:51:51,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-08 13:51:51,459 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-08 13:51:51,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-08 13:51:51,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:51,459 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-08 13:51:51,459 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:51,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:51,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-08 13:51:51,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:51,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,461 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:51,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,462 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:51,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:51,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:51,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:51,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:51,705 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-08 13:51:51,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:51,714 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:51,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:51,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:51,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:51,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:51,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-08 13:51:51,881 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:51,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-08 13:51:51,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-08 13:51:51,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-08 13:51:51,882 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-08 13:51:51,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:51,914 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-08 13:51:51,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-08 13:51:51,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-08 13:51:51,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:51,916 INFO L225 Difference]: With dead ends: 11 [2019-01-08 13:51:51,916 INFO L226 Difference]: Without dead ends: 9 [2019-01-08 13:51:51,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-08 13:51:51,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-08 13:51:51,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-08 13:51:51,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-08 13:51:51,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-08 13:51:51,920 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-08 13:51:51,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:51,920 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-08 13:51:51,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-08 13:51:51,921 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-08 13:51:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-08 13:51:51,921 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:51,922 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-08 13:51:51,922 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:51,922 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-08 13:51:51,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:51,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:51,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:51,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:52,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:52,078 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:52,078 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:52,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:52,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:52,079 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-08 13:51:52,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:52,088 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:52,140 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-08 13:51:52,140 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:52,141 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:52,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:52,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:52,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:52,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-08 13:51:52,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:52,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-08 13:51:52,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-08 13:51:52,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:51:52,659 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-08 13:51:52,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:52,698 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-08 13:51:52,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-08 13:51:52,699 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-08 13:51:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:52,699 INFO L225 Difference]: With dead ends: 12 [2019-01-08 13:51:52,699 INFO L226 Difference]: Without dead ends: 10 [2019-01-08 13:51:52,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-08 13:51:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-08 13:51:52,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-08 13:51:52,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-08 13:51:52,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-08 13:51:52,704 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-08 13:51:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:52,704 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-08 13:51:52,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-08 13:51:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-08 13:51:52,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-08 13:51:52,705 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:52,705 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-08 13:51:52,705 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:52,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:52,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-08 13:51:52,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:52,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:52,707 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:52,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:52,707 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:52,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:52,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:52,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:52,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:52,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:52,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:52,815 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-08 13:51:52,824 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:52,824 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:52,837 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:52,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:52,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:52,847 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:53,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-08 13:51:53,083 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:53,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-08 13:51:53,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-08 13:51:53,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-08 13:51:53,085 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-08 13:51:53,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:53,146 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-08 13:51:53,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-08 13:51:53,146 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-08 13:51:53,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:53,147 INFO L225 Difference]: With dead ends: 13 [2019-01-08 13:51:53,147 INFO L226 Difference]: Without dead ends: 11 [2019-01-08 13:51:53,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-08 13:51:53,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-08 13:51:53,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-08 13:51:53,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-08 13:51:53,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-08 13:51:53,150 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-08 13:51:53,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:53,151 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-08 13:51:53,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-08 13:51:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-08 13:51:53,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-08 13:51:53,151 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:53,152 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-08 13:51:53,152 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:53,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:53,152 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-08 13:51:53,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:53,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:53,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,153 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:53,380 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:53,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:53,381 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:53,381 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:53,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:53,381 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-08 13:51:53,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:53,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:53,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,416 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:53,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-08 13:51:53,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:53,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-08 13:51:53,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-08 13:51:53,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-08 13:51:53,701 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-08 13:51:53,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:53,753 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-08 13:51:53,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-08 13:51:53,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-08 13:51:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:53,756 INFO L225 Difference]: With dead ends: 14 [2019-01-08 13:51:53,756 INFO L226 Difference]: Without dead ends: 12 [2019-01-08 13:51:53,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-08 13:51:53,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-08 13:51:53,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-08 13:51:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-08 13:51:53,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-08 13:51:53,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-08 13:51:53,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:53,760 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-08 13:51:53,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-08 13:51:53,760 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-08 13:51:53,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-08 13:51:53,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:53,761 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-08 13:51:53,762 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:53,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:53,762 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-08 13:51:53,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:53,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:53,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,884 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:53,884 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:53,884 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:53,885 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:53,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:53,885 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-08 13:51:53,895 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:53,895 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:53,921 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-08 13:51:53,921 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:53,923 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:53,931 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:53,931 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:54,149 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:54,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:54,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-08 13:51:54,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:54,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-08 13:51:54,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-08 13:51:54,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-08 13:51:54,173 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-08 13:51:54,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:54,207 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-08 13:51:54,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-08 13:51:54,208 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-08 13:51:54,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:54,209 INFO L225 Difference]: With dead ends: 15 [2019-01-08 13:51:54,209 INFO L226 Difference]: Without dead ends: 13 [2019-01-08 13:51:54,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-08 13:51:54,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-08 13:51:54,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-08 13:51:54,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-08 13:51:54,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-08 13:51:54,214 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-08 13:51:54,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:54,214 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-08 13:51:54,214 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-08 13:51:54,215 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-08 13:51:54,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-08 13:51:54,215 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:54,215 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-08 13:51:54,216 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:54,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:54,216 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-08 13:51:54,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:54,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:54,217 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:54,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:54,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:54,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,461 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:54,461 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:54,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:54,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,461 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-08 13:51:54,470 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:54,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:54,485 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:54,485 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:54,487 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:54,496 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:54,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:54,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:54,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-08 13:51:54,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:54,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-08 13:51:54,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-08 13:51:54,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-08 13:51:54,757 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-08 13:51:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:54,791 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-08 13:51:54,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-08 13:51:54,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-08 13:51:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:54,793 INFO L225 Difference]: With dead ends: 16 [2019-01-08 13:51:54,793 INFO L226 Difference]: Without dead ends: 14 [2019-01-08 13:51:54,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-08 13:51:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-08 13:51:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-08 13:51:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-08 13:51:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-08 13:51:54,798 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-08 13:51:54,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:54,798 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-08 13:51:54,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-08 13:51:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-08 13:51:54,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-08 13:51:54,799 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:54,799 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-08 13:51:54,800 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:54,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:54,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-08 13:51:54,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:54,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:54,801 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:54,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:54,801 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:54,957 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:54,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:54,959 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:54,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:54,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:54,959 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-08 13:51:54,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:54,969 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:54,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:54,998 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:54,998 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:55,299 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:55,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:55,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-08 13:51:55,320 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:55,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-08 13:51:55,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-08 13:51:55,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-08 13:51:55,321 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-08 13:51:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:55,362 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-08 13:51:55,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-08 13:51:55,362 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-08 13:51:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:55,363 INFO L225 Difference]: With dead ends: 17 [2019-01-08 13:51:55,363 INFO L226 Difference]: Without dead ends: 15 [2019-01-08 13:51:55,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-08 13:51:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-08 13:51:55,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-08 13:51:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-08 13:51:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-08 13:51:55,368 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-08 13:51:55,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:55,368 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-08 13:51:55,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-08 13:51:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-08 13:51:55,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-08 13:51:55,369 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:55,369 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-08 13:51:55,369 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:55,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:55,369 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-08 13:51:55,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:55,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:55,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:55,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:55,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:55,792 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:55,792 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:55,792 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:55,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:55,792 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-08 13:51:55,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:55,809 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:55,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-08 13:51:55,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:55,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:55,836 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:55,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:56,381 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:56,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:56,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-08 13:51:56,402 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:56,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-08 13:51:56,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-08 13:51:56,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-08 13:51:56,403 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-08 13:51:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:56,435 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-08 13:51:56,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-08 13:51:56,439 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-08 13:51:56,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:56,439 INFO L225 Difference]: With dead ends: 18 [2019-01-08 13:51:56,440 INFO L226 Difference]: Without dead ends: 16 [2019-01-08 13:51:56,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-08 13:51:56,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-08 13:51:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-08 13:51:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-08 13:51:56,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-08 13:51:56,444 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-08 13:51:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:56,444 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-08 13:51:56,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-08 13:51:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-08 13:51:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-08 13:51:56,445 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:56,445 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-08 13:51:56,445 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:56,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:56,446 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-08 13:51:56,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:56,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:56,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:56,447 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:56,585 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:56,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:56,585 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:56,585 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:56,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:56,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:56,586 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-08 13:51:56,595 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:56,595 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:56,636 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:56,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:56,638 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:56,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:57,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:57,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-08 13:51:57,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:57,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-08 13:51:57,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-08 13:51:57,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-08 13:51:57,193 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-08 13:51:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:57,260 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-08 13:51:57,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-08 13:51:57,266 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-08 13:51:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:57,267 INFO L225 Difference]: With dead ends: 19 [2019-01-08 13:51:57,267 INFO L226 Difference]: Without dead ends: 17 [2019-01-08 13:51:57,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-08 13:51:57,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-08 13:51:57,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-08 13:51:57,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-08 13:51:57,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-08 13:51:57,277 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-08 13:51:57,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:57,278 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-08 13:51:57,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-08 13:51:57,278 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-08 13:51:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-08 13:51:57,279 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:57,279 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-08 13:51:57,279 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:57,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-08 13:51:57,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:57,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:57,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:57,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:57,646 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:57,646 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:57,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:57,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:57,647 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-08 13:51:57,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:57,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:51:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:57,673 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:57,680 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:57,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:58,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:58,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-08 13:51:58,230 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:58,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-08 13:51:58,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-08 13:51:58,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-08 13:51:58,231 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-08 13:51:58,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:58,288 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-08 13:51:58,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-08 13:51:58,292 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-08 13:51:58,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:58,292 INFO L225 Difference]: With dead ends: 20 [2019-01-08 13:51:58,292 INFO L226 Difference]: Without dead ends: 18 [2019-01-08 13:51:58,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-08 13:51:58,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-08 13:51:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-08 13:51:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-08 13:51:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-08 13:51:58,296 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-08 13:51:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:58,296 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-08 13:51:58,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-08 13:51:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-08 13:51:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-08 13:51:58,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:58,297 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-08 13:51:58,297 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:58,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:58,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-08 13:51:58,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:58,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:58,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:51:58,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:58,299 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:58,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:58,545 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:58,545 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:58,545 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:58,545 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:58,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 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-08 13:51:58,556 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:51:58,556 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:51:58,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-08 13:51:58,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:58,664 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:58,672 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:58,672 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:51:59,187 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:59,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:51:59,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-08 13:51:59,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:51:59,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-08 13:51:59,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-08 13:51:59,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-08 13:51:59,209 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-08 13:51:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:51:59,240 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-08 13:51:59,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-08 13:51:59,241 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-08 13:51:59,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:51:59,241 INFO L225 Difference]: With dead ends: 21 [2019-01-08 13:51:59,242 INFO L226 Difference]: Without dead ends: 19 [2019-01-08 13:51:59,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-08 13:51:59,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-08 13:51:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-08 13:51:59,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-08 13:51:59,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-08 13:51:59,246 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-08 13:51:59,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:51:59,247 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-08 13:51:59,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-08 13:51:59,247 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-08 13:51:59,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-08 13:51:59,247 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:51:59,248 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-08 13:51:59,248 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:51:59,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:51:59,248 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-08 13:51:59,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:51:59,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:59,250 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:51:59,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:51:59,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:51:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:51:59,471 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:59,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:59,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:51:59,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:51:59,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:51:59,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:51:59,473 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-08 13:51:59,481 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:51:59,482 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:51:59,497 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:51:59,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:51:59,499 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:51:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:51:59,507 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:00,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:00,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-08 13:52:00,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:00,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-08 13:52:00,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-08 13:52:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 13:52:00,046 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-08 13:52:00,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:00,082 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-08 13:52:00,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-08 13:52:00,082 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-08 13:52:00,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:00,083 INFO L225 Difference]: With dead ends: 22 [2019-01-08 13:52:00,083 INFO L226 Difference]: Without dead ends: 20 [2019-01-08 13:52:00,085 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-08 13:52:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-08 13:52:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-08 13:52:00,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-08 13:52:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-08 13:52:00,088 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-08 13:52:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:00,088 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-08 13:52:00,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-08 13:52:00,088 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-08 13:52:00,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-08 13:52:00,089 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:00,089 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-08 13:52:00,089 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:00,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-08 13:52:00,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:00,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:00,091 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:00,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:00,091 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:00,678 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:00,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:00,679 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:00,679 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:00,680 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:00,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:00,680 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-08 13:52:00,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:00,700 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:00,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:00,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:01,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:01,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-08 13:52:01,458 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:01,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-08 13:52:01,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-08 13:52:01,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-08 13:52:01,459 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-08 13:52:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:01,489 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-08 13:52:01,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-08 13:52:01,490 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-08 13:52:01,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:01,491 INFO L225 Difference]: With dead ends: 23 [2019-01-08 13:52:01,491 INFO L226 Difference]: Without dead ends: 21 [2019-01-08 13:52:01,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-08 13:52:01,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-08 13:52:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-08 13:52:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-08 13:52:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-08 13:52:01,495 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-08 13:52:01,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:01,495 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-08 13:52:01,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-08 13:52:01,495 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-08 13:52:01,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-08 13:52:01,496 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:01,496 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-08 13:52:01,496 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-08 13:52:01,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:01,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:01,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:01,498 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:01,862 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:01,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:01,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:01,863 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:01,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:01,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:01,864 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-08 13:52:01,873 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:01,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:01,902 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-08 13:52:01,902 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:01,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:01,912 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:01,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:02,872 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:02,892 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:02,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-08 13:52:02,892 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:02,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-08 13:52:02,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-08 13:52:02,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 13:52:02,893 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-08 13:52:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:02,925 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-08 13:52:02,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-08 13:52:02,926 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-08 13:52:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:02,926 INFO L225 Difference]: With dead ends: 24 [2019-01-08 13:52:02,927 INFO L226 Difference]: Without dead ends: 22 [2019-01-08 13:52:02,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-08 13:52:02,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-08 13:52:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-08 13:52:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-08 13:52:02,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-08 13:52:02,932 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-08 13:52:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:02,933 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-08 13:52:02,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-08 13:52:02,933 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-08 13:52:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-08 13:52:02,934 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:02,934 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-08 13:52:02,934 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:02,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:02,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-08 13:52:02,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:02,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,936 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:02,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:02,936 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:02,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:03,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:03,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:03,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:03,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:03,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:03,833 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-08 13:52:03,842 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:03,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:03,875 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:03,875 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:03,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:03,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:04,358 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:04,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:04,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-08 13:52:04,377 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:04,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-08 13:52:04,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-08 13:52:04,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 13:52:04,379 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-08 13:52:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:04,474 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-08 13:52:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-08 13:52:04,474 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-08 13:52:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:04,475 INFO L225 Difference]: With dead ends: 25 [2019-01-08 13:52:04,475 INFO L226 Difference]: Without dead ends: 23 [2019-01-08 13:52:04,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-08 13:52:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-08 13:52:04,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-08 13:52:04,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-08 13:52:04,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-08 13:52:04,479 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-08 13:52:04,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:04,479 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-08 13:52:04,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-08 13:52:04,479 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-08 13:52:04,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-08 13:52:04,480 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:04,480 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-08 13:52:04,480 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:04,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:04,480 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-08 13:52:04,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:04,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:04,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:04,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:04,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:04,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:04,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:04,706 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:04,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:04,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:04,707 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-08 13:52:04,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:04,716 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:04,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:04,757 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:05,257 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:05,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:05,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-08 13:52:05,275 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:05,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-08 13:52:05,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-08 13:52:05,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 13:52:05,277 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-08 13:52:05,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:05,319 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-08 13:52:05,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-08 13:52:05,322 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-08 13:52:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:05,322 INFO L225 Difference]: With dead ends: 26 [2019-01-08 13:52:05,323 INFO L226 Difference]: Without dead ends: 24 [2019-01-08 13:52:05,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-08 13:52:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-08 13:52:05,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-08 13:52:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-08 13:52:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-08 13:52:05,326 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-08 13:52:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:05,327 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-08 13:52:05,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-08 13:52:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-08 13:52:05,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-08 13:52:05,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:05,328 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-08 13:52:05,328 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:05,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:05,328 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-08 13:52:05,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:05,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:05,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:05,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:05,987 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-08 13:52:05,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:05,988 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:05,988 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:05,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:05,988 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 13:52:05,998 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:05,998 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:06,031 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-08 13:52:06,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:06,034 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:06,041 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-08 13:52:06,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:06,537 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-08 13:52:06,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:06,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-08 13:52:06,557 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:06,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-08 13:52:06,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-08 13:52:06,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 13:52:06,559 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-08 13:52:06,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:06,602 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-08 13:52:06,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-08 13:52:06,603 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-08 13:52:06,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:06,603 INFO L225 Difference]: With dead ends: 27 [2019-01-08 13:52:06,604 INFO L226 Difference]: Without dead ends: 25 [2019-01-08 13:52:06,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-08 13:52:06,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-08 13:52:06,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-08 13:52:06,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-08 13:52:06,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-08 13:52:06,608 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-08 13:52:06,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:06,609 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-08 13:52:06,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-08 13:52:06,609 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-08 13:52:06,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-08 13:52:06,610 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:06,610 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-08 13:52:06,610 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:06,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:06,610 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-08 13:52:06,611 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:06,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,611 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:06,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:06,612 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:06,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:06,982 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:06,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:06,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:06,983 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:06,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:06,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:06,983 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-08 13:52:06,993 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:06,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:07,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:07,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:07,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:07,035 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,035 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:07,632 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:07,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:07,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-08 13:52:07,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:07,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-08 13:52:07,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-08 13:52:07,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-08 13:52:07,653 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-08 13:52:07,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:07,751 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-08 13:52:07,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-08 13:52:07,754 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-08 13:52:07,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:07,755 INFO L225 Difference]: With dead ends: 28 [2019-01-08 13:52:07,755 INFO L226 Difference]: Without dead ends: 26 [2019-01-08 13:52:07,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-08 13:52:07,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-08 13:52:07,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-08 13:52:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-08 13:52:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-08 13:52:07,759 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-08 13:52:07,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:07,759 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-08 13:52:07,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-08 13:52:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-08 13:52:07,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-08 13:52:07,760 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:07,760 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-08 13:52:07,761 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-08 13:52:07,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:07,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:07,762 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:07,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:07,762 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:08,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:08,130 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:08,130 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:08,130 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:08,130 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:08,130 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-08 13:52:08,143 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:08,143 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:08,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:08,174 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:08,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:09,403 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:09,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:09,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-08 13:52:09,425 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:09,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-08 13:52:09,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-08 13:52:09,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-08 13:52:09,427 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-08 13:52:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:09,465 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-08 13:52:09,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-08 13:52:09,466 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-08 13:52:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:09,467 INFO L225 Difference]: With dead ends: 29 [2019-01-08 13:52:09,467 INFO L226 Difference]: Without dead ends: 27 [2019-01-08 13:52:09,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-08 13:52:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-08 13:52:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-08 13:52:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-08 13:52:09,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-08 13:52:09,471 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-08 13:52:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:09,471 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-08 13:52:09,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-08 13:52:09,472 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-08 13:52:09,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-08 13:52:09,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:09,472 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-08 13:52:09,473 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:09,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:09,473 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-08 13:52:09,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:09,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:09,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:09,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:10,617 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:10,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:10,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:10,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:10,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:10,618 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-08 13:52:10,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:10,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:10,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-08 13:52:10,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:10,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:10,678 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:10,678 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:11,523 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:11,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:11,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-08 13:52:11,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:11,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-08 13:52:11,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-08 13:52:11,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:52:11,544 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-08 13:52:11,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:11,594 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-08 13:52:11,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-08 13:52:11,595 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-08 13:52:11,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:11,595 INFO L225 Difference]: With dead ends: 30 [2019-01-08 13:52:11,595 INFO L226 Difference]: Without dead ends: 28 [2019-01-08 13:52:11,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-08 13:52:11,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-08 13:52:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-08 13:52:11,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-08 13:52:11,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-08 13:52:11,600 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-08 13:52:11,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:11,600 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-08 13:52:11,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-08 13:52:11,600 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-08 13:52:11,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-08 13:52:11,601 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:11,601 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-08 13:52:11,601 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:11,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:11,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-08 13:52:11,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:11,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:11,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:11,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:11,603 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:12,050 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:12,050 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:12,050 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:12,050 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:12,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:12,050 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-08 13:52:12,059 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:12,059 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:12,081 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:12,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:12,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,089 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:12,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:12,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-08 13:52:12,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:12,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-08 13:52:12,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-08 13:52:12,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-08 13:52:12,800 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-08 13:52:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:12,855 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-08 13:52:12,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-08 13:52:12,855 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-08 13:52:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:12,856 INFO L225 Difference]: With dead ends: 31 [2019-01-08 13:52:12,856 INFO L226 Difference]: Without dead ends: 29 [2019-01-08 13:52:12,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-08 13:52:12,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-08 13:52:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-08 13:52:12,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-08 13:52:12,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-08 13:52:12,861 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-08 13:52:12,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:12,861 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-08 13:52:12,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-08 13:52:12,861 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-08 13:52:12,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-08 13:52:12,862 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:12,862 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-08 13:52:12,862 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:12,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:12,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-08 13:52:12,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:12,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:12,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:12,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:12,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:13,306 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:13,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:13,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:13,307 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:13,307 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:13,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:13,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 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-08 13:52:13,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:13,318 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:13,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:13,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:13,351 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:13,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:15,426 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:15,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:15,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-08 13:52:15,445 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:15,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-08 13:52:15,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-08 13:52:15,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-08 13:52:15,447 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-08 13:52:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:15,509 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-08 13:52:15,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-08 13:52:15,509 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-08 13:52:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:15,510 INFO L225 Difference]: With dead ends: 32 [2019-01-08 13:52:15,510 INFO L226 Difference]: Without dead ends: 30 [2019-01-08 13:52:15,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-08 13:52:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-08 13:52:15,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-08 13:52:15,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-08 13:52:15,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-08 13:52:15,514 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-08 13:52:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:15,514 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-08 13:52:15,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-08 13:52:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-08 13:52:15,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-08 13:52:15,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:15,515 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-08 13:52:15,515 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:15,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:15,515 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-08 13:52:15,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:15,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:15,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:15,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:15,516 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:15,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:16,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:16,156 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:16,156 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:16,156 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:16,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:16,157 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-08 13:52:16,165 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:16,166 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:16,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-08 13:52:16,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:16,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:16,227 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:17,033 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:17,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-08 13:52:17,053 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:17,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-08 13:52:17,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-08 13:52:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 13:52:17,054 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-08 13:52:17,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:17,222 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-08 13:52:17,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-08 13:52:17,223 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-08 13:52:17,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:17,223 INFO L225 Difference]: With dead ends: 33 [2019-01-08 13:52:17,223 INFO L226 Difference]: Without dead ends: 31 [2019-01-08 13:52:17,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-08 13:52:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-08 13:52:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-08 13:52:17,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-08 13:52:17,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-08 13:52:17,227 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-08 13:52:17,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:17,227 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-08 13:52:17,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-08 13:52:17,228 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-08 13:52:17,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-08 13:52:17,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:17,228 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-08 13:52:17,228 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:17,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:17,229 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-08 13:52:17,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:17,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:17,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:17,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:17,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:17,748 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:17,749 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:17,749 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:17,749 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:17,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:17,749 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-08 13:52:17,758 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:17,758 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:17,785 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:17,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:17,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:17,795 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:17,795 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:18,725 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:18,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-08 13:52:18,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:18,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-08 13:52:18,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-08 13:52:18,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-08 13:52:18,727 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-08 13:52:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:18,782 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-08 13:52:18,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-08 13:52:18,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-08 13:52:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:18,783 INFO L225 Difference]: With dead ends: 34 [2019-01-08 13:52:18,783 INFO L226 Difference]: Without dead ends: 32 [2019-01-08 13:52:18,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-08 13:52:18,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-08 13:52:18,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-08 13:52:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-08 13:52:18,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-08 13:52:18,789 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-08 13:52:18,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:18,790 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-08 13:52:18,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-08 13:52:18,790 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-08 13:52:18,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-08 13:52:18,790 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:18,790 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-08 13:52:18,791 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:18,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:18,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-08 13:52:18,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:18,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:18,792 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:18,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:18,792 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:18,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:19,259 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:19,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:19,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:19,260 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:19,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:19,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:19,260 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-08 13:52:19,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:19,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:19,298 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:19,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:20,245 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:20,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-08 13:52:20,263 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:20,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-08 13:52:20,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-08 13:52:20,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 13:52:20,265 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-08 13:52:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:20,359 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-08 13:52:20,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-08 13:52:20,360 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-08 13:52:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:20,360 INFO L225 Difference]: With dead ends: 35 [2019-01-08 13:52:20,360 INFO L226 Difference]: Without dead ends: 33 [2019-01-08 13:52:20,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-08 13:52:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-08 13:52:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-08 13:52:20,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-08 13:52:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-08 13:52:20,365 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-08 13:52:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:20,365 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-08 13:52:20,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-08 13:52:20,365 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-08 13:52:20,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-08 13:52:20,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:20,366 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-08 13:52:20,366 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:20,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:20,367 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-08 13:52:20,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:20,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:20,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:20,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:20,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:20,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:20,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:20,867 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:20,867 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:20,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:20,867 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-08 13:52:20,879 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:20,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:20,941 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-08 13:52:20,941 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:20,944 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:20,953 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:22,429 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:22,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:22,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-08 13:52:22,448 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:22,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-08 13:52:22,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-08 13:52:22,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 13:52:22,450 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-08 13:52:22,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:22,511 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-08 13:52:22,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-08 13:52:22,517 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-08 13:52:22,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:22,517 INFO L225 Difference]: With dead ends: 36 [2019-01-08 13:52:22,517 INFO L226 Difference]: Without dead ends: 34 [2019-01-08 13:52:22,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-08 13:52:22,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-08 13:52:22,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-08 13:52:22,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-08 13:52:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-08 13:52:22,521 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-08 13:52:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:22,521 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-08 13:52:22,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-08 13:52:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-08 13:52:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-08 13:52:22,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:22,523 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-08 13:52:22,523 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-08 13:52:22,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:22,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:22,525 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:22,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:22,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:23,140 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:23,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:23,141 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:23,141 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:23,141 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:23,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:23,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 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-08 13:52:23,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:23,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:23,179 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:23,179 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:23,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:23,189 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:24,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:24,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-08 13:52:24,549 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:24,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-08 13:52:24,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-08 13:52:24,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 13:52:24,550 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-08 13:52:24,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:24,657 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-08 13:52:24,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-08 13:52:24,657 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-08 13:52:24,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:24,658 INFO L225 Difference]: With dead ends: 37 [2019-01-08 13:52:24,658 INFO L226 Difference]: Without dead ends: 35 [2019-01-08 13:52:24,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-08 13:52:24,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-08 13:52:24,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-08 13:52:24,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-08 13:52:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-08 13:52:24,661 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-08 13:52:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:24,661 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-08 13:52:24,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-08 13:52:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-08 13:52:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-08 13:52:24,662 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:24,662 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-08 13:52:24,662 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:24,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:24,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-08 13:52:24,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:24,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:24,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:24,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:24,663 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:24,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:25,471 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:25,471 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:25,472 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:25,472 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:25,472 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:25,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:25,472 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-08 13:52:25,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:25,480 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:25,522 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:25,530 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:25,531 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:26,674 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:26,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:26,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-08 13:52:26,693 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:26,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-08 13:52:26,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-08 13:52:26,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-08 13:52:26,695 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-08 13:52:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:26,763 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-08 13:52:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-08 13:52:26,764 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-08 13:52:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:26,764 INFO L225 Difference]: With dead ends: 38 [2019-01-08 13:52:26,765 INFO L226 Difference]: Without dead ends: 36 [2019-01-08 13:52:26,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-08 13:52:26,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-08 13:52:26,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-08 13:52:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-08 13:52:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-08 13:52:26,770 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-08 13:52:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:26,770 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-08 13:52:26,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-08 13:52:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-08 13:52:26,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-08 13:52:26,771 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:26,771 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-08 13:52:26,771 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:26,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:26,771 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-08 13:52:26,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:26,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:26,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:26,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:26,773 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:26,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:27,377 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:27,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:27,377 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:27,377 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:27,377 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:27,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:27,378 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-08 13:52:27,385 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:27,385 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:27,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-08 13:52:27,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:27,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:27,471 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:27,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:28,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:28,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-08 13:52:28,723 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:28,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-08 13:52:28,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-08 13:52:28,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 13:52:28,725 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-08 13:52:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:28,806 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-08 13:52:28,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-08 13:52:28,806 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-08 13:52:28,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:28,807 INFO L225 Difference]: With dead ends: 39 [2019-01-08 13:52:28,807 INFO L226 Difference]: Without dead ends: 37 [2019-01-08 13:52:28,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-08 13:52:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-08 13:52:28,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-08 13:52:28,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-08 13:52:28,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-08 13:52:28,811 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-08 13:52:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:28,811 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-08 13:52:28,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-08 13:52:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-08 13:52:28,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-08 13:52:28,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:28,812 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-08 13:52:28,812 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:28,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:28,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-08 13:52:28,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:28,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:28,813 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:28,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:28,814 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:29,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:29,677 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:29,677 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:29,677 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:29,677 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:29,677 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-08 13:52:29,687 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:29,687 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:29,730 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:29,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:29,732 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:29,740 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:29,740 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:31,010 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:31,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:31,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-08 13:52:31,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:31,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-08 13:52:31,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-08 13:52:31,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 13:52:31,031 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-08 13:52:31,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:31,136 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-08 13:52:31,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-08 13:52:31,136 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-08 13:52:31,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:31,137 INFO L225 Difference]: With dead ends: 40 [2019-01-08 13:52:31,137 INFO L226 Difference]: Without dead ends: 38 [2019-01-08 13:52:31,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-08 13:52:31,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-08 13:52:31,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-08 13:52:31,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-08 13:52:31,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-08 13:52:31,141 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-08 13:52:31,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:31,142 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-08 13:52:31,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-08 13:52:31,142 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-08 13:52:31,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-08 13:52:31,142 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:31,142 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-08 13:52:31,143 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:31,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:31,143 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-08 13:52:31,143 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:31,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:31,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:31,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:31,144 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:31,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:31,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:31,892 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:31,892 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:31,892 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:31,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:31,892 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-08 13:52:31,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:31,901 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:31,933 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:31,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:33,222 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:33,241 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:33,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-08 13:52:33,242 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:33,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-08 13:52:33,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-08 13:52:33,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-08 13:52:33,243 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-08 13:52:33,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:33,310 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-08 13:52:33,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-08 13:52:33,311 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-08 13:52:33,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:33,312 INFO L225 Difference]: With dead ends: 41 [2019-01-08 13:52:33,312 INFO L226 Difference]: Without dead ends: 39 [2019-01-08 13:52:33,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-08 13:52:33,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-08 13:52:33,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-08 13:52:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-08 13:52:33,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-08 13:52:33,315 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-08 13:52:33,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:33,316 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-08 13:52:33,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-08 13:52:33,316 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-08 13:52:33,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-08 13:52:33,316 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:33,316 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-08 13:52:33,317 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:33,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:33,317 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-08 13:52:33,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:33,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:33,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:33,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:33,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:33,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:33,977 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:33,977 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:33,977 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:33,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:33,977 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-08 13:52:33,987 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:33,987 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:34,085 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-08 13:52:34,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:34,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:34,094 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:34,094 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:35,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:35,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-08 13:52:35,887 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:35,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-08 13:52:35,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-08 13:52:35,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 13:52:35,888 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-08 13:52:35,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:35,942 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-08 13:52:35,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-08 13:52:35,942 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-08 13:52:35,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:35,943 INFO L225 Difference]: With dead ends: 42 [2019-01-08 13:52:35,943 INFO L226 Difference]: Without dead ends: 40 [2019-01-08 13:52:35,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-08 13:52:35,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-08 13:52:35,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-08 13:52:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-08 13:52:35,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-08 13:52:35,946 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-08 13:52:35,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:35,946 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-08 13:52:35,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-08 13:52:35,946 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-08 13:52:35,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-08 13:52:35,947 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:35,947 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-08 13:52:35,947 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:35,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:35,947 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-08 13:52:35,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:35,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:35,948 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:35,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:35,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:35,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:36,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:36,936 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:36,936 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:36,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:36,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:36,936 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-08 13:52:36,945 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:36,945 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:36,986 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:36,986 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:36,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:37,010 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:37,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:38,966 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:38,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:38,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-08 13:52:38,986 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:38,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-08 13:52:38,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-08 13:52:38,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-08 13:52:38,987 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-08 13:52:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:39,079 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-08 13:52:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-08 13:52:39,080 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-08 13:52:39,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:39,080 INFO L225 Difference]: With dead ends: 43 [2019-01-08 13:52:39,080 INFO L226 Difference]: Without dead ends: 41 [2019-01-08 13:52:39,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-08 13:52:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-08 13:52:39,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-08 13:52:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-08 13:52:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-08 13:52:39,082 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-08 13:52:39,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:39,082 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-08 13:52:39,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-08 13:52:39,082 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-08 13:52:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-08 13:52:39,083 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:39,083 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-08 13:52:39,083 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:39,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:39,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-08 13:52:39,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:39,084 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:39,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:39,085 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:39,812 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:39,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:39,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:39,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:39,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:39,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:39,813 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-08 13:52:39,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:39,821 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:39,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:39,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:39,866 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:39,867 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:41,566 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:41,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:41,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-08 13:52:41,586 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:41,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-08 13:52:41,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-08 13:52:41,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 13:52:41,588 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-08 13:52:41,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:41,675 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-08 13:52:41,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-08 13:52:41,675 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-08 13:52:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:41,676 INFO L225 Difference]: With dead ends: 44 [2019-01-08 13:52:41,676 INFO L226 Difference]: Without dead ends: 42 [2019-01-08 13:52:41,677 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-08 13:52:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-08 13:52:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-08 13:52:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-08 13:52:41,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-08 13:52:41,681 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-08 13:52:41,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:41,681 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-08 13:52:41,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-08 13:52:41,681 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-08 13:52:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-08 13:52:41,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:41,682 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-08 13:52:41,682 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:41,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:41,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-08 13:52:41,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:41,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:41,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:41,684 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:42,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:42,320 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:42,320 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:42,320 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:42,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:42,320 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-08 13:52:42,329 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:42,329 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:42,465 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-08 13:52:42,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:42,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:42,477 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:42,477 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:44,386 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:44,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:44,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-08 13:52:44,405 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:44,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-08 13:52:44,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-08 13:52:44,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:52:44,406 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-08 13:52:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:44,522 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-08 13:52:44,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-08 13:52:44,523 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-08 13:52:44,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:44,523 INFO L225 Difference]: With dead ends: 45 [2019-01-08 13:52:44,523 INFO L226 Difference]: Without dead ends: 43 [2019-01-08 13:52:44,524 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-08 13:52:44,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-08 13:52:44,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-08 13:52:44,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-08 13:52:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-08 13:52:44,526 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-08 13:52:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:44,526 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-08 13:52:44,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-08 13:52:44,526 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-08 13:52:44,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-08 13:52:44,526 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:44,527 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-08 13:52:44,527 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:44,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:44,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-08 13:52:44,527 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:44,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:44,528 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:44,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:44,528 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:44,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:45,261 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:45,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:45,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:45,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:45,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:45,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:45,262 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-08 13:52:45,270 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:45,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:45,308 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:45,308 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:45,310 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:45,317 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:45,317 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:46,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:46,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-08 13:52:46,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:46,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-08 13:52:46,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-08 13:52:46,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-08 13:52:46,998 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-08 13:52:47,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:47,070 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-08 13:52:47,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-08 13:52:47,071 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-08 13:52:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:47,071 INFO L225 Difference]: With dead ends: 46 [2019-01-08 13:52:47,071 INFO L226 Difference]: Without dead ends: 44 [2019-01-08 13:52:47,072 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-08 13:52:47,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-08 13:52:47,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-08 13:52:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-08 13:52:47,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-08 13:52:47,074 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-08 13:52:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:47,074 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-08 13:52:47,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-08 13:52:47,074 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-08 13:52:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-08 13:52:47,075 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:47,075 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-08 13:52:47,075 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:47,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:47,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-08 13:52:47,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:47,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:47,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:47,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:47,077 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:47,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:48,128 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:48,129 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:48,129 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:48,129 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:48,129 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:48,129 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-08 13:52:48,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:48,139 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:48,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:48,187 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:48,187 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:50,315 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:50,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:50,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-08 13:52:50,333 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:50,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-08 13:52:50,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-08 13:52:50,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-08 13:52:50,334 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-08 13:52:50,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:50,424 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-08 13:52:50,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-08 13:52:50,425 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-08 13:52:50,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:50,426 INFO L225 Difference]: With dead ends: 47 [2019-01-08 13:52:50,426 INFO L226 Difference]: Without dead ends: 45 [2019-01-08 13:52:50,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-08 13:52:50,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-08 13:52:50,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-08 13:52:50,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-08 13:52:50,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-08 13:52:50,428 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-08 13:52:50,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:50,428 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-08 13:52:50,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-08 13:52:50,428 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-08 13:52:50,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-08 13:52:50,429 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:50,429 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-08 13:52:50,429 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:50,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:50,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-08 13:52:50,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:50,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:50,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:50,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:50,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:50,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:51,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:51,261 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:51,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:51,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:51,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:51,262 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-08 13:52:51,270 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:52:51,270 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:52:51,412 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-08 13:52:51,412 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:51,415 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:51,425 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:51,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:53,685 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:53,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:53,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-08 13:52:53,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:53,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-08 13:52:53,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-08 13:52:53,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:52:53,706 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-08 13:52:53,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:53,783 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-08 13:52:53,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-08 13:52:53,783 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-08 13:52:53,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:53,784 INFO L225 Difference]: With dead ends: 48 [2019-01-08 13:52:53,784 INFO L226 Difference]: Without dead ends: 46 [2019-01-08 13:52:53,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-08 13:52:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-08 13:52:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-08 13:52:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-08 13:52:53,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-08 13:52:53,787 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-08 13:52:53,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:53,787 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-08 13:52:53,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-08 13:52:53,787 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-08 13:52:53,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-08 13:52:53,787 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:53,787 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-08 13:52:53,788 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:53,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:53,788 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-08 13:52:53,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:53,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:53,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:53,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:53,789 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:54,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:54,851 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:54,851 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:54,851 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:54,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:54,851 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-08 13:52:54,860 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:52:54,860 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:52:54,900 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:52:54,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:52:54,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:54,912 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:54,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:52:57,053 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:57,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:52:57,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-08 13:52:57,072 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:52:57,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-08 13:52:57,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-08 13:52:57,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-08 13:52:57,074 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-08 13:52:57,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:52:57,128 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-08 13:52:57,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-08 13:52:57,128 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-08 13:52:57,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:52:57,129 INFO L225 Difference]: With dead ends: 49 [2019-01-08 13:52:57,129 INFO L226 Difference]: Without dead ends: 47 [2019-01-08 13:52:57,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-08 13:52:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-08 13:52:57,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-08 13:52:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-08 13:52:57,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-08 13:52:57,132 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-08 13:52:57,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:52:57,133 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-08 13:52:57,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-08 13:52:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-08 13:52:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-08 13:52:57,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:52:57,133 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-08 13:52:57,133 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:52:57,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:52:57,134 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-08 13:52:57,134 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:52:57,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:57,134 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:52:57,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:52:57,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:52:57,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:57,985 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:57,985 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:52:57,985 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:52:57,985 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:52:57,986 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:52:57,986 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-08 13:52:57,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:52:57,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:52:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:52:58,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:52:58,048 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:52:58,049 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:00,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:00,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-08 13:53:00,545 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:00,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-08 13:53:00,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-08 13:53:00,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-08 13:53:00,546 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-08 13:53:00,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:00,672 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-08 13:53:00,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-08 13:53:00,672 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-08 13:53:00,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:00,673 INFO L225 Difference]: With dead ends: 50 [2019-01-08 13:53:00,673 INFO L226 Difference]: Without dead ends: 48 [2019-01-08 13:53:00,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-08 13:53:00,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-08 13:53:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-08 13:53:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-08 13:53:00,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-08 13:53:00,676 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-08 13:53:00,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:00,677 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-08 13:53:00,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-08 13:53:00,678 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-08 13:53:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-08 13:53:00,678 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:00,679 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-08 13:53:00,679 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:00,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:00,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-08 13:53:00,679 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:00,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:00,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:00,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:00,680 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:01,501 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:01,502 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:01,502 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:01,502 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:01,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:01,502 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-08 13:53:01,510 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:01,511 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:01,662 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-08 13:53:01,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:01,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:01,676 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:01,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:03,789 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:03,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:03,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-08 13:53:03,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:03,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-08 13:53:03,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-08 13:53:03,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 13:53:03,810 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-08 13:53:03,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:03,866 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-08 13:53:03,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-08 13:53:03,867 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-08 13:53:03,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:03,868 INFO L225 Difference]: With dead ends: 51 [2019-01-08 13:53:03,868 INFO L226 Difference]: Without dead ends: 49 [2019-01-08 13:53:03,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-08 13:53:03,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-08 13:53:03,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-08 13:53:03,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-08 13:53:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-08 13:53:03,872 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-08 13:53:03,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:03,872 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-08 13:53:03,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-08 13:53:03,873 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-08 13:53:03,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-08 13:53:03,873 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:03,873 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-08 13:53:03,874 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:03,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:03,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-08 13:53:03,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:03,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:03,875 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:03,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:03,875 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:03,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:05,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:05,073 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:05,073 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:05,073 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:05,073 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:05,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:05,074 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-08 13:53:05,083 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:05,083 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:05,126 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:05,126 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:05,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:05,140 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:07,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:07,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-08 13:53:07,366 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:07,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-08 13:53:07,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-08 13:53:07,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 13:53:07,368 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-08 13:53:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:07,788 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-08 13:53:07,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-08 13:53:07,788 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-08 13:53:07,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:07,789 INFO L225 Difference]: With dead ends: 52 [2019-01-08 13:53:07,789 INFO L226 Difference]: Without dead ends: 50 [2019-01-08 13:53:07,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-08 13:53:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-08 13:53:07,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-08 13:53:07,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-08 13:53:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-08 13:53:07,793 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-08 13:53:07,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:07,793 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-08 13:53:07,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-08 13:53:07,793 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-08 13:53:07,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-08 13:53:07,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:07,794 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-08 13:53:07,794 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:07,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:07,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-08 13:53:07,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:07,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:07,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:07,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:07,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:09,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:09,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:09,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:09,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:09,024 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:09,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:09,024 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-08 13:53:09,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:09,032 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:09,077 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:09,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:11,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:11,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-08 13:53:11,796 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:11,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-08 13:53:11,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-08 13:53:11,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-08 13:53:11,797 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-08 13:53:11,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:11,891 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-08 13:53:11,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-08 13:53:11,892 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-08 13:53:11,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:11,893 INFO L225 Difference]: With dead ends: 53 [2019-01-08 13:53:11,893 INFO L226 Difference]: Without dead ends: 51 [2019-01-08 13:53:11,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-08 13:53:11,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-08 13:53:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-08 13:53:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-08 13:53:11,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-08 13:53:11,896 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-08 13:53:11,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:11,897 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-08 13:53:11,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-08 13:53:11,897 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-08 13:53:11,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-08 13:53:11,897 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:11,897 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-08 13:53:11,898 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:11,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:11,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-08 13:53:11,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:11,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:11,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:11,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:11,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:13,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:13,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:13,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:13,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:13,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:13,026 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-08 13:53:13,035 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:13,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:13,224 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-08 13:53:13,225 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:13,228 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:13,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:13,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:15,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:15,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-08 13:53:15,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:15,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-08 13:53:15,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-08 13:53:15,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 13:53:15,970 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-08 13:53:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:16,033 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-08 13:53:16,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-08 13:53:16,034 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-08 13:53:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:16,034 INFO L225 Difference]: With dead ends: 54 [2019-01-08 13:53:16,035 INFO L226 Difference]: Without dead ends: 52 [2019-01-08 13:53:16,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-08 13:53:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-08 13:53:16,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-08 13:53:16,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-08 13:53:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-08 13:53:16,038 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-08 13:53:16,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:16,038 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-08 13:53:16,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-08 13:53:16,039 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-08 13:53:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-08 13:53:16,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:16,039 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-08 13:53:16,040 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:16,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:16,040 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-08 13:53:16,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:16,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:16,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:16,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:16,041 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:16,998 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:16,999 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:16,999 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:16,999 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:16,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:16,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 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-08 13:53:17,008 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:17,008 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:17,052 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:17,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:17,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:17,064 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:19,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:19,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-08 13:53:19,564 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:19,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-08 13:53:19,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-08 13:53:19,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-08 13:53:19,566 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-08 13:53:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:19,699 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-08 13:53:19,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-08 13:53:19,700 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-08 13:53:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:19,701 INFO L225 Difference]: With dead ends: 55 [2019-01-08 13:53:19,701 INFO L226 Difference]: Without dead ends: 53 [2019-01-08 13:53:19,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-08 13:53:19,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-08 13:53:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-08 13:53:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-08 13:53:19,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-08 13:53:19,706 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-08 13:53:19,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:19,706 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-08 13:53:19,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-08 13:53:19,706 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-08 13:53:19,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-08 13:53:19,707 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:19,707 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-08 13:53:19,707 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:19,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:19,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-08 13:53:19,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:19,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:19,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:19,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:19,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:21,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:21,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:21,060 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:21,060 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:21,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:21,060 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-08 13:53:21,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:21,069 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:21,116 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:21,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:21,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:24,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:24,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-08 13:53:24,029 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:24,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-08 13:53:24,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-08 13:53:24,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-08 13:53:24,031 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-08 13:53:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:24,094 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-08 13:53:24,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-08 13:53:24,095 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-08 13:53:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:24,096 INFO L225 Difference]: With dead ends: 56 [2019-01-08 13:53:24,096 INFO L226 Difference]: Without dead ends: 54 [2019-01-08 13:53:24,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-08 13:53:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-08 13:53:24,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-08 13:53:24,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-08 13:53:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-08 13:53:24,099 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-08 13:53:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:24,099 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-08 13:53:24,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-08 13:53:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-08 13:53:24,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-08 13:53:24,100 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:24,100 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-08 13:53:24,100 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:24,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:24,101 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-08 13:53:24,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:24,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:24,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:24,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:24,101 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:25,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:25,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:25,367 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:25,367 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:25,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:25,367 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-08 13:53:25,377 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:25,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:25,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-08 13:53:25,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:25,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:25,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:25,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:28,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:28,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-08 13:53:28,611 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:28,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-08 13:53:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-08 13:53:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 13:53:28,613 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-08 13:53:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:28,764 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-08 13:53:28,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-08 13:53:28,765 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-08 13:53:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:28,765 INFO L225 Difference]: With dead ends: 57 [2019-01-08 13:53:28,765 INFO L226 Difference]: Without dead ends: 55 [2019-01-08 13:53:28,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-08 13:53:28,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-08 13:53:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-08 13:53:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-08 13:53:28,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-08 13:53:28,768 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-08 13:53:28,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:28,769 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-08 13:53:28,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-08 13:53:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-08 13:53:28,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-08 13:53:28,770 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:28,770 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-08 13:53:28,770 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:28,770 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-08 13:53:28,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:28,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:28,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:28,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:28,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:28,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:29,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:29,853 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:29,853 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:29,853 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:29,853 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:29,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:29,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 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-08 13:53:29,863 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:29,863 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:29,911 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:29,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:29,914 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:29,927 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:33,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:33,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:33,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-08 13:53:33,181 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:33,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-08 13:53:33,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-08 13:53:33,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 13:53:33,183 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-08 13:53:33,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:33,278 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-08 13:53:33,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-08 13:53:33,278 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-08 13:53:33,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:33,279 INFO L225 Difference]: With dead ends: 58 [2019-01-08 13:53:33,279 INFO L226 Difference]: Without dead ends: 56 [2019-01-08 13:53:33,280 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-08 13:53:33,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-08 13:53:33,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-08 13:53:33,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-08 13:53:33,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-08 13:53:33,283 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-08 13:53:33,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:33,283 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-08 13:53:33,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-08 13:53:33,283 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-08 13:53:33,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-08 13:53:33,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:33,284 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-08 13:53:33,284 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:33,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:33,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-08 13:53:33,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:33,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:33,285 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:33,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:33,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:33,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:34,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:34,440 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:34,440 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:34,440 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:34,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:34,440 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-08 13:53:34,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:34,463 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:34,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:34,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:34,521 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:37,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:37,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:37,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-08 13:53:37,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:37,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-08 13:53:37,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-08 13:53:37,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-08 13:53:37,745 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-08 13:53:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:37,842 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-08 13:53:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-08 13:53:37,843 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-08 13:53:37,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:37,844 INFO L225 Difference]: With dead ends: 59 [2019-01-08 13:53:37,844 INFO L226 Difference]: Without dead ends: 57 [2019-01-08 13:53:37,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-08 13:53:37,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-08 13:53:37,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-08 13:53:37,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-08 13:53:37,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-08 13:53:37,847 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-08 13:53:37,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:37,848 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-08 13:53:37,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-08 13:53:37,849 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-08 13:53:37,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-08 13:53:37,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:37,849 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-08 13:53:37,850 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:37,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:37,850 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-08 13:53:37,850 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:37,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:37,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:37,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:37,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:38,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:38,984 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:38,984 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:38,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:38,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:38,984 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-08 13:53:38,993 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:38,993 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:39,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-08 13:53:39,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:39,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:39,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:39,270 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:42,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:42,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:42,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-08 13:53:42,716 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:42,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-08 13:53:42,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-08 13:53:42,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-08 13:53:42,718 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-08 13:53:42,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:42,788 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-08 13:53:42,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-08 13:53:42,789 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-08 13:53:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:42,790 INFO L225 Difference]: With dead ends: 60 [2019-01-08 13:53:42,790 INFO L226 Difference]: Without dead ends: 58 [2019-01-08 13:53:42,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-08 13:53:42,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-08 13:53:42,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-08 13:53:42,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-08 13:53:42,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-08 13:53:42,793 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-08 13:53:42,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:42,794 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-08 13:53:42,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-08 13:53:42,794 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-08 13:53:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-08 13:53:42,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:42,794 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-08 13:53:42,794 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:42,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:42,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-08 13:53:42,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:42,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:42,795 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:42,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:42,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:42,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:44,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:44,200 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:44,200 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:44,200 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:44,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:44,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 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-08 13:53:44,212 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:53:44,212 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:53:44,263 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:53:44,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:44,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:44,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:44,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:47,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:47,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-08 13:53:47,806 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:47,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-08 13:53:47,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-08 13:53:47,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-08 13:53:47,808 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-08 13:53:47,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:47,902 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-08 13:53:47,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-08 13:53:47,902 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-08 13:53:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:47,903 INFO L225 Difference]: With dead ends: 61 [2019-01-08 13:53:47,903 INFO L226 Difference]: Without dead ends: 59 [2019-01-08 13:53:47,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-08 13:53:47,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-08 13:53:47,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-08 13:53:47,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-08 13:53:47,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-08 13:53:47,905 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-08 13:53:47,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:47,906 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-08 13:53:47,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-08 13:53:47,906 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-08 13:53:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-08 13:53:47,906 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:47,906 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-08 13:53:47,907 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-08 13:53:47,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:47,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:47,908 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:47,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:47,908 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:47,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:49,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:49,547 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:49,547 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:49,547 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:49,547 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:49,547 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-08 13:53:49,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:49,557 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:53:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:49,612 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:49,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:49,622 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:53,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:53,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:53,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-08 13:53:53,245 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:53,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-08 13:53:53,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-08 13:53:53,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 13:53:53,246 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-08 13:53:53,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:53,359 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-08 13:53:53,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-08 13:53:53,360 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-08 13:53:53,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:53,360 INFO L225 Difference]: With dead ends: 62 [2019-01-08 13:53:53,361 INFO L226 Difference]: Without dead ends: 60 [2019-01-08 13:53:53,361 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-08 13:53:53,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-08 13:53:53,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-08 13:53:53,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-08 13:53:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-08 13:53:53,364 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-08 13:53:53,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:53,364 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-08 13:53:53,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-08 13:53:53,364 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-08 13:53:53,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-08 13:53:53,365 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:53,365 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-08 13:53:53,365 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:53,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:53,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-08 13:53:53,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:53,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:53,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:53:53,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:53,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:53:55,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:55,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:55,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:53:55,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:53:55,280 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:53:55,280 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:53:55,280 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-08 13:53:55,288 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:53:55,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:53:55,581 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-08 13:53:55,582 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:53:55,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:53:55,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:55,595 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:53:59,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:53:59,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:53:59,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-08 13:53:59,335 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:53:59,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-08 13:53:59,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-08 13:53:59,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-08 13:53:59,338 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-08 13:53:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:53:59,418 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-08 13:53:59,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-08 13:53:59,418 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-08 13:53:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:53:59,419 INFO L225 Difference]: With dead ends: 63 [2019-01-08 13:53:59,419 INFO L226 Difference]: Without dead ends: 61 [2019-01-08 13:53:59,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-08 13:53:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-08 13:53:59,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-08 13:53:59,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-08 13:53:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-08 13:53:59,424 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-08 13:53:59,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:53:59,424 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-08 13:53:59,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-08 13:53:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-08 13:53:59,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-08 13:53:59,425 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:53:59,425 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-08 13:53:59,425 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:53:59,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:53:59,426 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-08 13:53:59,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:53:59,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:59,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:53:59,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:53:59,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:53:59,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:00,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:00,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:00,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:00,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:00,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:00,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:00,823 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-08 13:54:00,835 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:00,835 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:00,886 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:00,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:00,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:00,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:00,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:05,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:05,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:05,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-08 13:54:05,661 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:05,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-08 13:54:05,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-08 13:54:05,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-08 13:54:05,662 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-08 13:54:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:05,770 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-08 13:54:05,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-08 13:54:05,770 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-08 13:54:05,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:05,771 INFO L225 Difference]: With dead ends: 64 [2019-01-08 13:54:05,771 INFO L226 Difference]: Without dead ends: 62 [2019-01-08 13:54:05,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-08 13:54:05,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-08 13:54:05,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-08 13:54:05,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-08 13:54:05,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-08 13:54:05,775 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-08 13:54:05,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:05,775 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-08 13:54:05,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-08 13:54:05,776 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-08 13:54:05,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-08 13:54:05,776 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:05,776 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-08 13:54:05,776 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:05,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:05,776 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-08 13:54:05,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:05,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:05,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:05,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:05,777 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:07,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:07,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:07,373 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:07,373 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:07,373 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:07,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:07,373 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-08 13:54:07,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:07,384 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:07,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:07,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:07,454 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:11,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:11,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-08 13:54:11,751 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:11,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-08 13:54:11,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-08 13:54:11,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-08 13:54:11,753 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-08 13:54:11,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:11,847 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-08 13:54:11,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-08 13:54:11,848 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-08 13:54:11,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:11,848 INFO L225 Difference]: With dead ends: 65 [2019-01-08 13:54:11,848 INFO L226 Difference]: Without dead ends: 63 [2019-01-08 13:54:11,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-08 13:54:11,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-08 13:54:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-08 13:54:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-08 13:54:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-08 13:54:11,852 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-08 13:54:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:11,853 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-08 13:54:11,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-08 13:54:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-08 13:54:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-08 13:54:11,853 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:11,853 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-08 13:54:11,853 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:11,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:11,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-08 13:54:11,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:11,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:11,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:11,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:11,855 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:13,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:13,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:13,265 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:13,265 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:13,265 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:13,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:13,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 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-08 13:54:13,275 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:13,275 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:13,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-08 13:54:13,641 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:13,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:13,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:13,656 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:17,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:17,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-08 13:54:17,793 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:17,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-08 13:54:17,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-08 13:54:17,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 13:54:17,796 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-08 13:54:17,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:17,873 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-08 13:54:17,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-08 13:54:17,874 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-08 13:54:17,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:17,875 INFO L225 Difference]: With dead ends: 66 [2019-01-08 13:54:17,875 INFO L226 Difference]: Without dead ends: 64 [2019-01-08 13:54:17,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-08 13:54:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-08 13:54:17,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-08 13:54:17,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-08 13:54:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-08 13:54:17,879 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-08 13:54:17,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:17,879 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-08 13:54:17,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-08 13:54:17,879 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-08 13:54:17,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-08 13:54:17,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:17,880 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-08 13:54:17,880 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:17,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:17,880 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-08 13:54:17,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:17,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:17,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:17,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:17,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:19,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:19,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:19,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:19,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:19,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:19,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:19,554 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-08 13:54:19,577 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:19,577 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:19,634 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:19,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:19,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:19,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:19,648 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:23,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:23,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:23,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-08 13:54:23,670 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:23,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-08 13:54:23,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-08 13:54:23,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-08 13:54:23,673 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-08 13:54:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:23,813 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-08 13:54:23,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-08 13:54:23,813 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-08 13:54:23,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:23,814 INFO L225 Difference]: With dead ends: 67 [2019-01-08 13:54:23,814 INFO L226 Difference]: Without dead ends: 65 [2019-01-08 13:54:23,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-08 13:54:23,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-08 13:54:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-08 13:54:23,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-08 13:54:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-08 13:54:23,818 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-08 13:54:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:23,818 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-08 13:54:23,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-08 13:54:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-08 13:54:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-08 13:54:23,818 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:23,818 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-08 13:54:23,819 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-08 13:54:23,819 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:23,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:23,819 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:23,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:23,820 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:25,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:25,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:25,413 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:25,413 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:25,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:25,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:25,413 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-08 13:54:25,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:25,422 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:25,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:25,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:25,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:25,488 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:29,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:29,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-08 13:54:29,811 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:29,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-08 13:54:29,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-08 13:54:29,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-08 13:54:29,813 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-08 13:54:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:29,934 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-08 13:54:29,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-08 13:54:29,934 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-08 13:54:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:29,935 INFO L225 Difference]: With dead ends: 68 [2019-01-08 13:54:29,935 INFO L226 Difference]: Without dead ends: 66 [2019-01-08 13:54:29,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-08 13:54:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-08 13:54:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-08 13:54:29,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-08 13:54:29,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-08 13:54:29,938 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-08 13:54:29,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:29,938 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-08 13:54:29,938 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-08 13:54:29,938 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-08 13:54:29,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-08 13:54:29,938 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:29,938 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-08 13:54:29,939 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:29,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:29,939 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-08 13:54:29,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:29,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:29,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:29,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:29,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:31,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:31,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:31,455 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:31,455 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:31,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:31,455 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-08 13:54:31,467 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:31,467 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:31,868 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-08 13:54:31,868 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:31,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:31,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:31,884 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:36,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:36,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:36,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-08 13:54:36,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:36,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-08 13:54:36,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-08 13:54:36,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-08 13:54:36,177 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-08 13:54:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:36,295 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-08 13:54:36,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-08 13:54:36,296 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-08 13:54:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:36,297 INFO L225 Difference]: With dead ends: 69 [2019-01-08 13:54:36,297 INFO L226 Difference]: Without dead ends: 67 [2019-01-08 13:54:36,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-08 13:54:36,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-08 13:54:36,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-08 13:54:36,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-08 13:54:36,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-08 13:54:36,301 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-08 13:54:36,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:36,301 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-08 13:54:36,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-08 13:54:36,301 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-08 13:54:36,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-08 13:54:36,302 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:36,302 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-08 13:54:36,302 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:36,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:36,302 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-08 13:54:36,302 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:36,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:36,303 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:36,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:36,303 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:38,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:38,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:38,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:38,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:38,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:38,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:54:38,269 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:38,269 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:38,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:38,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:38,338 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:38,348 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:38,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:42,898 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:42,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:42,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-08 13:54:42,918 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:42,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-08 13:54:42,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-08 13:54:42,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-08 13:54:42,919 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-08 13:54:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:43,035 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-08 13:54:43,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-08 13:54:43,037 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-08 13:54:43,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:43,038 INFO L225 Difference]: With dead ends: 70 [2019-01-08 13:54:43,038 INFO L226 Difference]: Without dead ends: 68 [2019-01-08 13:54:43,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-08 13:54:43,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-08 13:54:43,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-08 13:54:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-08 13:54:43,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-08 13:54:43,043 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-08 13:54:43,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:43,044 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-08 13:54:43,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-08 13:54:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-08 13:54:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-08 13:54:43,045 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:43,045 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-08 13:54:43,045 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:43,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:43,046 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-08 13:54:43,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:43,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:43,050 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:43,051 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:43,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:44,637 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:44,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:44,637 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:44,637 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:44,637 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:44,637 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:44,637 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-08 13:54:44,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:44,646 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:54:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:44,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:44,719 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:44,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:49,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:49,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-08 13:54:49,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:49,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-08 13:54:49,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-08 13:54:49,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-08 13:54:49,377 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-08 13:54:49,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:49,464 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-08 13:54:49,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-08 13:54:49,465 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-08 13:54:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:49,465 INFO L225 Difference]: With dead ends: 71 [2019-01-08 13:54:49,465 INFO L226 Difference]: Without dead ends: 69 [2019-01-08 13:54:49,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-08 13:54:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-08 13:54:49,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-08 13:54:49,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-08 13:54:49,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-08 13:54:49,469 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-08 13:54:49,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:49,469 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-08 13:54:49,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-08 13:54:49,469 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-08 13:54:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-08 13:54:49,470 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:49,470 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-08 13:54:49,470 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:49,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:49,470 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-08 13:54:49,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:49,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:49,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:54:49,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:49,471 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:49,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:51,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:51,041 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:51,041 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:51,042 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:51,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:51,042 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-08 13:54:51,051 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:54:51,052 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:54:51,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-08 13:54:51,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:51,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:51,573 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:54:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:57,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:54:57,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-08 13:54:57,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:54:57,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-08 13:54:57,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-08 13:54:57,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 13:54:57,210 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-08 13:54:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:54:57,363 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-08 13:54:57,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-08 13:54:57,364 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-08 13:54:57,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:54:57,364 INFO L225 Difference]: With dead ends: 72 [2019-01-08 13:54:57,364 INFO L226 Difference]: Without dead ends: 70 [2019-01-08 13:54:57,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-08 13:54:57,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-08 13:54:57,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-08 13:54:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-08 13:54:57,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-08 13:54:57,367 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-08 13:54:57,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:54:57,367 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-08 13:54:57,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-08 13:54:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-08 13:54:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-08 13:54:57,367 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:54:57,367 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-08 13:54:57,368 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:54:57,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:54:57,368 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-08 13:54:57,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:54:57,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:57,368 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:54:57,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:54:57,369 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:54:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:54:59,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:59,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:59,794 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:54:59,794 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:54:59,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:54:59,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:54:59,794 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-08 13:54:59,808 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:54:59,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:54:59,868 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:54:59,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:54:59,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:54:59,883 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:54:59,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:04,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:04,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-08 13:55:04,926 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:04,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-08 13:55:04,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-08 13:55:04,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-08 13:55:04,928 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-08 13:55:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:05,222 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-08 13:55:05,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-08 13:55:05,223 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-08 13:55:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:05,223 INFO L225 Difference]: With dead ends: 73 [2019-01-08 13:55:05,223 INFO L226 Difference]: Without dead ends: 71 [2019-01-08 13:55:05,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-08 13:55:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-08 13:55:05,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-08 13:55:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-08 13:55:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-08 13:55:05,226 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-08 13:55:05,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:05,227 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-08 13:55:05,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-08 13:55:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-08 13:55:05,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-08 13:55:05,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:05,228 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-08 13:55:05,229 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:05,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:05,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-08 13:55:05,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:05,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:05,230 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:05,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:05,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:06,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:06,929 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:06,929 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:06,929 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:06,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:06,929 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-08 13:55:06,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:06,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:07,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:07,019 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:07,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:12,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:12,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:12,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-08 13:55:12,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:12,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-08 13:55:12,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-08 13:55:12,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-08 13:55:12,269 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-08 13:55:12,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:12,366 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-08 13:55:12,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-08 13:55:12,366 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-08 13:55:12,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:12,367 INFO L225 Difference]: With dead ends: 74 [2019-01-08 13:55:12,367 INFO L226 Difference]: Without dead ends: 72 [2019-01-08 13:55:12,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-08 13:55:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-08 13:55:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-08 13:55:12,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-08 13:55:12,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-08 13:55:12,371 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-08 13:55:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:12,371 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-08 13:55:12,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-08 13:55:12,371 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-08 13:55:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-08 13:55:12,371 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:12,371 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-08 13:55:12,372 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:12,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:12,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-08 13:55:12,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:12,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:12,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:12,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:12,373 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:14,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:14,411 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:14,411 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:14,412 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:14,412 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:14,412 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:14,412 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-08 13:55:14,420 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:14,420 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:14,998 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-08 13:55:14,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:15,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:15,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:15,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:20,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:20,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-08 13:55:20,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:20,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-08 13:55:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-08 13:55:20,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 13:55:20,192 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-08 13:55:20,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:20,380 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-08 13:55:20,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-08 13:55:20,380 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-08 13:55:20,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:20,381 INFO L225 Difference]: With dead ends: 75 [2019-01-08 13:55:20,381 INFO L226 Difference]: Without dead ends: 73 [2019-01-08 13:55:20,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-08 13:55:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-08 13:55:20,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-08 13:55:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-08 13:55:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-08 13:55:20,384 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-08 13:55:20,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:20,384 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-08 13:55:20,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-08 13:55:20,384 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-08 13:55:20,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-08 13:55:20,385 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:20,385 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-08 13:55:20,385 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:20,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:20,385 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-08 13:55:20,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:20,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:20,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:20,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:20,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:22,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:22,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:22,142 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:22,142 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:22,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:22,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:22,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 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-08 13:55:22,151 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:22,151 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:22,216 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:22,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:22,219 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:22,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:27,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:27,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:27,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-08 13:55:27,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:27,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-08 13:55:27,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-08 13:55:27,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-08 13:55:27,546 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-08 13:55:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:27,713 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-08 13:55:27,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-08 13:55:27,714 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-08 13:55:27,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:27,715 INFO L225 Difference]: With dead ends: 76 [2019-01-08 13:55:27,715 INFO L226 Difference]: Without dead ends: 74 [2019-01-08 13:55:27,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-08 13:55:27,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-08 13:55:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-08 13:55:27,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-08 13:55:27,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-08 13:55:27,720 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-08 13:55:27,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:27,720 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-08 13:55:27,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-08 13:55:27,720 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-08 13:55:27,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-08 13:55:27,721 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:27,721 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-08 13:55:27,721 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:27,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:27,722 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-08 13:55:27,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:27,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:27,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:27,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:27,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:30,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:30,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:30,005 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:30,005 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:30,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:30,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:30,005 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-08 13:55:30,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:30,013 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:30,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:30,097 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:35,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:35,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:35,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-08 13:55:35,574 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:35,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-08 13:55:35,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-08 13:55:35,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-08 13:55:35,577 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-08 13:55:35,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:35,737 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-08 13:55:35,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-08 13:55:35,737 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-08 13:55:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:35,738 INFO L225 Difference]: With dead ends: 77 [2019-01-08 13:55:35,738 INFO L226 Difference]: Without dead ends: 75 [2019-01-08 13:55:35,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-08 13:55:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-08 13:55:35,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-08 13:55:35,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-08 13:55:35,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-08 13:55:35,742 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-08 13:55:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:35,743 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-08 13:55:35,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-08 13:55:35,743 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-08 13:55:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-08 13:55:35,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:35,744 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-08 13:55:35,744 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:35,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-08 13:55:35,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:35,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:35,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:35,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:35,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:37,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:37,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:37,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:37,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:37,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:37,644 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-08 13:55:37,652 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:55:37,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:55:38,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-08 13:55:38,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:38,345 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:38,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:38,362 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:44,261 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:44,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:44,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-08 13:55:44,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:44,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-08 13:55:44,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-08 13:55:44,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-08 13:55:44,284 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-08 13:55:44,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:44,426 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-08 13:55:44,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-08 13:55:44,426 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-08 13:55:44,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:44,427 INFO L225 Difference]: With dead ends: 78 [2019-01-08 13:55:44,427 INFO L226 Difference]: Without dead ends: 76 [2019-01-08 13:55:44,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-08 13:55:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-08 13:55:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-08 13:55:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-08 13:55:44,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-08 13:55:44,431 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-08 13:55:44,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:44,431 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-08 13:55:44,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-08 13:55:44,432 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-08 13:55:44,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-08 13:55:44,432 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:44,433 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-08 13:55:44,433 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:44,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:44,433 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-08 13:55:44,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:44,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:44,434 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:44,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:44,434 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:44,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:46,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:46,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:46,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:46,437 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:46,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:46,437 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-08 13:55:46,446 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:55:46,446 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:55:46,513 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:55:46,513 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:55:46,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:46,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:46,533 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:55:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:52,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:55:52,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-08 13:55:52,524 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:55:52,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-08 13:55:52,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-08 13:55:52,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-08 13:55:52,525 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-08 13:55:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:55:52,668 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-08 13:55:52,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-08 13:55:52,668 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-08 13:55:52,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:55:52,669 INFO L225 Difference]: With dead ends: 79 [2019-01-08 13:55:52,669 INFO L226 Difference]: Without dead ends: 77 [2019-01-08 13:55:52,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-08 13:55:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-08 13:55:52,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-08 13:55:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-08 13:55:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-08 13:55:52,672 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-08 13:55:52,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:55:52,672 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-08 13:55:52,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-08 13:55:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-08 13:55:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-08 13:55:52,673 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:55:52,673 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-08 13:55:52,674 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:55:52,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:55:52,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-08 13:55:52,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:55:52,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:52,675 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:55:52,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:55:52,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:55:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:55,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:55,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:55,026 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:55:55,026 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:55:55,026 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:55:55,026 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:55:55,026 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-08 13:55:55,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:55:55,035 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:55:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:55:55,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:55:55,118 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:55:55,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:01,040 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:01,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:01,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-08 13:56:01,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:01,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-08 13:56:01,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-08 13:56:01,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 13:56:01,061 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-08 13:56:01,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:01,210 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-08 13:56:01,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-08 13:56:01,210 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-08 13:56:01,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:01,211 INFO L225 Difference]: With dead ends: 80 [2019-01-08 13:56:01,211 INFO L226 Difference]: Without dead ends: 78 [2019-01-08 13:56:01,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-08 13:56:01,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-08 13:56:01,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-08 13:56:01,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-08 13:56:01,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-08 13:56:01,214 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-08 13:56:01,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:01,215 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-08 13:56:01,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-08 13:56:01,215 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-08 13:56:01,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-08 13:56:01,216 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:01,216 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-08 13:56:01,216 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:01,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:01,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-08 13:56:01,217 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:01,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:01,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:01,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:01,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:03,236 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:03,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:03,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:03,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:03,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:03,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:03,236 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-08 13:56:03,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:56:03,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:56:03,995 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-08 13:56:03,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:04,000 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:04,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:04,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:10,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:10,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-08 13:56:10,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:10,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-08 13:56:10,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-08 13:56:10,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-08 13:56:10,518 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-08 13:56:10,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:10,620 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-08 13:56:10,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-08 13:56:10,621 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-08 13:56:10,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:10,621 INFO L225 Difference]: With dead ends: 81 [2019-01-08 13:56:10,622 INFO L226 Difference]: Without dead ends: 79 [2019-01-08 13:56:10,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-08 13:56:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-08 13:56:10,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-08 13:56:10,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-08 13:56:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-08 13:56:10,626 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-08 13:56:10,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:10,626 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-08 13:56:10,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-08 13:56:10,627 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-08 13:56:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-08 13:56:10,627 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:10,627 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-08 13:56:10,628 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:10,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-08 13:56:10,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:10,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:10,629 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:10,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:10,629 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:12,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:12,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:12,689 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:12,689 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:12,689 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:12,689 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:12,689 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-08 13:56:12,698 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:56:12,698 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:56:12,767 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:56:12,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:12,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:12,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:12,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:19,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:19,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:19,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-08 13:56:19,228 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:19,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-08 13:56:19,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-08 13:56:19,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-08 13:56:19,230 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-08 13:56:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:19,410 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-08 13:56:19,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-08 13:56:19,410 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-08 13:56:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:19,411 INFO L225 Difference]: With dead ends: 82 [2019-01-08 13:56:19,411 INFO L226 Difference]: Without dead ends: 80 [2019-01-08 13:56:19,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-08 13:56:19,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-08 13:56:19,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-08 13:56:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-08 13:56:19,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-08 13:56:19,415 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-08 13:56:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:19,415 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-08 13:56:19,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-08 13:56:19,416 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-08 13:56:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-08 13:56:19,416 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:19,416 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-08 13:56:19,416 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:19,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:19,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-08 13:56:19,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:19,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:19,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:19,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:21,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:21,633 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:21,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:21,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:21,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:21,633 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-08 13:56:21,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:21,641 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:56:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:21,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:21,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:21,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:28,177 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:28,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:28,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-08 13:56:28,195 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:28,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-08 13:56:28,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-08 13:56:28,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-08 13:56:28,197 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-08 13:56:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:28,705 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-08 13:56:28,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-08 13:56:28,706 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-08 13:56:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:28,706 INFO L225 Difference]: With dead ends: 83 [2019-01-08 13:56:28,706 INFO L226 Difference]: Without dead ends: 81 [2019-01-08 13:56:28,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-08 13:56:28,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-08 13:56:28,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-08 13:56:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-08 13:56:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-08 13:56:28,710 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-08 13:56:28,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:28,710 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-08 13:56:28,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-08 13:56:28,710 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-08 13:56:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-08 13:56:28,711 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:28,711 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-08 13:56:28,711 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:28,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:28,711 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-08 13:56:28,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:28,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:28,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:28,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:31,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:31,095 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:31,095 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:31,095 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:31,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:31,095 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-08 13:56:31,103 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:56:31,103 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:56:31,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-08 13:56:31,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:32,003 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:32,016 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:32,016 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:38,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:38,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-08 13:56:38,539 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:38,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-08 13:56:38,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-08 13:56:38,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-08 13:56:38,541 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-08 13:56:39,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:39,179 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-08 13:56:39,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-08 13:56:39,180 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-08 13:56:39,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:39,181 INFO L225 Difference]: With dead ends: 84 [2019-01-08 13:56:39,181 INFO L226 Difference]: Without dead ends: 82 [2019-01-08 13:56:39,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-08 13:56:39,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-08 13:56:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-08 13:56:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-08 13:56:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-08 13:56:39,185 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-08 13:56:39,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:39,185 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-08 13:56:39,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-08 13:56:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-08 13:56:39,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-08 13:56:39,186 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:39,186 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-08 13:56:39,187 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:39,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:39,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-08 13:56:39,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:39,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:39,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:39,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:39,188 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:41,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:41,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:41,832 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:41,832 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:41,832 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:41,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:41,833 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-08 13:56:41,843 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:56:41,843 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:56:41,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:56:41,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:56:41,920 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:41,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:41,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:48,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:48,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:48,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-08 13:56:48,773 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:48,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-08 13:56:48,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-08 13:56:48,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-08 13:56:48,776 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-08 13:56:48,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:48,927 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-08 13:56:48,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-08 13:56:48,927 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-08 13:56:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:48,928 INFO L225 Difference]: With dead ends: 85 [2019-01-08 13:56:48,928 INFO L226 Difference]: Without dead ends: 83 [2019-01-08 13:56:48,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-08 13:56:48,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-08 13:56:48,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-08 13:56:48,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-08 13:56:48,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-08 13:56:48,932 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-08 13:56:48,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:48,932 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-08 13:56:48,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-08 13:56:48,932 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-08 13:56:48,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-08 13:56:48,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:48,933 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-08 13:56:48,933 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:48,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:48,933 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-08 13:56:48,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:48,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:48,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:56:48,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:48,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:51,467 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:51,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:51,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:56:51,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:56:51,468 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:56:51,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:56:51,468 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-08 13:56:51,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:51,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:56:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:56:51,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:56:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:51,565 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:56:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:56:58,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:56:58,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-08 13:56:58,542 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:56:58,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-08 13:56:58,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-08 13:56:58,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-08 13:56:58,544 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-08 13:56:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:56:58,663 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-08 13:56:58,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-08 13:56:58,664 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-08 13:56:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:56:58,665 INFO L225 Difference]: With dead ends: 86 [2019-01-08 13:56:58,665 INFO L226 Difference]: Without dead ends: 84 [2019-01-08 13:56:58,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-08 13:56:58,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-08 13:56:58,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-08 13:56:58,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-08 13:56:58,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-08 13:56:58,669 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-08 13:56:58,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:56:58,669 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-08 13:56:58,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-08 13:56:58,669 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-08 13:56:58,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-08 13:56:58,670 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:56:58,670 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-08 13:56:58,670 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:56:58,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:56:58,670 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-08 13:56:58,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:56:58,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:58,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:56:58,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:56:58,671 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:56:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:01,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:01,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:01,271 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:01,271 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:01,271 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:01,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:01,271 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-08 13:57:01,280 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:57:01,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:57:02,247 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-08 13:57:02,247 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:02,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:02,272 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:02,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:09,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:09,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-08 13:57:09,372 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:09,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-08 13:57:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-08 13:57:09,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 13:57:09,374 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-08 13:57:09,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:09,571 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-08 13:57:09,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-08 13:57:09,571 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-08 13:57:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:09,572 INFO L225 Difference]: With dead ends: 87 [2019-01-08 13:57:09,572 INFO L226 Difference]: Without dead ends: 85 [2019-01-08 13:57:09,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-08 13:57:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-08 13:57:09,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-08 13:57:09,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-08 13:57:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-08 13:57:09,575 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-08 13:57:09,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:09,575 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-08 13:57:09,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-08 13:57:09,575 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-08 13:57:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-08 13:57:09,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:09,575 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-08 13:57:09,575 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-08 13:57:09,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:09,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:09,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:09,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:12,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:12,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:12,517 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:12,517 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:12,517 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:12,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:12,517 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-08 13:57:12,525 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:57:12,526 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:57:12,599 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:57:12,600 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:12,602 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:12,616 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:19,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:19,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-08 13:57:19,686 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:19,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-08 13:57:19,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-08 13:57:19,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-08 13:57:19,688 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-08 13:57:19,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:19,859 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-08 13:57:19,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-08 13:57:19,859 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-08 13:57:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:19,859 INFO L225 Difference]: With dead ends: 88 [2019-01-08 13:57:19,859 INFO L226 Difference]: Without dead ends: 86 [2019-01-08 13:57:19,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-08 13:57:19,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-08 13:57:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-08 13:57:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-08 13:57:19,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-08 13:57:19,862 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-08 13:57:19,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:19,862 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-08 13:57:19,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-08 13:57:19,862 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-08 13:57:19,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-08 13:57:19,863 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:19,863 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-08 13:57:19,863 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:19,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:19,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-08 13:57:19,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:19,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:19,864 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:19,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:19,864 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:22,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:22,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:22,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:22,798 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:22,798 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:22,798 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:22,798 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:22,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:22,808 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:57:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:22,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:22,906 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:30,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:30,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-08 13:57:30,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:30,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-08 13:57:30,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-08 13:57:30,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-08 13:57:30,256 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-08 13:57:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:30,402 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-08 13:57:30,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-08 13:57:30,402 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-08 13:57:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:30,403 INFO L225 Difference]: With dead ends: 89 [2019-01-08 13:57:30,403 INFO L226 Difference]: Without dead ends: 87 [2019-01-08 13:57:30,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-08 13:57:30,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-08 13:57:30,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-08 13:57:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-08 13:57:30,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-08 13:57:30,406 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-08 13:57:30,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:30,406 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-08 13:57:30,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-08 13:57:30,406 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-08 13:57:30,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-08 13:57:30,406 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:30,407 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-08 13:57:30,407 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:30,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:30,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-08 13:57:30,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:30,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:30,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:30,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:30,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:33,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:33,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:33,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:33,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:33,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:33,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:33,263 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:57:33,264 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:57:34,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-08 13:57:34,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:34,438 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:34,452 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:42,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:42,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:42,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-08 13:57:42,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:42,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-08 13:57:42,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-08 13:57:42,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-08 13:57:42,316 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-08 13:57:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:42,460 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-08 13:57:42,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-08 13:57:42,460 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-08 13:57:42,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:42,461 INFO L225 Difference]: With dead ends: 90 [2019-01-08 13:57:42,461 INFO L226 Difference]: Without dead ends: 88 [2019-01-08 13:57:42,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-08 13:57:42,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-08 13:57:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-08 13:57:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-08 13:57:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-08 13:57:42,464 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-08 13:57:42,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:42,464 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-08 13:57:42,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-08 13:57:42,465 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-08 13:57:42,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-08 13:57:42,465 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:42,465 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-08 13:57:42,465 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:42,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:42,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-08 13:57:42,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:42,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:42,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:42,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:42,467 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:45,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:45,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:45,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:45,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:45,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:45,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:45,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:45,222 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:57:45,222 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:57:45,301 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:57:45,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:57:45,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:45,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:45,319 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:57:53,219 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:53,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:57:53,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-08 13:57:53,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:57:53,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-08 13:57:53,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-08 13:57:53,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-08 13:57:53,239 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-08 13:57:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:57:53,394 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-08 13:57:53,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-08 13:57:53,394 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-08 13:57:53,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:57:53,395 INFO L225 Difference]: With dead ends: 91 [2019-01-08 13:57:53,395 INFO L226 Difference]: Without dead ends: 89 [2019-01-08 13:57:53,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-08 13:57:53,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-08 13:57:53,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-08 13:57:53,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-08 13:57:53,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-08 13:57:53,398 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-08 13:57:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:57:53,398 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-08 13:57:53,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-08 13:57:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-08 13:57:53,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-08 13:57:53,399 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:57:53,399 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-08 13:57:53,399 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:57:53,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:57:53,399 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-08 13:57:53,400 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:57:53,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:53,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:57:53,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:57:53,400 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:57:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:56,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:56,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:57:56,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:57:56,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:57:56,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:57:56,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 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:57:56,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:57:56,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:57:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:57:56,166 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:57:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:57:56,181 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:04,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:04,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-08 13:58:04,373 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:04,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-08 13:58:04,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-08 13:58:04,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 13:58:04,376 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-08 13:58:04,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:04,732 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-08 13:58:04,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-08 13:58:04,732 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-08 13:58:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:04,733 INFO L225 Difference]: With dead ends: 92 [2019-01-08 13:58:04,733 INFO L226 Difference]: Without dead ends: 90 [2019-01-08 13:58:04,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-08 13:58:04,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-08 13:58:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-08 13:58:04,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-08 13:58:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-08 13:58:04,736 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-08 13:58:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:04,736 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-08 13:58:04,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-08 13:58:04,736 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-08 13:58:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-08 13:58:04,737 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:04,737 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-08 13:58:04,737 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:04,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:04,737 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-08 13:58:04,737 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:04,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:04,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:04,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:04,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:07,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:07,614 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:07,614 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:07,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:07,615 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:07,615 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:07,623 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:58:07,624 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:58:08,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-08 13:58:08,871 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:08,877 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:08,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:17,417 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:17,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:17,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-08 13:58:17,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:17,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-08 13:58:17,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-08 13:58:17,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-08 13:58:17,442 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-08 13:58:17,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:17,651 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-08 13:58:17,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-08 13:58:17,651 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-08 13:58:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:17,651 INFO L225 Difference]: With dead ends: 93 [2019-01-08 13:58:17,652 INFO L226 Difference]: Without dead ends: 91 [2019-01-08 13:58:17,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-08 13:58:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-08 13:58:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-08 13:58:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-08 13:58:17,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-08 13:58:17,654 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-08 13:58:17,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:17,654 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-08 13:58:17,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-08 13:58:17,655 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-08 13:58:17,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-08 13:58:17,655 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:17,655 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-08 13:58:17,655 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:17,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:17,655 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-08 13:58:17,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:17,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:17,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:17,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:17,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:20,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:20,496 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:20,496 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:20,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:20,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:20,497 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:20,507 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:58:20,507 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:58:20,595 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:58:20,595 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:20,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:20,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:20,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:29,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:29,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-08 13:58:29,278 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:29,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-08 13:58:29,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-08 13:58:29,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-08 13:58:29,280 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-08 13:58:29,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:29,425 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-08 13:58:29,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-08 13:58:29,426 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-08 13:58:29,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:29,427 INFO L225 Difference]: With dead ends: 94 [2019-01-08 13:58:29,427 INFO L226 Difference]: Without dead ends: 92 [2019-01-08 13:58:29,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-08 13:58:29,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-08 13:58:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-08 13:58:29,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-08 13:58:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-08 13:58:29,430 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-08 13:58:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:29,430 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-08 13:58:29,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-08 13:58:29,430 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-08 13:58:29,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-08 13:58:29,431 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:29,431 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-08 13:58:29,431 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:29,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:29,431 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-08 13:58:29,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:29,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:29,432 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:29,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:29,432 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:32,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:32,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:32,229 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:32,229 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:32,229 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:32,229 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:32,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:32,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:58:32,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:32,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:32,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:32,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:41,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:41,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:41,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-08 13:58:41,066 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:41,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-08 13:58:41,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-08 13:58:41,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-08 13:58:41,068 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-08 13:58:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:41,285 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-08 13:58:41,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-08 13:58:41,285 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-08 13:58:41,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:41,286 INFO L225 Difference]: With dead ends: 95 [2019-01-08 13:58:41,286 INFO L226 Difference]: Without dead ends: 93 [2019-01-08 13:58:41,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-08 13:58:41,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-08 13:58:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-08 13:58:41,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-08 13:58:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-08 13:58:41,289 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-08 13:58:41,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:41,289 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-08 13:58:41,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-08 13:58:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-08 13:58:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-08 13:58:41,290 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:41,290 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-08 13:58:41,290 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:41,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:41,291 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-08 13:58:41,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:41,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:41,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:58:41,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:41,291 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:44,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:44,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:44,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:44,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:44,363 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:44,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:44,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:44,371 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:58:44,371 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:58:45,865 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-08 13:58:45,865 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:45,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:45,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:58:54,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:54,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:58:54,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-08 13:58:54,711 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:58:54,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-08 13:58:54,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-08 13:58:54,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-08 13:58:54,713 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-08 13:58:54,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:58:54,853 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-08 13:58:54,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-08 13:58:54,853 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-08 13:58:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:58:54,854 INFO L225 Difference]: With dead ends: 96 [2019-01-08 13:58:54,854 INFO L226 Difference]: Without dead ends: 94 [2019-01-08 13:58:54,855 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-08 13:58:54,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-08 13:58:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-08 13:58:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-08 13:58:54,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-08 13:58:54,858 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-08 13:58:54,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:58:54,859 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-08 13:58:54,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-08 13:58:54,859 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-08 13:58:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-08 13:58:54,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:58:54,860 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-08 13:58:54,860 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:58:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:58:54,860 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-08 13:58:54,860 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:58:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:54,861 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:58:54,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:58:54,861 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:58:54,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:58:57,806 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:57,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:57,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:58:57,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:58:57,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:58:57,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:58:57,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:58:57,816 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:58:57,816 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:58:57,900 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:58:57,900 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:58:57,903 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:58:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:58:57,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:06,944 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:06,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:06,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-08 13:59:06,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:06,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-08 13:59:06,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-08 13:59:06,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 13:59:06,966 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-08 13:59:07,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:07,218 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-08 13:59:07,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-08 13:59:07,218 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-08 13:59:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:07,218 INFO L225 Difference]: With dead ends: 97 [2019-01-08 13:59:07,219 INFO L226 Difference]: Without dead ends: 95 [2019-01-08 13:59:07,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-08 13:59:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-08 13:59:07,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-08 13:59:07,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-08 13:59:07,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-08 13:59:07,222 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-08 13:59:07,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:07,223 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-08 13:59:07,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-08 13:59:07,223 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-08 13:59:07,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-08 13:59:07,223 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:07,224 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-08 13:59:07,224 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:07,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:07,224 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-08 13:59:07,224 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:07,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:07,225 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:07,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:07,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:10,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:10,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:10,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:10,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:10,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:10,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:10,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:10,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:10,532 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:59:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:10,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:10,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:20,039 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:20,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:20,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-08 13:59:20,058 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:20,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-08 13:59:20,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-08 13:59:20,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-08 13:59:20,060 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-08 13:59:20,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:20,256 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-08 13:59:20,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-08 13:59:20,256 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-08 13:59:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:20,256 INFO L225 Difference]: With dead ends: 98 [2019-01-08 13:59:20,257 INFO L226 Difference]: Without dead ends: 96 [2019-01-08 13:59:20,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-08 13:59:20,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-08 13:59:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-08 13:59:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-08 13:59:20,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-08 13:59:20,260 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-08 13:59:20,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:20,260 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-08 13:59:20,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-08 13:59:20,260 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-08 13:59:20,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-08 13:59:20,260 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:20,261 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-08 13:59:20,261 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:20,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:20,261 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-08 13:59:20,261 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:20,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:20,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:20,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:20,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:23,586 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:23,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:23,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:23,586 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:23,586 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:23,586 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:23,586 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:23,594 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 13:59:23,594 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 13:59:25,249 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-08 13:59:25,250 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:25,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:25,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:25,273 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:34,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:34,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-08 13:59:34,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:34,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-08 13:59:34,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-08 13:59:34,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-08 13:59:34,844 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-08 13:59:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:35,013 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-08 13:59:35,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-08 13:59:35,013 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-08 13:59:35,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:35,014 INFO L225 Difference]: With dead ends: 99 [2019-01-08 13:59:35,014 INFO L226 Difference]: Without dead ends: 97 [2019-01-08 13:59:35,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-08 13:59:35,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-08 13:59:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-08 13:59:35,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-08 13:59:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-08 13:59:35,018 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-08 13:59:35,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:35,018 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-08 13:59:35,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-08 13:59:35,018 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-08 13:59:35,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-08 13:59:35,019 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:35,019 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-08 13:59:35,019 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:35,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:35,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-08 13:59:35,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:35,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:35,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:35,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:35,020 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:38,146 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:38,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:38,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:38,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:38,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:38,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:38,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:38,155 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 13:59:38,155 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 13:59:38,239 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 13:59:38,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 13:59:38,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:38,259 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:38,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 13:59:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:47,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 13:59:47,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-08 13:59:47,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 13:59:47,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-08 13:59:47,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-08 13:59:47,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-08 13:59:47,835 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-08 13:59:47,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 13:59:47,982 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-08 13:59:47,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-08 13:59:47,983 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-08 13:59:47,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 13:59:47,983 INFO L225 Difference]: With dead ends: 100 [2019-01-08 13:59:47,983 INFO L226 Difference]: Without dead ends: 98 [2019-01-08 13:59:47,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-08 13:59:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-08 13:59:47,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-08 13:59:47,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-08 13:59:47,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-08 13:59:47,986 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-08 13:59:47,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 13:59:47,986 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-08 13:59:47,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-08 13:59:47,986 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-08 13:59:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-08 13:59:47,987 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 13:59:47,987 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-08 13:59:47,987 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 13:59:47,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 13:59:47,987 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-08 13:59:47,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 13:59:47,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:47,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 13:59:47,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 13:59:47,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 13:59:48,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:51,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:51,437 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:51,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 13:59:51,437 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 13:59:51,438 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 13:59:51,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 13:59:51,438 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 13:59:51,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 13:59:51,448 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 13:59:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 13:59:51,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 13:59:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 13:59:51,552 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:01,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:01,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:01,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-08 14:00:01,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:01,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-08 14:00:01,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-08 14:00:01,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-08 14:00:01,468 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-08 14:00:01,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:01,633 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-08 14:00:01,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-08 14:00:01,633 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-08 14:00:01,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:01,634 INFO L225 Difference]: With dead ends: 101 [2019-01-08 14:00:01,634 INFO L226 Difference]: Without dead ends: 99 [2019-01-08 14:00:01,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-08 14:00:01,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-08 14:00:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-08 14:00:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-08 14:00:01,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-08 14:00:01,637 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-08 14:00:01,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:01,637 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-08 14:00:01,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-08 14:00:01,637 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-08 14:00:01,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-08 14:00:01,637 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:01,638 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-08 14:00:01,638 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:01,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:01,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-08 14:00:01,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:01,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:01,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:01,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:01,639 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:05,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:05,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:05,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:05,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:05,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:05,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:05,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:00:05,198 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:00:07,105 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-08 14:00:07,105 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:07,112 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:07,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:17,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:17,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-08 14:00:17,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:17,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-08 14:00:17,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-08 14:00:17,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-08 14:00:17,122 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-08 14:00:17,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:17,288 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-08 14:00:17,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-08 14:00:17,289 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-08 14:00:17,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:17,290 INFO L225 Difference]: With dead ends: 102 [2019-01-08 14:00:17,290 INFO L226 Difference]: Without dead ends: 100 [2019-01-08 14:00:17,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-08 14:00:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-08 14:00:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-08 14:00:17,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-08 14:00:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-08 14:00:17,294 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-08 14:00:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:17,294 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-08 14:00:17,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-08 14:00:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-08 14:00:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-08 14:00:17,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:17,295 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-08 14:00:17,295 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:17,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:17,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-08 14:00:17,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:17,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:17,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:17,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:17,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:20,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:20,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:20,942 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:20,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:20,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:20,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:20,950 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:00:20,950 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:00:21,037 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:00:21,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:21,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:21,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:31,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:31,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:31,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-08 14:00:31,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:31,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-08 14:00:31,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-08 14:00:31,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-08 14:00:31,308 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-08 14:00:31,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:31,513 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-08 14:00:31,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-08 14:00:31,514 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-08 14:00:31,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:31,514 INFO L225 Difference]: With dead ends: 103 [2019-01-08 14:00:31,514 INFO L226 Difference]: Without dead ends: 101 [2019-01-08 14:00:31,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-08 14:00:31,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-08 14:00:31,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-08 14:00:31,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-08 14:00:31,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-08 14:00:31,518 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-08 14:00:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:31,518 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-08 14:00:31,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-08 14:00:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-08 14:00:31,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-08 14:00:31,519 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:31,519 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-08 14:00:31,519 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:31,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:31,519 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-08 14:00:31,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:31,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:31,520 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:00:31,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:31,520 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:31,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:34,915 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:34,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:34,915 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:34,915 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:34,916 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:34,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:34,916 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:34,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:34,923 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:00:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:35,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:35,032 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:00:45,357 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:45,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:00:45,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-08 14:00:45,376 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:00:45,376 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-08 14:00:45,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-08 14:00:45,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-08 14:00:45,379 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-08 14:00:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:00:45,738 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-08 14:00:45,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-08 14:00:45,739 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-08 14:00:45,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:00:45,739 INFO L225 Difference]: With dead ends: 104 [2019-01-08 14:00:45,739 INFO L226 Difference]: Without dead ends: 102 [2019-01-08 14:00:45,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-08 14:00:45,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-08 14:00:45,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-08 14:00:45,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-08 14:00:45,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-08 14:00:45,744 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-08 14:00:45,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:00:45,745 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-08 14:00:45,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-08 14:00:45,745 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-08 14:00:45,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-08 14:00:45,745 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:00:45,746 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-08 14:00:45,746 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:00:45,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:00:45,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-08 14:00:45,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:00:45,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:45,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:00:45,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:00:45,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:00:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:00:49,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:49,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:49,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:00:49,249 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:00:49,249 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:00:49,249 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:00:49,249 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:00:49,258 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:00:49,258 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:00:51,303 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-08 14:00:51,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:00:51,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:00:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:00:51,330 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:02,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:02,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-08 14:01:02,115 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:02,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-08 14:01:02,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-08 14:01:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-08 14:01:02,117 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-08 14:01:02,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:02,361 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-08 14:01:02,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-08 14:01:02,362 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-08 14:01:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:02,362 INFO L225 Difference]: With dead ends: 105 [2019-01-08 14:01:02,362 INFO L226 Difference]: Without dead ends: 103 [2019-01-08 14:01:02,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-08 14:01:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-08 14:01:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-08 14:01:02,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-08 14:01:02,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-08 14:01:02,365 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-08 14:01:02,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:02,366 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-08 14:01:02,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-08 14:01:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-08 14:01:02,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-08 14:01:02,366 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:02,366 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-08 14:01:02,367 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:02,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:02,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-08 14:01:02,367 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:02,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:02,367 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:02,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:02,368 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:02,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:06,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:06,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:06,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:06,108 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:06,108 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:06,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:06,108 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:06,117 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:01:06,117 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:01:06,209 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:01:06,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:06,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:06,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:17,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:17,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-08 14:01:17,134 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:17,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-08 14:01:17,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-08 14:01:17,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-08 14:01:17,136 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-08 14:01:17,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:17,409 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-08 14:01:17,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-08 14:01:17,410 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-08 14:01:17,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:17,410 INFO L225 Difference]: With dead ends: 106 [2019-01-08 14:01:17,411 INFO L226 Difference]: Without dead ends: 104 [2019-01-08 14:01:17,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-08 14:01:17,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-08 14:01:17,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-08 14:01:17,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-08 14:01:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-08 14:01:17,414 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-08 14:01:17,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:17,414 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-08 14:01:17,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-08 14:01:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-08 14:01:17,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-08 14:01:17,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:17,415 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-08 14:01:17,416 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:17,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:17,416 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-08 14:01:17,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:17,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:17,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:17,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:17,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:17,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:21,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:21,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:21,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:21,017 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:21,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:21,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:21,017 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:21,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:21,026 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:01:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:21,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:21,138 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:21,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:32,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:32,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-08 14:01:32,543 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:32,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-08 14:01:32,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-08 14:01:32,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-08 14:01:32,545 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-08 14:01:32,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:32,719 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-08 14:01:32,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-08 14:01:32,719 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-08 14:01:32,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:32,720 INFO L225 Difference]: With dead ends: 107 [2019-01-08 14:01:32,720 INFO L226 Difference]: Without dead ends: 105 [2019-01-08 14:01:32,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-08 14:01:32,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-08 14:01:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-08 14:01:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-08 14:01:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-08 14:01:32,725 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-08 14:01:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:32,725 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-08 14:01:32,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-08 14:01:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-08 14:01:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-08 14:01:32,726 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:32,726 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-08 14:01:32,726 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:32,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-08 14:01:32,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:32,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:32,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:01:32,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:32,727 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:36,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:36,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:36,394 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:36,394 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:36,394 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:36,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:36,394 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 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:36,404 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:01:36,404 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:01:39,013 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-08 14:01:39,013 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:39,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:39,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:01:50,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:50,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:01:50,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-08 14:01:50,449 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:01:50,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-08 14:01:50,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-08 14:01:50,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-08 14:01:50,452 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-08 14:01:50,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:01:50,794 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-08 14:01:50,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-08 14:01:50,794 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-08 14:01:50,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:01:50,795 INFO L225 Difference]: With dead ends: 108 [2019-01-08 14:01:50,795 INFO L226 Difference]: Without dead ends: 106 [2019-01-08 14:01:50,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-08 14:01:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-08 14:01:50,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-08 14:01:50,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-08 14:01:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-08 14:01:50,799 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-08 14:01:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:01:50,800 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-08 14:01:50,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-08 14:01:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-08 14:01:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-08 14:01:50,801 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:01:50,801 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-08 14:01:50,801 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:01:50,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:01:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-08 14:01:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:01:50,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:50,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:01:50,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:01:50,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:01:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:01:54,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:54,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:54,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:01:54,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:01:54,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:01:54,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:01:54,812 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 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:01:54,820 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:01:54,820 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:01:54,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:01:54,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:01:54,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:01:54,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:01:54,942 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:06,414 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:06,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:06,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-08 14:02:06,434 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:06,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-08 14:02:06,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-08 14:02:06,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-08 14:02:06,436 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-08 14:02:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:06,731 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-08 14:02:06,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-08 14:02:06,732 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-08 14:02:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:06,732 INFO L225 Difference]: With dead ends: 109 [2019-01-08 14:02:06,733 INFO L226 Difference]: Without dead ends: 107 [2019-01-08 14:02:06,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-08 14:02:06,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-08 14:02:06,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-08 14:02:06,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-08 14:02:06,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-08 14:02:06,737 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-08 14:02:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:06,737 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-08 14:02:06,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-08 14:02:06,737 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-08 14:02:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-08 14:02:06,738 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:06,738 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-08 14:02:06,738 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:06,738 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-08 14:02:06,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:06,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:06,739 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:06,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:06,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:10,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:10,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:10,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:10,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:10,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:10,839 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 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:10,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:10,849 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:02:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:10,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:10,966 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:10,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:22,721 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:22,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-08 14:02:22,721 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:22,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-08 14:02:22,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-08 14:02:22,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-08 14:02:22,724 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-08 14:02:23,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:23,044 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-08 14:02:23,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-08 14:02:23,044 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-08 14:02:23,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:23,045 INFO L225 Difference]: With dead ends: 110 [2019-01-08 14:02:23,045 INFO L226 Difference]: Without dead ends: 108 [2019-01-08 14:02:23,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-08 14:02:23,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-08 14:02:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-08 14:02:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-08 14:02:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-08 14:02:23,048 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-08 14:02:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:23,049 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-08 14:02:23,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-08 14:02:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-08 14:02:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-08 14:02:23,049 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:23,049 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-08 14:02:23,049 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:23,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-08 14:02:23,050 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:23,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:23,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:02:23,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:23,050 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:26,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:26,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:26,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:26,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:26,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:26,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:26,922 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 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:26,930 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:02:26,930 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:02:29,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-08 14:02:29,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:29,669 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:29,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:29,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:41,650 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:41,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:41,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-08 14:02:41,673 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:41,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-08 14:02:41,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-08 14:02:41,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-08 14:02:41,675 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-08 14:02:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:41,914 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-08 14:02:41,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-08 14:02:41,914 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-08 14:02:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:41,915 INFO L225 Difference]: With dead ends: 111 [2019-01-08 14:02:41,915 INFO L226 Difference]: Without dead ends: 109 [2019-01-08 14:02:41,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-08 14:02:41,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-08 14:02:41,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-08 14:02:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-08 14:02:41,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-08 14:02:41,919 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-08 14:02:41,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:41,919 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-08 14:02:41,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-08 14:02:41,919 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-08 14:02:41,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-08 14:02:41,920 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:41,920 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-08 14:02:41,920 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:41,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:41,921 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-08 14:02:41,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:41,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:41,921 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:41,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:41,921 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:41,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:02:46,086 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:46,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:46,086 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:02:46,086 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:02:46,086 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:02:46,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:02:46,087 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:02:46,094 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:02:46,094 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:02:46,190 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:02:46,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:02:46,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:02:46,214 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:46,214 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:02:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:02:58,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:02:58,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-08 14:02:58,323 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:02:58,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-08 14:02:58,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-08 14:02:58,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-08 14:02:58,325 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-08 14:02:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:02:58,593 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-08 14:02:58,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-08 14:02:58,593 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-08 14:02:58,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:02:58,594 INFO L225 Difference]: With dead ends: 112 [2019-01-08 14:02:58,594 INFO L226 Difference]: Without dead ends: 110 [2019-01-08 14:02:58,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-08 14:02:58,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-08 14:02:58,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-08 14:02:58,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-08 14:02:58,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-08 14:02:58,597 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-08 14:02:58,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:02:58,597 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-08 14:02:58,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-08 14:02:58,597 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-08 14:02:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-08 14:02:58,598 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:02:58,598 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-08 14:02:58,598 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:02:58,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:02:58,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-08 14:02:58,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:02:58,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:58,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:02:58,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:02:58,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:02:58,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:02,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:02,765 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:02,765 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:02,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:02,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:02,766 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 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:02,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:02,774 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:02,873 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:02,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:02,892 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:15,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:15,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:15,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-08 14:03:15,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:15,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-08 14:03:15,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-08 14:03:15,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-08 14:03:15,443 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-08 14:03:15,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:15,713 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-08 14:03:15,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-08 14:03:15,713 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-08 14:03:15,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:15,714 INFO L225 Difference]: With dead ends: 113 [2019-01-08 14:03:15,714 INFO L226 Difference]: Without dead ends: 111 [2019-01-08 14:03:15,715 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-08 14:03:15,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-08 14:03:15,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-08 14:03:15,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-08 14:03:15,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-08 14:03:15,718 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-08 14:03:15,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:15,718 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-08 14:03:15,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-08 14:03:15,718 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-08 14:03:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-08 14:03:15,718 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:15,719 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-08 14:03:15,719 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:15,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-08 14:03:15,719 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:15,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:15,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:15,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:15,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:20,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:20,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:20,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:20,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:20,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:20,083 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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:20,091 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:03:20,091 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:03:23,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-08 14:03:23,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:23,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:23,052 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:23,052 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:36,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:36,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-08 14:03:36,102 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:36,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-08 14:03:36,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-08 14:03:36,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-08 14:03:36,105 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-08 14:03:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:36,456 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-08 14:03:36,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-08 14:03:36,457 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-08 14:03:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:36,457 INFO L225 Difference]: With dead ends: 114 [2019-01-08 14:03:36,457 INFO L226 Difference]: Without dead ends: 112 [2019-01-08 14:03:36,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-08 14:03:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-08 14:03:36,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-08 14:03:36,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-08 14:03:36,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-08 14:03:36,462 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-08 14:03:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:36,462 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-08 14:03:36,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-08 14:03:36,463 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-08 14:03:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-08 14:03:36,463 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:36,463 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-08 14:03:36,463 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:36,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:36,464 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-08 14:03:36,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:36,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:36,465 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:36,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:36,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:40,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:40,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:40,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:40,982 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:40,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:40,982 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 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:40,990 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-08 14:03:40,990 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-08 14:03:41,088 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-08 14:03:41,088 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:03:41,094 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:41,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:41,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:03:53,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:53,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:03:53,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-08 14:03:53,962 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:03:53,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-08 14:03:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-08 14:03:53,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-08 14:03:53,965 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-08 14:03:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:03:54,259 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-08 14:03:54,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-08 14:03:54,259 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-08 14:03:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:03:54,260 INFO L225 Difference]: With dead ends: 115 [2019-01-08 14:03:54,261 INFO L226 Difference]: Without dead ends: 113 [2019-01-08 14:03:54,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-08 14:03:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-08 14:03:54,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-08 14:03:54,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-08 14:03:54,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-08 14:03:54,266 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-08 14:03:54,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:03:54,266 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-08 14:03:54,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-08 14:03:54,266 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-08 14:03:54,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-08 14:03:54,267 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:03:54,267 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-08 14:03:54,268 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:03:54,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:03:54,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-08 14:03:54,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:03:54,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:54,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-08 14:03:54,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:03:54,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:03:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:58,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:58,844 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:03:58,844 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:03:58,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:03:58,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:03:58,844 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 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:03:58,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:03:58,853 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-08 14:03:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:03:58,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:03:58,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:03:58,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-08 14:04:12,162 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:12,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-08 14:04:12,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-08 14:04:12,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-08 14:04:12,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-08 14:04:12,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-08 14:04:12,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-08 14:04:12,184 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-08 14:04:12,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-08 14:04:12,416 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-08 14:04:12,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-08 14:04:12,416 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-08 14:04:12,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-08 14:04:12,417 INFO L225 Difference]: With dead ends: 116 [2019-01-08 14:04:12,417 INFO L226 Difference]: Without dead ends: 114 [2019-01-08 14:04:12,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-08 14:04:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-08 14:04:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-08 14:04:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-08 14:04:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-08 14:04:12,421 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-08 14:04:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-08 14:04:12,421 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-08 14:04:12,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-08 14:04:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-08 14:04:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-08 14:04:12,422 INFO L394 BasicCegarLoop]: Found error trace [2019-01-08 14:04:12,422 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-08 14:04:12,422 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-08 14:04:12,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-08 14:04:12,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-08 14:04:12,423 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-08 14:04:12,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:12,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-08 14:04:12,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-08 14:04:12,424 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-08 14:04:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-08 14:04:16,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:16,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:16,983 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-08 14:04:16,983 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-08 14:04:16,984 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-08 14:04:16,984 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-08 14:04:16,984 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 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-08 14:04:16,991 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-08 14:04:16,992 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-08 14:04:20,251 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-08 14:04:20,251 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-08 14:04:20,259 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-08 14:04:20,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-08 14:04:20,280 INFO L316 TraceCheckSpWp]: Computing backward predicates...