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/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 10:10:11,193 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 10:10:11,195 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 10:10:11,207 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 10:10:11,208 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 10:10:11,209 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 10:10:11,210 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 10:10:11,212 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 10:10:11,213 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 10:10:11,214 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 10:10:11,215 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 10:10:11,215 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 10:10:11,216 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 10:10:11,217 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 10:10:11,219 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 10:10:11,219 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 10:10:11,220 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 10:10:11,222 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 10:10:11,224 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 10:10:11,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 10:10:11,229 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 10:10:11,231 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 10:10:11,235 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 10:10:11,235 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 10:10:11,235 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 10:10:11,236 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 10:10:11,237 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 10:10:11,242 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 10:10:11,243 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 10:10:11,245 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 10:10:11,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 10:10:11,246 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 10:10:11,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 10:10:11,246 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 10:10:11,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 10:10:11,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 10:10:11,248 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-02-28 10:10:11,261 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 10:10:11,261 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 10:10:11,262 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 10:10:11,262 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 10:10:11,262 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 10:10:11,262 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 10:10:11,263 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 10:10:11,263 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 10:10:11,263 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 10:10:11,263 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 10:10:11,263 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 10:10:11,264 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-02-28 10:10:11,264 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 10:10:11,264 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 10:10:11,265 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 10:10:11,265 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 10:10:11,265 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 10:10:11,265 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 10:10:11,266 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 10:10:11,266 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 10:10:11,266 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 10:10:11,266 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 10:10:11,266 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 10:10:11,267 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 10:10:11,267 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 10:10:11,267 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 10:10:11,267 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 10:10:11,267 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 10:10:11,268 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 10:10:11,268 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 10:10:11,268 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 10:10:11,268 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:11,268 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 10:10:11,269 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 10:10:11,269 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 10:10:11,269 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 10:10:11,269 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 10:10:11,269 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 10:10:11,270 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 10:10:11,270 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 10:10:11,298 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 10:10:11,311 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 10:10:11,314 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 10:10:11,316 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 10:10:11,316 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 10:10:11,317 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2019-02-28 10:10:11,317 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2019-02-28 10:10:11,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 10:10:11,355 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 10:10:11,356 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:11,356 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 10:10:11,356 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 10:10:11,372 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,384 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 10:10:11,392 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 10:10:11,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 10:10:11,393 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 10:10:11,404 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,406 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/1) ... [2019-02-28 10:10:11,413 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 10:10:11,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 10:10:11,414 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 10:10:11,414 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 10:10:11,415 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 10:10:11,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 10:10:11,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 10:10:11,724 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 10:10:11,724 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-28 10:10:11,725 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:11 BoogieIcfgContainer [2019-02-28 10:10:11,726 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 10:10:11,727 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 10:10:11,727 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 10:10:11,731 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 10:10:11,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 10:10:11" (1/2) ... [2019-02-28 10:10:11,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665e8094 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 10:10:11, skipping insertion in model container [2019-02-28 10:10:11,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 10:10:11" (2/2) ... [2019-02-28 10:10:11,735 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bpl [2019-02-28 10:10:11,747 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 10:10:11,754 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 10:10:11,774 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 10:10:11,817 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 10:10:11,818 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 10:10:11,818 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 10:10:11,818 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 10:10:11,818 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 10:10:11,819 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 10:10:11,819 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 10:10:11,819 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 10:10:11,837 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 10:10:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 10:10:11,845 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:11,846 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 10:10:11,849 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:11,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:11,858 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-28 10:10:11,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:11,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:11,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:11,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:11,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:11,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:12,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 10:10:12,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 10:10:12,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 10:10:12,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 10:10:12,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 10:10:12,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 10:10:12,054 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-28 10:10:12,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:12,113 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-28 10:10:12,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 10:10:12,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 10:10:12,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:12,131 INFO L225 Difference]: With dead ends: 9 [2019-02-28 10:10:12,132 INFO L226 Difference]: Without dead ends: 5 [2019-02-28 10:10:12,137 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-02-28 10:10:12,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-28 10:10:12,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-28 10:10:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 10:10:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-28 10:10:12,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-28 10:10:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:12,177 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-28 10:10:12,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 10:10:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 10:10:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 10:10:12,178 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:12,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 10:10:12,179 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:12,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,179 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-02-28 10:10:12,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:12,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:12,338 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:12,338 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:12,339 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 10:10:12,342 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-28 10:10:12,419 INFO L148 AbstractInterpreter]: Using domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2019-02-28 10:10:12,420 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 10:10:12,557 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 10:10:12,559 INFO L272 AbstractInterpreter]: Visited 4 different actions 10 times. Merged at 1 different actions 3 times. Never widened. Performed 76 root evaluator evaluations with a maximum evaluation depth of 5. Performed 76 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-02-28 10:10:12,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-28 10:10:12,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:12,566 INFO 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-02-28 10:10:12,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,583 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:12,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 3 conjunts are in the unsatisfiable core [2019-02-28 10:10:12,630 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:12,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:12,668 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:12,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:12,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:12,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-02-28 10:10:12,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:12,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-28 10:10:12,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-28 10:10:12,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:10:12,892 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-02-28 10:10:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:12,922 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-28 10:10:12,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-28 10:10:12,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-28 10:10:12,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:12,923 INFO L225 Difference]: With dead ends: 8 [2019-02-28 10:10:12,923 INFO L226 Difference]: Without dead ends: 6 [2019-02-28 10:10:12,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-02-28 10:10:12,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-02-28 10:10:12,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-02-28 10:10:12,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-28 10:10:12,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-28 10:10:12,927 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-02-28 10:10:12,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:12,928 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-28 10:10:12,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-28 10:10:12,928 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-28 10:10:12,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-28 10:10:12,928 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:12,928 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-28 10:10:12,929 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:12,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:12,929 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-02-28 10:10:12,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:12,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:12,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:12,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:13,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:13,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:13,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:13,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,027 INFO 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-02-28 10:10:13,041 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:13,041 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:13,063 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-02-28 10:10:13,064 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:13,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2019-02-28 10:10:13,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:13,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,070 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:13,172 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:13,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-02-28 10:10:13,190 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:13,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-02-28 10:10:13,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-02-28 10:10:13,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-02-28 10:10:13,191 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-02-28 10:10:13,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:13,227 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-02-28 10:10:13,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-28 10:10:13,228 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-02-28 10:10:13,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:13,229 INFO L225 Difference]: With dead ends: 9 [2019-02-28 10:10:13,229 INFO L226 Difference]: Without dead ends: 7 [2019-02-28 10:10:13,229 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-02-28 10:10:13,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-28 10:10:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-28 10:10:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-28 10:10:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-28 10:10:13,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-02-28 10:10:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:13,233 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-28 10:10:13,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-02-28 10:10:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-28 10:10:13,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-28 10:10:13,234 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:13,234 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-02-28 10:10:13,234 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:13,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:13,235 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-02-28 10:10:13,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:13,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,237 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:13,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:13,488 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,488 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,488 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:13,489 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:13,489 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:13,489 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:13,489 INFO 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-02-28 10:10:13,508 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:13,509 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:13,545 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:13,545 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:13,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 5 conjunts are in the unsatisfiable core [2019-02-28 10:10:13,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:13,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,555 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:13,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:13,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-02-28 10:10:13,891 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:13,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-02-28 10:10:13,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-02-28 10:10:13,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:10:13,893 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-02-28 10:10:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:13,920 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-28 10:10:13,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-28 10:10:13,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-02-28 10:10:13,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:13,923 INFO L225 Difference]: With dead ends: 10 [2019-02-28 10:10:13,923 INFO L226 Difference]: Without dead ends: 8 [2019-02-28 10:10:13,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-02-28 10:10:13,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-28 10:10:13,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-02-28 10:10:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-28 10:10:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-28 10:10:13,927 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-02-28 10:10:13,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:13,928 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-28 10:10:13,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-02-28 10:10:13,928 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-28 10:10:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-28 10:10:13,929 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:13,929 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-02-28 10:10:13,930 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:13,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:13,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-02-28 10:10:13,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:13,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:13,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:13,932 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:14,091 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:14,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,091 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:14,091 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:14,091 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:14,091 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,092 INFO 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-02-28 10:10:14,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:14,100 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:14,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjunts are in the unsatisfiable core [2019-02-28 10:10:14,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:14,117 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:14,247 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:14,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:14,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-02-28 10:10:14,267 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:14,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-28 10:10:14,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-28 10:10:14,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:10:14,271 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-02-28 10:10:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:14,299 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-02-28 10:10:14,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-28 10:10:14,302 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-02-28 10:10:14,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:14,303 INFO L225 Difference]: With dead ends: 11 [2019-02-28 10:10:14,303 INFO L226 Difference]: Without dead ends: 9 [2019-02-28 10:10:14,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-02-28 10:10:14,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-28 10:10:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-02-28 10:10:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-02-28 10:10:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-02-28 10:10:14,306 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-02-28 10:10:14,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:14,307 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-02-28 10:10:14,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-28 10:10:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-02-28 10:10:14,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-02-28 10:10:14,307 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:14,308 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-02-28 10:10:14,308 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:14,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:14,308 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-02-28 10:10:14,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:14,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:14,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,310 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:14,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:14,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:14,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:14,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:14,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:14,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:14,416 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:14,417 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:14,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-02-28 10:10:14,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:14,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 7 conjunts are in the unsatisfiable core [2019-02-28 10:10:14,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:14,437 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:14,437 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:14,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:14,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:14,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-02-28 10:10:14,592 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:14,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-02-28 10:10:14,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-02-28 10:10:14,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:14,593 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-02-28 10:10:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:14,628 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-28 10:10:14,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-28 10:10:14,629 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-02-28 10:10:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:14,630 INFO L225 Difference]: With dead ends: 12 [2019-02-28 10:10:14,630 INFO L226 Difference]: Without dead ends: 10 [2019-02-28 10:10:14,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-02-28 10:10:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-02-28 10:10:14,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-02-28 10:10:14,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-28 10:10:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-28 10:10:14,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-02-28 10:10:14,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:14,634 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-28 10:10:14,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-02-28 10:10:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-28 10:10:14,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-28 10:10:14,635 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:14,635 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-02-28 10:10:14,636 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:14,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:14,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-02-28 10:10:14,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:14,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:14,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:14,638 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,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-02-28 10:10:15,062 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,063 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:15,063 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:15,063 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:15,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,064 INFO 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-02-28 10:10:15,073 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:15,073 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:15,091 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:15,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:15,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2019-02-28 10:10:15,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,100 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:15,266 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:15,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-02-28 10:10:15,286 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:15,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-28 10:10:15,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-28 10:10:15,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:10:15,287 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-02-28 10:10:15,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:15,310 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-02-28 10:10:15,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-28 10:10:15,311 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-02-28 10:10:15,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:15,312 INFO L225 Difference]: With dead ends: 13 [2019-02-28 10:10:15,312 INFO L226 Difference]: Without dead ends: 11 [2019-02-28 10:10:15,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-02-28 10:10:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-28 10:10:15,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-02-28 10:10:15,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-02-28 10:10:15,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-02-28 10:10:15,317 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-02-28 10:10:15,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:15,317 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-02-28 10:10:15,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-28 10:10:15,317 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-02-28 10:10:15,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-02-28 10:10:15,318 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:15,318 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-02-28 10:10:15,318 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:15,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:15,318 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-02-28 10:10:15,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:15,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:15,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,320 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:15,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,458 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,459 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:15,459 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:15,459 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:15,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:15,459 INFO 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-02-28 10:10:15,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:15,470 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:15,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 9 conjunts are in the unsatisfiable core [2019-02-28 10:10:15,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:15,488 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:15,740 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:15,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:15,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-02-28 10:10:15,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:15,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-02-28 10:10:15,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-02-28 10:10:15,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:10:15,760 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-02-28 10:10:15,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:15,822 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-28 10:10:15,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-28 10:10:15,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-02-28 10:10:15,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:15,824 INFO L225 Difference]: With dead ends: 14 [2019-02-28 10:10:15,824 INFO L226 Difference]: Without dead ends: 12 [2019-02-28 10:10:15,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-02-28 10:10:15,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-02-28 10:10:15,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-02-28 10:10:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-28 10:10:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-28 10:10:15,827 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-02-28 10:10:15,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:15,827 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-28 10:10:15,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-02-28 10:10:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-28 10:10:15,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-28 10:10:15,828 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:15,828 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-02-28 10:10:15,829 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:15,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:15,829 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-02-28 10:10:15,829 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:15,830 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:16,151 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,152 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:16,152 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:16,152 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:16,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,153 INFO 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-02-28 10:10:16,162 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:16,162 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:16,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-02-28 10:10:16,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:16,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2019-02-28 10:10:16,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,189 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:16,445 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:16,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-02-28 10:10:16,467 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:16,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-28 10:10:16,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-28 10:10:16,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:10:16,469 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-02-28 10:10:16,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:16,505 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-02-28 10:10:16,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-28 10:10:16,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-02-28 10:10:16,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:16,505 INFO L225 Difference]: With dead ends: 15 [2019-02-28 10:10:16,506 INFO L226 Difference]: Without dead ends: 13 [2019-02-28 10:10:16,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-02-28 10:10:16,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-28 10:10:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-02-28 10:10:16,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-02-28 10:10:16,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-02-28 10:10:16,509 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-02-28 10:10:16,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:16,510 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-02-28 10:10:16,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-28 10:10:16,510 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-02-28 10:10:16,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-02-28 10:10:16,510 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:16,510 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-02-28 10:10:16,511 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:16,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:16,511 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-02-28 10:10:16,511 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:16,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,512 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:16,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:16,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:16,727 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,727 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,727 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:16,728 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:16,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:16,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:16,728 INFO 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-02-28 10:10:16,741 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:16,741 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:16,752 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:16,752 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:16,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 11 conjunts are in the unsatisfiable core [2019-02-28 10:10:16,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:16,761 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,761 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:16,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:16,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-02-28 10:10:16,983 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:16,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-02-28 10:10:16,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-02-28 10:10:16,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:16,985 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-02-28 10:10:17,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:17,039 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-28 10:10:17,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-28 10:10:17,039 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-02-28 10:10:17,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:17,040 INFO L225 Difference]: With dead ends: 16 [2019-02-28 10:10:17,040 INFO L226 Difference]: Without dead ends: 14 [2019-02-28 10:10:17,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-02-28 10:10:17,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-02-28 10:10:17,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-02-28 10:10:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-28 10:10:17,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-28 10:10:17,044 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-02-28 10:10:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:17,044 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-28 10:10:17,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-02-28 10:10:17,045 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-28 10:10:17,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-28 10:10:17,045 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:17,045 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-02-28 10:10:17,045 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:17,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:17,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-02-28 10:10:17,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:17,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:17,226 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:17,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:17,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:17,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,227 INFO 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-02-28 10:10:17,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:17,237 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:17,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 12 conjunts are in the unsatisfiable core [2019-02-28 10:10:17,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,255 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:17,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-02-28 10:10:17,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:17,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-28 10:10:17,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-28 10:10:17,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-02-28 10:10:17,461 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-02-28 10:10:17,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:17,493 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-02-28 10:10:17,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-28 10:10:17,493 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-02-28 10:10:17,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:17,494 INFO L225 Difference]: With dead ends: 17 [2019-02-28 10:10:17,494 INFO L226 Difference]: Without dead ends: 15 [2019-02-28 10:10:17,495 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-02-28 10:10:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-28 10:10:17,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-02-28 10:10:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-02-28 10:10:17,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-02-28 10:10:17,499 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-02-28 10:10:17,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:17,499 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-02-28 10:10:17,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-28 10:10:17,500 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-02-28 10:10:17,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-02-28 10:10:17,500 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:17,500 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-02-28 10:10:17,501 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:17,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:17,501 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-02-28 10:10:17,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:17,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:17,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:17,502 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:17,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:17,774 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:17,777 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:17,777 INFO 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-02-28 10:10:17,790 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:17,790 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:17,839 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-02-28 10:10:17,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:17,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 13 conjunts are in the unsatisfiable core [2019-02-28 10:10:17,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:17,851 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:18,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:18,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-02-28 10:10:18,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:18,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-02-28 10:10:18,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-02-28 10:10:18,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:10:18,326 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-02-28 10:10:18,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:18,363 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-28 10:10:18,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-28 10:10:18,368 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-02-28 10:10:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:18,369 INFO L225 Difference]: With dead ends: 18 [2019-02-28 10:10:18,369 INFO L226 Difference]: Without dead ends: 16 [2019-02-28 10:10:18,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-02-28 10:10:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-02-28 10:10:18,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-02-28 10:10:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-28 10:10:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-28 10:10:18,373 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-02-28 10:10:18,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:18,373 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-28 10:10:18,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-02-28 10:10:18,373 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-28 10:10:18,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-28 10:10:18,374 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:18,374 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-02-28 10:10:18,374 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:18,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:18,374 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-02-28 10:10:18,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:18,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:18,376 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:18,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:18,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:18,640 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:18,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,641 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:18,641 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:18,641 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:18,641 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:18,641 INFO 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-02-28 10:10:18,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:18,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:18,672 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:18,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:18,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 14 conjunts are in the unsatisfiable core [2019-02-28 10:10:18,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:18,681 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:19,277 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:19,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:19,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-02-28 10:10:19,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:19,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-28 10:10:19,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-28 10:10:19,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:10:19,298 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-02-28 10:10:19,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:19,355 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-02-28 10:10:19,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-28 10:10:19,356 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-02-28 10:10:19,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:19,357 INFO L225 Difference]: With dead ends: 19 [2019-02-28 10:10:19,357 INFO L226 Difference]: Without dead ends: 17 [2019-02-28 10:10:19,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-02-28 10:10:19,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-28 10:10:19,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-02-28 10:10:19,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-02-28 10:10:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-02-28 10:10:19,361 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-02-28 10:10:19,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:19,361 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-02-28 10:10:19,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-28 10:10:19,361 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-02-28 10:10:19,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-02-28 10:10:19,362 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:19,362 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-02-28 10:10:19,362 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:19,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:19,362 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-02-28 10:10:19,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:19,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:19,363 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:19,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:19,363 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:19,560 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:19,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:19,560 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:19,561 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:19,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:19,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:19,561 INFO 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-02-28 10:10:19,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:19,571 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:19,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:19,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 15 conjunts are in the unsatisfiable core [2019-02-28 10:10:19,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:19,593 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:19,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:20,005 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:20,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:20,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-02-28 10:10:20,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:20,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-02-28 10:10:20,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-02-28 10:10:20,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:10:20,027 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-02-28 10:10:20,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:20,062 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-28 10:10:20,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-28 10:10:20,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-02-28 10:10:20,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:20,070 INFO L225 Difference]: With dead ends: 20 [2019-02-28 10:10:20,070 INFO L226 Difference]: Without dead ends: 18 [2019-02-28 10:10:20,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-02-28 10:10:20,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-02-28 10:10:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-02-28 10:10:20,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-28 10:10:20,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-28 10:10:20,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-02-28 10:10:20,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:20,075 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-28 10:10:20,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-02-28 10:10:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-28 10:10:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-28 10:10:20,076 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:20,076 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-02-28 10:10:20,076 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-02-28 10:10:20,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:20,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:20,078 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:20,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:20,521 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:20,521 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:20,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:20,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:20,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 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-02-28 10:10:20,531 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:20,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:20,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-02-28 10:10:20,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:20,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjunts are in the unsatisfiable core [2019-02-28 10:10:20,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:20,647 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:21,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:21,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-02-28 10:10:21,282 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:21,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-28 10:10:21,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-28 10:10:21,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:10:21,284 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-02-28 10:10:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:21,357 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-02-28 10:10:21,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-28 10:10:21,357 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-02-28 10:10:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:21,358 INFO L225 Difference]: With dead ends: 21 [2019-02-28 10:10:21,358 INFO L226 Difference]: Without dead ends: 19 [2019-02-28 10:10:21,359 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-02-28 10:10:21,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-28 10:10:21,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-02-28 10:10:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-02-28 10:10:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-02-28 10:10:21,363 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-02-28 10:10:21,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:21,363 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-02-28 10:10:21,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-28 10:10:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-02-28 10:10:21,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-02-28 10:10:21,364 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:21,364 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-02-28 10:10:21,364 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:21,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-02-28 10:10:21,365 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:21,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,365 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:21,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:21,365 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:21,765 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:21,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:21,766 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:21,766 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:21,766 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:21,766 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:21,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 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-02-28 10:10:21,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:21,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:21,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:21,791 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:21,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 17 conjunts are in the unsatisfiable core [2019-02-28 10:10:21,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:21,800 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:22,352 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:22,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:22,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-02-28 10:10:22,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:22,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-02-28 10:10:22,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-02-28 10:10:22,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:22,373 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-02-28 10:10:22,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:22,411 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-28 10:10:22,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-28 10:10:22,411 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-02-28 10:10:22,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:22,412 INFO L225 Difference]: With dead ends: 22 [2019-02-28 10:10:22,412 INFO L226 Difference]: Without dead ends: 20 [2019-02-28 10:10:22,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-02-28 10:10:22,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-02-28 10:10:22,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-02-28 10:10:22,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-28 10:10:22,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-28 10:10:22,418 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-02-28 10:10:22,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:22,418 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-28 10:10:22,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-02-28 10:10:22,418 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-28 10:10:22,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-28 10:10:22,419 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:22,419 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-02-28 10:10:22,419 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:22,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:22,420 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-02-28 10:10:22,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:22,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:22,421 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:22,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:22,421 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:23,443 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,443 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:23,443 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:23,444 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:23,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:23,444 INFO 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-02-28 10:10:23,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:23,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:23,479 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 18 conjunts are in the unsatisfiable core [2019-02-28 10:10:23,480 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:23,488 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:23,488 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:24,407 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:24,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:24,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-02-28 10:10:24,429 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:24,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-28 10:10:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-28 10:10:24,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-28 10:10:24,430 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-02-28 10:10:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:24,455 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-02-28 10:10:24,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-28 10:10:24,456 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-02-28 10:10:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:24,457 INFO L225 Difference]: With dead ends: 23 [2019-02-28 10:10:24,457 INFO L226 Difference]: Without dead ends: 21 [2019-02-28 10:10:24,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-02-28 10:10:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-28 10:10:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-02-28 10:10:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-02-28 10:10:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-02-28 10:10:24,461 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-02-28 10:10:24,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:24,461 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-02-28 10:10:24,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-28 10:10:24,461 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-02-28 10:10:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-02-28 10:10:24,462 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:24,462 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-02-28 10:10:24,462 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:24,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-02-28 10:10:24,463 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:24,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:24,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:24,464 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:24,704 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:24,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:24,704 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:24,704 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:24,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:24,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:24,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 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-02-28 10:10:24,714 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:24,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:24,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-02-28 10:10:24,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:24,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 19 conjunts are in the unsatisfiable core [2019-02-28 10:10:24,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:24,747 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:25,688 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:25,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:25,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-02-28 10:10:25,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:25,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-02-28 10:10:25,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-02-28 10:10:25,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:25,709 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-02-28 10:10:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:25,736 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-28 10:10:25,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-28 10:10:25,737 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-02-28 10:10:25,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:25,738 INFO L225 Difference]: With dead ends: 24 [2019-02-28 10:10:25,738 INFO L226 Difference]: Without dead ends: 22 [2019-02-28 10:10:25,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-02-28 10:10:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-02-28 10:10:25,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-02-28 10:10:25,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-28 10:10:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-28 10:10:25,743 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-02-28 10:10:25,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:25,744 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-28 10:10:25,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-02-28 10:10:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-28 10:10:25,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-28 10:10:25,744 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:25,745 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-02-28 10:10:25,745 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:25,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:25,745 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-02-28 10:10:25,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:25,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:25,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:25,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:25,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:26,579 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:26,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:26,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:26,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:26,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:26,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:26,580 INFO 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-02-28 10:10:26,588 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:26,588 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:26,602 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:26,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:26,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 20 conjunts are in the unsatisfiable core [2019-02-28 10:10:26,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:26,614 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:27,189 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:27,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:27,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-02-28 10:10:27,209 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:27,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-28 10:10:27,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-28 10:10:27,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-02-28 10:10:27,211 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-02-28 10:10:27,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:27,248 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-02-28 10:10:27,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-28 10:10:27,248 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-02-28 10:10:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:27,249 INFO L225 Difference]: With dead ends: 25 [2019-02-28 10:10:27,249 INFO L226 Difference]: Without dead ends: 23 [2019-02-28 10:10:27,251 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-02-28 10:10:27,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-28 10:10:27,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-02-28 10:10:27,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-02-28 10:10:27,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-02-28 10:10:27,254 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-02-28 10:10:27,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:27,255 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-02-28 10:10:27,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-28 10:10:27,255 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-02-28 10:10:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-02-28 10:10:27,256 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:27,256 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-02-28 10:10:27,256 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-02-28 10:10:27,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:27,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:27,257 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:27,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:27,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:27,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:27,576 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:27,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,576 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:27,576 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:27,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:27,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:27,577 INFO 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-02-28 10:10:27,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:27,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:27,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:27,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 21 conjunts are in the unsatisfiable core [2019-02-28 10:10:27,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:27,608 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:27,609 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:28,066 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:28,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-02-28 10:10:28,085 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:28,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-02-28 10:10:28,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-02-28 10:10:28,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:10:28,086 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-02-28 10:10:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:28,159 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-28 10:10:28,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-28 10:10:28,160 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-02-28 10:10:28,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:28,161 INFO L225 Difference]: With dead ends: 26 [2019-02-28 10:10:28,162 INFO L226 Difference]: Without dead ends: 24 [2019-02-28 10:10:28,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-02-28 10:10:28,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-02-28 10:10:28,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-02-28 10:10:28,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-28 10:10:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-28 10:10:28,167 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-02-28 10:10:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:28,167 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-28 10:10:28,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-02-28 10:10:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-28 10:10:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-28 10:10:28,168 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:28,168 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-02-28 10:10:28,168 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:28,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:28,168 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-02-28 10:10:28,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:28,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:28,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:28,170 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:28,425 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:28,426 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:28,426 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:28,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:28,426 INFO 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-02-28 10:10:28,434 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:28,435 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:28,462 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-02-28 10:10:28,462 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:28,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 22 conjunts are in the unsatisfiable core [2019-02-28 10:10:28,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:28,471 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:29,234 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:29,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-02-28 10:10:29,254 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:29,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-28 10:10:29,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-28 10:10:29,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:10:29,256 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-02-28 10:10:29,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:29,297 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-02-28 10:10:29,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-28 10:10:29,297 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-02-28 10:10:29,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:29,298 INFO L225 Difference]: With dead ends: 27 [2019-02-28 10:10:29,298 INFO L226 Difference]: Without dead ends: 25 [2019-02-28 10:10:29,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-02-28 10:10:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-28 10:10:29,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-02-28 10:10:29,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-02-28 10:10:29,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-02-28 10:10:29,302 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-02-28 10:10:29,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:29,303 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-02-28 10:10:29,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-28 10:10:29,303 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-02-28 10:10:29,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-02-28 10:10:29,304 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:29,304 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-02-28 10:10:29,304 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:29,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:29,304 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-02-28 10:10:29,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:29,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:29,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:29,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:29,306 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:29,576 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:29,577 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:29,577 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:29,577 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:29,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:29,577 INFO 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-02-28 10:10:29,586 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:29,586 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:29,602 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:29,602 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:29,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 23 conjunts are in the unsatisfiable core [2019-02-28 10:10:29,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:29,612 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:30,269 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:30,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:30,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-02-28 10:10:30,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:30,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-02-28 10:10:30,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-02-28 10:10:30,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:10:30,291 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-02-28 10:10:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:30,389 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-28 10:10:30,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-28 10:10:30,391 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-02-28 10:10:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:30,391 INFO L225 Difference]: With dead ends: 28 [2019-02-28 10:10:30,391 INFO L226 Difference]: Without dead ends: 26 [2019-02-28 10:10:30,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-02-28 10:10:30,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-02-28 10:10:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-02-28 10:10:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-28 10:10:30,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-28 10:10:30,395 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-02-28 10:10:30,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:30,395 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-28 10:10:30,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-02-28 10:10:30,395 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-28 10:10:30,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-28 10:10:30,396 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:30,396 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-02-28 10:10:30,396 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:30,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:30,396 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-02-28 10:10:30,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:30,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,397 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:30,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:30,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:30,759 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:30,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:30,760 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:30,760 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:30,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:30,760 INFO 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-02-28 10:10:30,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:30,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:30,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 24 conjunts are in the unsatisfiable core [2019-02-28 10:10:30,789 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:30,797 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:31,638 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:31,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:31,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-02-28 10:10:31,658 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:31,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-28 10:10:31,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-28 10:10:31,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-28 10:10:31,659 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-02-28 10:10:31,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:31,695 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-02-28 10:10:31,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-28 10:10:31,696 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-02-28 10:10:31,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:31,696 INFO L225 Difference]: With dead ends: 29 [2019-02-28 10:10:31,696 INFO L226 Difference]: Without dead ends: 27 [2019-02-28 10:10:31,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-02-28 10:10:31,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-28 10:10:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-02-28 10:10:31,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-02-28 10:10:31,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-02-28 10:10:31,702 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-02-28 10:10:31,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:31,703 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-02-28 10:10:31,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-28 10:10:31,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-02-28 10:10:31,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-02-28 10:10:31,704 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:31,704 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-02-28 10:10:31,704 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:31,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:31,704 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-02-28 10:10:31,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:31,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:31,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:31,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:32,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:32,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:32,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:32,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:32,069 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:32,069 INFO 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-02-28 10:10:32,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:32,078 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:32,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-02-28 10:10:32,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:32,113 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 25 conjunts are in the unsatisfiable core [2019-02-28 10:10:32,114 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:32,122 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:32,122 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:32,853 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:32,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:32,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-02-28 10:10:32,873 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:32,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-02-28 10:10:32,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-02-28 10:10:32,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:10:32,874 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-02-28 10:10:32,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:32,929 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-28 10:10:32,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-28 10:10:32,930 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-02-28 10:10:32,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:32,930 INFO L225 Difference]: With dead ends: 30 [2019-02-28 10:10:32,931 INFO L226 Difference]: Without dead ends: 28 [2019-02-28 10:10:32,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-02-28 10:10:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-02-28 10:10:32,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-02-28 10:10:32,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-28 10:10:32,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-28 10:10:32,936 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-02-28 10:10:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:32,936 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-28 10:10:32,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-02-28 10:10:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-28 10:10:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-28 10:10:32,937 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:32,937 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-02-28 10:10:32,937 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-02-28 10:10:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:32,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:32,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:32,939 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:33,256 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:33,256 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:33,256 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:33,257 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:33,257 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:33,257 INFO 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-02-28 10:10:33,267 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:33,268 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:33,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:33,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:33,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 26 conjunts are in the unsatisfiable core [2019-02-28 10:10:33,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:33,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:34,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:34,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-02-28 10:10:34,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:34,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-28 10:10:34,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-28 10:10:34,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:10:34,381 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-02-28 10:10:34,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:34,434 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-02-28 10:10:34,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-28 10:10:34,435 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-02-28 10:10:34,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:34,436 INFO L225 Difference]: With dead ends: 31 [2019-02-28 10:10:34,436 INFO L226 Difference]: Without dead ends: 29 [2019-02-28 10:10:34,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-02-28 10:10:34,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-28 10:10:34,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-02-28 10:10:34,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-02-28 10:10:34,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-02-28 10:10:34,441 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-02-28 10:10:34,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:34,442 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-02-28 10:10:34,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-28 10:10:34,442 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-02-28 10:10:34,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-02-28 10:10:34,442 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:34,442 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-02-28 10:10:34,443 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:34,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:34,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-02-28 10:10:34,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:34,444 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:34,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:34,444 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:34,802 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:34,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:34,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:34,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:34,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:34,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:34,802 INFO 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-02-28 10:10:34,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:34,813 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:34,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 27 conjunts are in the unsatisfiable core [2019-02-28 10:10:34,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:34,840 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:36,130 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:36,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:36,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-02-28 10:10:36,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:36,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-02-28 10:10:36,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-02-28 10:10:36,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:10:36,152 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-02-28 10:10:36,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:36,214 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-28 10:10:36,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-28 10:10:36,215 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-02-28 10:10:36,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:36,216 INFO L225 Difference]: With dead ends: 32 [2019-02-28 10:10:36,216 INFO L226 Difference]: Without dead ends: 30 [2019-02-28 10:10:36,218 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-02-28 10:10:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-02-28 10:10:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-02-28 10:10:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-28 10:10:36,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-28 10:10:36,220 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-02-28 10:10:36,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:36,221 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-28 10:10:36,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-02-28 10:10:36,221 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-28 10:10:36,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-28 10:10:36,221 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:36,221 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-02-28 10:10:36,222 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:36,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:36,222 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-02-28 10:10:36,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:36,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:36,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:36,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:36,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:36,793 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:36,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:36,793 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:36,793 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:36,793 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:36,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:36,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 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-02-28 10:10:36,803 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:36,803 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:36,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-02-28 10:10:36,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:36,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 28 conjunts are in the unsatisfiable core [2019-02-28 10:10:36,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:36,852 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:37,652 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:37,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:37,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-02-28 10:10:37,671 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:37,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-28 10:10:37,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-28 10:10:37,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:10:37,673 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-02-28 10:10:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:37,831 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-02-28 10:10:37,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-28 10:10:37,831 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-02-28 10:10:37,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:37,832 INFO L225 Difference]: With dead ends: 33 [2019-02-28 10:10:37,832 INFO L226 Difference]: Without dead ends: 31 [2019-02-28 10:10:37,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-02-28 10:10:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-28 10:10:37,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-02-28 10:10:37,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-02-28 10:10:37,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-02-28 10:10:37,836 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-02-28 10:10:37,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:37,836 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-02-28 10:10:37,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-28 10:10:37,837 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-02-28 10:10:37,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-02-28 10:10:37,837 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:37,837 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-02-28 10:10:37,837 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:37,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:37,838 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-02-28 10:10:37,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:37,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:37,838 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:37,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:37,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:37,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:38,725 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:38,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,725 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:38,725 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:38,725 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:38,725 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:38,725 INFO 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-02-28 10:10:38,737 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:38,737 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:38,756 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:38,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:38,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 29 conjunts are in the unsatisfiable core [2019-02-28 10:10:38,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:38,763 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:39,934 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:39,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:39,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-02-28 10:10:39,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:39,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-02-28 10:10:39,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-02-28 10:10:39,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:10:39,954 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-02-28 10:10:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:39,988 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-28 10:10:39,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-28 10:10:39,988 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-02-28 10:10:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:39,989 INFO L225 Difference]: With dead ends: 34 [2019-02-28 10:10:39,989 INFO L226 Difference]: Without dead ends: 32 [2019-02-28 10:10:39,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-02-28 10:10:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-02-28 10:10:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-02-28 10:10:39,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-28 10:10:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-28 10:10:39,994 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-02-28 10:10:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:39,994 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-28 10:10:39,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-02-28 10:10:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-28 10:10:39,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-28 10:10:39,995 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:39,995 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-02-28 10:10:39,995 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:39,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:39,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-02-28 10:10:39,996 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:39,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:39,997 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:39,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:39,997 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:40,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:40,500 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:40,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:40,500 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:40,500 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:40,500 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:40,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:40,500 INFO 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-02-28 10:10:40,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:40,510 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:40,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 30 conjunts are in the unsatisfiable core [2019-02-28 10:10:40,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:40,540 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:40,541 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:41,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:41,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-02-28 10:10:41,516 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:41,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-28 10:10:41,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-28 10:10:41,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:10:41,518 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-02-28 10:10:41,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:41,620 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-02-28 10:10:41,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-28 10:10:41,620 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-02-28 10:10:41,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:41,621 INFO L225 Difference]: With dead ends: 35 [2019-02-28 10:10:41,621 INFO L226 Difference]: Without dead ends: 33 [2019-02-28 10:10:41,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-02-28 10:10:41,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-28 10:10:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-02-28 10:10:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-02-28 10:10:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-02-28 10:10:41,625 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-02-28 10:10:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:41,626 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-02-28 10:10:41,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-28 10:10:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-02-28 10:10:41,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-02-28 10:10:41,626 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:41,627 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-02-28 10:10:41,627 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:41,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:41,627 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-02-28 10:10:41,627 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:41,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:41,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:41,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:41,628 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:41,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:42,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:42,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:42,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:42,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:42,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:42,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:42,337 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:42,338 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:42,393 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-02-28 10:10:42,393 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:42,394 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjunts are in the unsatisfiable core [2019-02-28 10:10:42,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:42,405 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:42,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:43,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:43,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-02-28 10:10:43,474 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:43,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-02-28 10:10:43,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-02-28 10:10:43,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:10:43,476 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-02-28 10:10:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:43,527 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-28 10:10:43,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-28 10:10:43,528 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-02-28 10:10:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:43,528 INFO L225 Difference]: With dead ends: 36 [2019-02-28 10:10:43,529 INFO L226 Difference]: Without dead ends: 34 [2019-02-28 10:10:43,530 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-02-28 10:10:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-02-28 10:10:43,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-02-28 10:10:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-28 10:10:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-28 10:10:43,533 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-02-28 10:10:43,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:43,533 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-28 10:10:43,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-02-28 10:10:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-28 10:10:43,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-28 10:10:43,534 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:43,534 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-02-28 10:10:43,535 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:43,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:43,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-02-28 10:10:43,535 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:43,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:43,536 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:43,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:43,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:43,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:44,146 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:44,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:44,147 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:44,147 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:44,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:44,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:44,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 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-02-28 10:10:44,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:44,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:44,180 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:44,180 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:44,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 32 conjunts are in the unsatisfiable core [2019-02-28 10:10:44,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:44,190 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:45,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:45,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-02-28 10:10:45,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:45,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-28 10:10:45,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-28 10:10:45,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:10:45,610 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-02-28 10:10:45,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:45,704 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-02-28 10:10:45,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-28 10:10:45,704 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-02-28 10:10:45,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:45,705 INFO L225 Difference]: With dead ends: 37 [2019-02-28 10:10:45,705 INFO L226 Difference]: Without dead ends: 35 [2019-02-28 10:10:45,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-02-28 10:10:45,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-28 10:10:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-02-28 10:10:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-02-28 10:10:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-02-28 10:10:45,708 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-02-28 10:10:45,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:45,708 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-02-28 10:10:45,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-28 10:10:45,708 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-02-28 10:10:45,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-02-28 10:10:45,708 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:45,708 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-02-28 10:10:45,709 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:45,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-02-28 10:10:45,709 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:45,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:45,710 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:45,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:45,710 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:46,284 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:46,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:46,285 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:46,285 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:46,285 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:46,285 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:46,285 INFO 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-02-28 10:10:46,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:46,293 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:46,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:46,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 33 conjunts are in the unsatisfiable core [2019-02-28 10:10:46,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:46,321 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:47,410 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:47,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:47,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-02-28 10:10:47,428 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:47,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-02-28 10:10:47,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-02-28 10:10:47,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:10:47,430 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-02-28 10:10:47,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:47,532 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-28 10:10:47,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-28 10:10:47,532 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-02-28 10:10:47,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:47,533 INFO L225 Difference]: With dead ends: 38 [2019-02-28 10:10:47,533 INFO L226 Difference]: Without dead ends: 36 [2019-02-28 10:10:47,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-02-28 10:10:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-02-28 10:10:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-02-28 10:10:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-28 10:10:47,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-28 10:10:47,537 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-02-28 10:10:47,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:47,538 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-28 10:10:47,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-02-28 10:10:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-28 10:10:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-28 10:10:47,538 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:47,538 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-02-28 10:10:47,539 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:47,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-02-28 10:10:47,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:47,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:47,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:47,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:47,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:48,027 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:48,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:48,027 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:48,027 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:48,028 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:48,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:48,028 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:48,036 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:48,037 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:48,098 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-02-28 10:10:48,098 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:48,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 34 conjunts are in the unsatisfiable core [2019-02-28 10:10:48,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:48,110 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:48,110 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:49,484 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:49,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:49,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-02-28 10:10:49,505 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:49,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-28 10:10:49,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-28 10:10:49,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:10:49,506 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-02-28 10:10:49,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:49,605 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-02-28 10:10:49,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-28 10:10:49,606 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-02-28 10:10:49,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:49,606 INFO L225 Difference]: With dead ends: 39 [2019-02-28 10:10:49,606 INFO L226 Difference]: Without dead ends: 37 [2019-02-28 10:10:49,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-02-28 10:10:49,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-28 10:10:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-02-28 10:10:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-02-28 10:10:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-02-28 10:10:49,610 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-02-28 10:10:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:49,611 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-02-28 10:10:49,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-28 10:10:49,611 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-02-28 10:10:49,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-02-28 10:10:49,611 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:49,611 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-02-28 10:10:49,611 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:49,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:49,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-02-28 10:10:49,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:49,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:49,612 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:49,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:49,613 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:50,342 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:50,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:50,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:50,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:50,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:50,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:50,343 INFO 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-02-28 10:10:50,352 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:50,352 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:50,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:50,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:50,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 35 conjunts are in the unsatisfiable core [2019-02-28 10:10:50,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:50,385 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:50,386 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:51,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:51,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-02-28 10:10:51,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:51,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-02-28 10:10:51,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-02-28 10:10:51,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:10:51,641 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-02-28 10:10:51,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:51,742 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-28 10:10:51,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-28 10:10:51,742 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-02-28 10:10:51,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:51,743 INFO L225 Difference]: With dead ends: 40 [2019-02-28 10:10:51,743 INFO L226 Difference]: Without dead ends: 38 [2019-02-28 10:10:51,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-02-28 10:10:51,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-02-28 10:10:51,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-02-28 10:10:51,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-28 10:10:51,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-28 10:10:51,747 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-02-28 10:10:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:51,747 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-28 10:10:51,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-02-28 10:10:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-28 10:10:51,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-28 10:10:51,747 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:51,747 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-02-28 10:10:51,748 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:51,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:51,748 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-02-28 10:10:51,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:51,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:51,748 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:51,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:51,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:52,328 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:52,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:52,328 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:52,328 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:52,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:52,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:52,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:52,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:52,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:52,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 36 conjunts are in the unsatisfiable core [2019-02-28 10:10:52,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:52,381 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:52,381 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:53,729 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:53,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:53,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-02-28 10:10:53,749 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:53,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-28 10:10:53,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-28 10:10:53,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-28 10:10:53,750 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-02-28 10:10:53,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:53,816 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-02-28 10:10:53,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-28 10:10:53,816 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-02-28 10:10:53,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:53,817 INFO L225 Difference]: With dead ends: 41 [2019-02-28 10:10:53,817 INFO L226 Difference]: Without dead ends: 39 [2019-02-28 10:10:53,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-02-28 10:10:53,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-28 10:10:53,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-02-28 10:10:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-02-28 10:10:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-02-28 10:10:53,821 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-02-28 10:10:53,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:53,822 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-02-28 10:10:53,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-28 10:10:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-02-28 10:10:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-02-28 10:10:53,822 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:53,823 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-02-28 10:10:53,823 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:53,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:53,823 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-02-28 10:10:53,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:53,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:53,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:54,381 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:54,381 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:54,381 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:54,382 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:54,382 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:54,382 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:54,382 INFO 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-02-28 10:10:54,391 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:10:54,391 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:10:54,468 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-02-28 10:10:54,468 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:54,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 37 conjunts are in the unsatisfiable core [2019-02-28 10:10:54,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:54,480 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:54,480 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:56,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:56,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-02-28 10:10:56,100 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:56,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-02-28 10:10:56,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-02-28 10:10:56,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:10:56,102 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-02-28 10:10:56,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:56,149 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-28 10:10:56,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-28 10:10:56,149 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-02-28 10:10:56,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:56,150 INFO L225 Difference]: With dead ends: 42 [2019-02-28 10:10:56,150 INFO L226 Difference]: Without dead ends: 40 [2019-02-28 10:10:56,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-02-28 10:10:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-02-28 10:10:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-02-28 10:10:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-28 10:10:56,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-28 10:10:56,154 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-02-28 10:10:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:56,154 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-28 10:10:56,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-02-28 10:10:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-28 10:10:56,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-28 10:10:56,155 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:56,155 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-02-28 10:10:56,155 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:56,155 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-02-28 10:10:56,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:56,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:56,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:56,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:56,156 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:56,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,788 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:56,788 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:56,788 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:56,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:56,789 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:56,798 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:10:56,798 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:10:56,822 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:10:56,822 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:10:56,824 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 38 conjunts are in the unsatisfiable core [2019-02-28 10:10:56,824 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:56,831 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:56,832 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:10:58,394 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:58,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:10:58,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-02-28 10:10:58,412 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:10:58,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-28 10:10:58,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-28 10:10:58,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:10:58,413 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-02-28 10:10:58,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:10:58,471 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-02-28 10:10:58,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-28 10:10:58,472 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-02-28 10:10:58,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:10:58,473 INFO L225 Difference]: With dead ends: 43 [2019-02-28 10:10:58,473 INFO L226 Difference]: Without dead ends: 41 [2019-02-28 10:10:58,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-02-28 10:10:58,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-28 10:10:58,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-02-28 10:10:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-02-28 10:10:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-02-28 10:10:58,476 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-02-28 10:10:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:10:58,476 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-02-28 10:10:58,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-28 10:10:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-02-28 10:10:58,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-02-28 10:10:58,477 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:10:58,477 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-02-28 10:10:58,477 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:10:58,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:10:58,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-02-28 10:10:58,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:10:58,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:58,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:10:58,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:10:58,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:10:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:59,112 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:59,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:59,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:10:59,113 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:10:59,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:10:59,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:10:59,113 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:10:59,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:10:59,121 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:10:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:10:59,158 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 39 conjunts are in the unsatisfiable core [2019-02-28 10:10:59,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:10:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:10:59,168 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:00,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:01,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-02-28 10:11:01,000 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:01,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-02-28 10:11:01,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-02-28 10:11:01,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:11:01,001 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-02-28 10:11:01,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:01,066 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-28 10:11:01,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-28 10:11:01,066 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-02-28 10:11:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:01,067 INFO L225 Difference]: With dead ends: 44 [2019-02-28 10:11:01,067 INFO L226 Difference]: Without dead ends: 42 [2019-02-28 10:11:01,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-02-28 10:11:01,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-02-28 10:11:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-02-28 10:11:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-28 10:11:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-28 10:11:01,070 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-02-28 10:11:01,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:01,070 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-28 10:11:01,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-02-28 10:11:01,070 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-28 10:11:01,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-28 10:11:01,071 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:01,071 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-02-28 10:11:01,071 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:01,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:01,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-02-28 10:11:01,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:01,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:01,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:01,072 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:01,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:01,743 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:01,743 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:01,743 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:01,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:01,743 INFO 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-02-28 10:11:01,751 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:01,751 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:01,837 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-02-28 10:11:01,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:01,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 40 conjunts are in the unsatisfiable core [2019-02-28 10:11:01,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:01,851 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:01,851 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:03,454 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:03,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:03,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-02-28 10:11:03,473 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:03,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-28 10:11:03,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-28 10:11:03,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:11:03,475 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-02-28 10:11:03,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:03,536 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-02-28 10:11:03,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-28 10:11:03,537 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-02-28 10:11:03,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:03,537 INFO L225 Difference]: With dead ends: 45 [2019-02-28 10:11:03,538 INFO L226 Difference]: Without dead ends: 43 [2019-02-28 10:11:03,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-02-28 10:11:03,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-28 10:11:03,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-02-28 10:11:03,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-02-28 10:11:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-02-28 10:11:03,541 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-02-28 10:11:03,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:03,541 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-02-28 10:11:03,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-28 10:11:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-02-28 10:11:03,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-02-28 10:11:03,542 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:03,542 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-02-28 10:11:03,542 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:03,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:03,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-02-28 10:11:03,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:03,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:03,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:03,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:03,544 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:04,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:04,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:04,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:04,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:04,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:04,237 INFO 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-02-28 10:11:04,245 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:04,245 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:04,280 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:04,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:04,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 41 conjunts are in the unsatisfiable core [2019-02-28 10:11:04,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:04,288 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:06,213 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:06,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:06,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-02-28 10:11:06,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:06,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-02-28 10:11:06,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-02-28 10:11:06,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:11:06,235 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-02-28 10:11:06,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:06,304 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-28 10:11:06,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-28 10:11:06,304 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-02-28 10:11:06,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:06,305 INFO L225 Difference]: With dead ends: 46 [2019-02-28 10:11:06,305 INFO L226 Difference]: Without dead ends: 44 [2019-02-28 10:11:06,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-02-28 10:11:06,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-02-28 10:11:06,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-02-28 10:11:06,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-28 10:11:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-28 10:11:06,309 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-02-28 10:11:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:06,309 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-28 10:11:06,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-02-28 10:11:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-28 10:11:06,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-28 10:11:06,310 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:06,310 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-02-28 10:11:06,310 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:06,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:06,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-02-28 10:11:06,310 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:06,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:06,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:06,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:06,311 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:07,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:07,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:07,033 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:07,033 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:07,033 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:07,033 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:11:07,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:07,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:07,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 42 conjunts are in the unsatisfiable core [2019-02-28 10:11:07,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:07,095 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:07,095 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:09,105 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:09,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:09,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-02-28 10:11:09,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:09,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-28 10:11:09,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-28 10:11:09,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-28 10:11:09,126 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-02-28 10:11:09,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:09,223 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-02-28 10:11:09,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-28 10:11:09,224 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-02-28 10:11:09,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:09,225 INFO L225 Difference]: With dead ends: 47 [2019-02-28 10:11:09,225 INFO L226 Difference]: Without dead ends: 45 [2019-02-28 10:11:09,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-02-28 10:11:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-28 10:11:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-02-28 10:11:09,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-02-28 10:11:09,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-02-28 10:11:09,227 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-02-28 10:11:09,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:09,228 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-02-28 10:11:09,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-28 10:11:09,228 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-02-28 10:11:09,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-02-28 10:11:09,228 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:09,228 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-02-28 10:11:09,228 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:09,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:09,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-02-28 10:11:09,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:09,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:09,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:09,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:09,230 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:10,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:10,138 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:10,138 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:10,138 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:10,138 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:10,138 INFO 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-02-28 10:11:10,146 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:10,146 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:10,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-02-28 10:11:10,256 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:10,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 43 conjunts are in the unsatisfiable core [2019-02-28 10:11:10,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:10,270 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:12,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:12,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-02-28 10:11:12,237 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:12,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-02-28 10:11:12,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-02-28 10:11:12,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:11:12,238 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-02-28 10:11:12,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:12,310 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-28 10:11:12,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-28 10:11:12,310 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-02-28 10:11:12,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:12,311 INFO L225 Difference]: With dead ends: 48 [2019-02-28 10:11:12,311 INFO L226 Difference]: Without dead ends: 46 [2019-02-28 10:11:12,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-02-28 10:11:12,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-02-28 10:11:12,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-02-28 10:11:12,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-28 10:11:12,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-28 10:11:12,314 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-02-28 10:11:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:12,314 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-28 10:11:12,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-02-28 10:11:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-28 10:11:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-28 10:11:12,315 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:12,315 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-02-28 10:11:12,315 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:12,315 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-02-28 10:11:12,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:12,316 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:12,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:12,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:13,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:13,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:13,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:13,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:13,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:13,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 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-02-28 10:11:13,244 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:13,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:13,272 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:13,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:13,274 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 44 conjunts are in the unsatisfiable core [2019-02-28 10:11:13,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:13,281 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:15,647 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:15,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:15,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-02-28 10:11:15,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:15,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-28 10:11:15,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-28 10:11:15,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:11:15,667 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-02-28 10:11:15,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:15,717 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-02-28 10:11:15,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-28 10:11:15,718 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-02-28 10:11:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:15,718 INFO L225 Difference]: With dead ends: 49 [2019-02-28 10:11:15,719 INFO L226 Difference]: Without dead ends: 47 [2019-02-28 10:11:15,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-02-28 10:11:15,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-28 10:11:15,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-02-28 10:11:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-02-28 10:11:15,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-02-28 10:11:15,722 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-02-28 10:11:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:15,723 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-02-28 10:11:15,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-28 10:11:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-02-28 10:11:15,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-02-28 10:11:15,723 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:15,723 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-02-28 10:11:15,724 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:15,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:15,724 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-02-28 10:11:15,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:15,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:15,725 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:15,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:15,725 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:15,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:16,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:16,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:16,556 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:16,556 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:16,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:16,556 INFO 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-02-28 10:11:16,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:16,565 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:16,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:16,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 45 conjunts are in the unsatisfiable core [2019-02-28 10:11:16,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:16,603 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:16,603 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:18,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:18,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-02-28 10:11:18,691 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:18,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-02-28 10:11:18,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-02-28 10:11:18,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-28 10:11:18,692 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-02-28 10:11:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:18,835 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-28 10:11:18,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-28 10:11:18,836 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-02-28 10:11:18,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:18,837 INFO L225 Difference]: With dead ends: 50 [2019-02-28 10:11:18,837 INFO L226 Difference]: Without dead ends: 48 [2019-02-28 10:11:18,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-02-28 10:11:18,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-02-28 10:11:18,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-02-28 10:11:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-28 10:11:18,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-28 10:11:18,840 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-02-28 10:11:18,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:18,840 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-28 10:11:18,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-02-28 10:11:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-28 10:11:18,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-28 10:11:18,841 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:18,842 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-02-28 10:11:18,842 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:18,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:18,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-02-28 10:11:18,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:18,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:18,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:18,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:18,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:20,493 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:20,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:20,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:20,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:20,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:20,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:20,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:11:20,503 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:20,503 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:20,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-02-28 10:11:20,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:20,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 46 conjunts are in the unsatisfiable core [2019-02-28 10:11:20,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:20,633 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:22,852 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:22,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:22,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-02-28 10:11:22,872 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:22,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-28 10:11:22,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-28 10:11:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:11:22,873 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-02-28 10:11:22,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:22,927 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-02-28 10:11:22,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-28 10:11:22,927 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-02-28 10:11:22,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:22,928 INFO L225 Difference]: With dead ends: 51 [2019-02-28 10:11:22,928 INFO L226 Difference]: Without dead ends: 49 [2019-02-28 10:11:22,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-02-28 10:11:22,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-28 10:11:22,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-02-28 10:11:22,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-02-28 10:11:22,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-02-28 10:11:22,932 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-02-28 10:11:22,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:22,932 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-02-28 10:11:22,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-28 10:11:22,932 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-02-28 10:11:22,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-02-28 10:11:22,933 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:22,933 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-02-28 10:11:22,933 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-02-28 10:11:22,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:22,934 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:22,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:22,934 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:23,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:23,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:23,806 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:23,806 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:23,806 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:23,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:23,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 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-02-28 10:11:23,815 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:23,815 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:23,870 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:23,870 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:23,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 47 conjunts are in the unsatisfiable core [2019-02-28 10:11:23,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:23,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:23,883 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:26,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:26,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:26,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-02-28 10:11:26,349 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:26,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-02-28 10:11:26,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-02-28 10:11:26,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:26,350 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-02-28 10:11:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:26,676 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-28 10:11:26,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-28 10:11:26,677 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-02-28 10:11:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:26,678 INFO L225 Difference]: With dead ends: 52 [2019-02-28 10:11:26,678 INFO L226 Difference]: Without dead ends: 50 [2019-02-28 10:11:26,678 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-02-28 10:11:26,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-02-28 10:11:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-02-28 10:11:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-28 10:11:26,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-28 10:11:26,680 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-02-28 10:11:26,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:26,680 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-28 10:11:26,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-02-28 10:11:26,680 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-28 10:11:26,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-28 10:11:26,681 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:26,681 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-02-28 10:11:26,681 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:26,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:26,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-02-28 10:11:26,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:26,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:26,682 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:26,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:26,682 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:27,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:27,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:27,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:27,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:27,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:27,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:27,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:11:27,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:27,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:27,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:27,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 48 conjunts are in the unsatisfiable core [2019-02-28 10:11:27,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:27,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:27,764 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:30,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:30,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:30,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-02-28 10:11:30,114 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:30,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-28 10:11:30,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-28 10:11:30,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-28 10:11:30,115 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-02-28 10:11:30,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:30,202 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-02-28 10:11:30,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-28 10:11:30,202 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-02-28 10:11:30,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:30,203 INFO L225 Difference]: With dead ends: 53 [2019-02-28 10:11:30,203 INFO L226 Difference]: Without dead ends: 51 [2019-02-28 10:11:30,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-02-28 10:11:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-28 10:11:30,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-02-28 10:11:30,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-02-28 10:11:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-02-28 10:11:30,205 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-02-28 10:11:30,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:30,206 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-02-28 10:11:30,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-28 10:11:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-02-28 10:11:30,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-02-28 10:11:30,206 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:30,206 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-02-28 10:11:30,207 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:30,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:30,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-02-28 10:11:30,207 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:30,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:30,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:30,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:30,208 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:30,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:31,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:31,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:31,214 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:31,214 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:31,214 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:31,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:31,215 INFO 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-02-28 10:11:31,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:31,223 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:31,376 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-02-28 10:11:31,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:31,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 49 conjunts are in the unsatisfiable core [2019-02-28 10:11:31,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:31,388 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:33,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:33,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:33,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-02-28 10:11:33,808 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:33,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-02-28 10:11:33,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-02-28 10:11:33,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:11:33,809 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-02-28 10:11:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:33,869 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-28 10:11:33,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-28 10:11:33,870 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-02-28 10:11:33,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:33,871 INFO L225 Difference]: With dead ends: 54 [2019-02-28 10:11:33,871 INFO L226 Difference]: Without dead ends: 52 [2019-02-28 10:11:33,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-02-28 10:11:33,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-02-28 10:11:33,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-02-28 10:11:33,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-28 10:11:33,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-28 10:11:33,874 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-02-28 10:11:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:33,875 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-28 10:11:33,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-02-28 10:11:33,875 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-28 10:11:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-28 10:11:33,875 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:33,875 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-02-28 10:11:33,875 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:33,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-02-28 10:11:33,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:33,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:33,877 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:33,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:33,877 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:33,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:34,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:34,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:34,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:34,846 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:34,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:34,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:34,846 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:11:34,854 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:34,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:34,885 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:34,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:34,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 50 conjunts are in the unsatisfiable core [2019-02-28 10:11:34,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:34,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:34,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:37,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:37,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:37,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-02-28 10:11:37,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:37,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-28 10:11:37,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-28 10:11:37,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:11:37,702 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-02-28 10:11:37,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:37,840 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-02-28 10:11:37,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-28 10:11:37,841 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-02-28 10:11:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:37,842 INFO L225 Difference]: With dead ends: 55 [2019-02-28 10:11:37,842 INFO L226 Difference]: Without dead ends: 53 [2019-02-28 10:11:37,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-02-28 10:11:37,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-28 10:11:37,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-02-28 10:11:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-02-28 10:11:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-02-28 10:11:37,845 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-02-28 10:11:37,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:37,846 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-02-28 10:11:37,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-28 10:11:37,846 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-02-28 10:11:37,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-02-28 10:11:37,846 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:37,846 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-02-28 10:11:37,847 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:37,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:37,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-02-28 10:11:37,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:37,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:37,848 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:37,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:37,848 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:37,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:38,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:38,922 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:38,922 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:38,922 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:38,922 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:38,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 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-02-28 10:11:38,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:38,931 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:38,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:38,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 51 conjunts are in the unsatisfiable core [2019-02-28 10:11:38,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:38,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:38,978 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:42,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:42,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:42,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-02-28 10:11:42,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:42,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-02-28 10:11:42,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-02-28 10:11:42,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:11:42,222 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-02-28 10:11:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:42,282 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-28 10:11:42,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-28 10:11:42,282 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-02-28 10:11:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:42,283 INFO L225 Difference]: With dead ends: 56 [2019-02-28 10:11:42,283 INFO L226 Difference]: Without dead ends: 54 [2019-02-28 10:11:42,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-02-28 10:11:42,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-02-28 10:11:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-02-28 10:11:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-28 10:11:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-28 10:11:42,287 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-02-28 10:11:42,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:42,287 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-28 10:11:42,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-02-28 10:11:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-28 10:11:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-28 10:11:42,287 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:42,287 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-02-28 10:11:42,288 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:42,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:42,288 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-02-28 10:11:42,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:42,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:42,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:42,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:42,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:43,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:43,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:43,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:43,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:43,324 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:43,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:43,324 INFO 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-02-28 10:11:43,334 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:43,334 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:43,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-02-28 10:11:43,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:43,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 52 conjunts are in the unsatisfiable core [2019-02-28 10:11:43,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:43,526 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:46,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:46,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-02-28 10:11:46,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:46,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-28 10:11:46,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-28 10:11:46,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-02-28 10:11:46,702 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-02-28 10:11:46,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:46,852 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-02-28 10:11:46,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-28 10:11:46,852 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-02-28 10:11:46,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:46,853 INFO L225 Difference]: With dead ends: 57 [2019-02-28 10:11:46,853 INFO L226 Difference]: Without dead ends: 55 [2019-02-28 10:11:46,854 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-02-28 10:11:46,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-28 10:11:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-02-28 10:11:46,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-02-28 10:11:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-02-28 10:11:46,856 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-02-28 10:11:46,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:46,856 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-02-28 10:11:46,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-28 10:11:46,856 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-02-28 10:11:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-02-28 10:11:46,857 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:46,857 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-02-28 10:11:46,857 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:46,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:46,858 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-02-28 10:11:46,858 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:46,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:46,858 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:46,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:46,859 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:47,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:47,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:47,948 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:47,948 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:47,948 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:47,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:47,948 INFO 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-02-28 10:11:47,961 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:11:47,961 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:11:47,994 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:11:47,994 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:47,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 53 conjunts are in the unsatisfiable core [2019-02-28 10:11:47,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:48,009 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:50,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:50,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-02-28 10:11:50,913 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:50,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-02-28 10:11:50,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-02-28 10:11:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:11:50,915 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-02-28 10:11:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:51,068 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-28 10:11:51,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-28 10:11:51,069 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-02-28 10:11:51,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:51,069 INFO L225 Difference]: With dead ends: 58 [2019-02-28 10:11:51,069 INFO L226 Difference]: Without dead ends: 56 [2019-02-28 10:11:51,070 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-02-28 10:11:51,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-02-28 10:11:51,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-02-28 10:11:51,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-28 10:11:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-28 10:11:51,072 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-02-28 10:11:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:51,072 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-28 10:11:51,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-02-28 10:11:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-28 10:11:51,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-28 10:11:51,073 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:51,073 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-02-28 10:11:51,073 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:51,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:51,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-02-28 10:11:51,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:51,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:11:51,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:51,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:52,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:52,198 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:52,198 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:52,198 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:52,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:52,198 INFO 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-02-28 10:11:52,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:52,207 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:11:52,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:52,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 54 conjunts are in the unsatisfiable core [2019-02-28 10:11:52,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:52,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:52,267 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:55,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:55,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-02-28 10:11:55,207 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:55,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-28 10:11:55,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-28 10:11:55,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-28 10:11:55,208 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-02-28 10:11:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:11:55,304 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-02-28 10:11:55,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-28 10:11:55,305 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-02-28 10:11:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:11:55,306 INFO L225 Difference]: With dead ends: 59 [2019-02-28 10:11:55,306 INFO L226 Difference]: Without dead ends: 57 [2019-02-28 10:11:55,307 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-02-28 10:11:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-28 10:11:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-02-28 10:11:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-02-28 10:11:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-02-28 10:11:55,309 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-02-28 10:11:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:11:55,309 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-02-28 10:11:55,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-28 10:11:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-02-28 10:11:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-02-28 10:11:55,310 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:11:55,310 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-02-28 10:11:55,310 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:11:55,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:11:55,311 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-02-28 10:11:55,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:11:55,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:55,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:11:55,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:11:55,312 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:11:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:11:56,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:56,735 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:56,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:11:56,736 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:11:56,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:11:56,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:11:56,736 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:11:56,745 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:11:56,745 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:11:56,972 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-02-28 10:11:56,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:11:56,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 55 conjunts are in the unsatisfiable core [2019-02-28 10:11:56,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:11:56,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:56,985 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:11:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:11:59,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:11:59,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-02-28 10:11:59,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:11:59,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-02-28 10:11:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-02-28 10:11:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:11:59,970 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-02-28 10:12:00,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:00,049 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-28 10:12:00,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-28 10:12:00,050 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-02-28 10:12:00,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:00,050 INFO L225 Difference]: With dead ends: 60 [2019-02-28 10:12:00,051 INFO L226 Difference]: Without dead ends: 58 [2019-02-28 10:12:00,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-02-28 10:12:00,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-02-28 10:12:00,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-02-28 10:12:00,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-28 10:12:00,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-28 10:12:00,053 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-02-28 10:12:00,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:00,054 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-28 10:12:00,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-02-28 10:12:00,054 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-28 10:12:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-28 10:12:00,054 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:00,054 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-02-28 10:12:00,054 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:00,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:00,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-02-28 10:12:00,055 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:00,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:00,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:00,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:00,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:01,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:01,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:01,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:01,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:01,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:01,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:01,430 INFO 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-02-28 10:12:01,439 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:01,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:01,474 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:01,474 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:01,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 56 conjunts are in the unsatisfiable core [2019-02-28 10:12:01,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:01,485 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:04,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:04,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:04,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-02-28 10:12:04,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:04,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-28 10:12:04,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-28 10:12:04,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:12:04,581 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-02-28 10:12:04,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:04,672 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-02-28 10:12:04,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-28 10:12:04,672 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-02-28 10:12:04,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:04,673 INFO L225 Difference]: With dead ends: 61 [2019-02-28 10:12:04,673 INFO L226 Difference]: Without dead ends: 59 [2019-02-28 10:12:04,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-02-28 10:12:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-28 10:12:04,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-02-28 10:12:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-02-28 10:12:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-02-28 10:12:04,675 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-02-28 10:12:04,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:04,675 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-02-28 10:12:04,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-28 10:12:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-02-28 10:12:04,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-02-28 10:12:04,676 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:04,676 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-02-28 10:12:04,676 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:04,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:04,677 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-02-28 10:12:04,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:04,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:04,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:04,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:04,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:05,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:05,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:05,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:05,871 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:05,871 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:05,871 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:05,871 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:12:05,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:05,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:05,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 57 conjunts are in the unsatisfiable core [2019-02-28 10:12:05,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:05,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:05,925 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:09,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:09,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:09,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-02-28 10:12:09,548 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:09,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-02-28 10:12:09,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-02-28 10:12:09,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:12:09,550 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-02-28 10:12:09,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:09,663 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-28 10:12:09,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-28 10:12:09,663 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-02-28 10:12:09,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:09,664 INFO L225 Difference]: With dead ends: 62 [2019-02-28 10:12:09,664 INFO L226 Difference]: Without dead ends: 60 [2019-02-28 10:12:09,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-02-28 10:12:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-02-28 10:12:09,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-02-28 10:12:09,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-28 10:12:09,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-28 10:12:09,667 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-02-28 10:12:09,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:09,667 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-28 10:12:09,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-02-28 10:12:09,667 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-28 10:12:09,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-28 10:12:09,668 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:09,668 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-02-28 10:12:09,668 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:09,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:09,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-02-28 10:12:09,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:09,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:09,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:09,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:09,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:10,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:10,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:10,890 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:10,891 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:10,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:10,891 INFO 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-02-28 10:12:10,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:10,900 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:11,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-02-28 10:12:11,139 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:11,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 58 conjunts are in the unsatisfiable core [2019-02-28 10:12:11,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:11,151 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:14,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:14,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-02-28 10:12:14,897 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:14,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-28 10:12:14,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-28 10:12:14,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:12:14,898 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-02-28 10:12:14,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:14,973 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-02-28 10:12:14,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-28 10:12:14,974 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-02-28 10:12:14,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:14,974 INFO L225 Difference]: With dead ends: 63 [2019-02-28 10:12:14,975 INFO L226 Difference]: Without dead ends: 61 [2019-02-28 10:12:14,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-02-28 10:12:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-28 10:12:14,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-02-28 10:12:14,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-02-28 10:12:14,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-02-28 10:12:14,978 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-02-28 10:12:14,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:14,978 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-02-28 10:12:14,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-28 10:12:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-02-28 10:12:14,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-02-28 10:12:14,979 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:14,979 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-02-28 10:12:14,980 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:14,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:14,980 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-02-28 10:12:14,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:14,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:14,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:14,981 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:16,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:16,341 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:16,341 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:16,341 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:16,341 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:16,341 INFO 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-02-28 10:12:16,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:16,359 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:16,394 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:16,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:16,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 59 conjunts are in the unsatisfiable core [2019-02-28 10:12:16,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:16,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:16,406 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:20,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:20,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:20,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-02-28 10:12:20,095 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:20,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-02-28 10:12:20,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-02-28 10:12:20,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:12:20,097 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-02-28 10:12:20,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:20,204 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-28 10:12:20,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-28 10:12:20,204 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-02-28 10:12:20,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:20,205 INFO L225 Difference]: With dead ends: 64 [2019-02-28 10:12:20,205 INFO L226 Difference]: Without dead ends: 62 [2019-02-28 10:12:20,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-02-28 10:12:20,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-02-28 10:12:20,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-02-28 10:12:20,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-28 10:12:20,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-28 10:12:20,209 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-02-28 10:12:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:20,209 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-28 10:12:20,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-02-28 10:12:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-28 10:12:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-28 10:12:20,210 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:20,210 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-02-28 10:12:20,210 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:20,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:20,210 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-02-28 10:12:20,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:20,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:20,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:20,211 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:20,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:21,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:21,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:21,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:21,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:21,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:21,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:21,831 INFO 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-02-28 10:12:21,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:21,842 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:21,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 60 conjunts are in the unsatisfiable core [2019-02-28 10:12:21,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:21,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:21,895 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:25,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:25,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-02-28 10:12:25,604 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:25,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-28 10:12:25,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-28 10:12:25,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:12:25,605 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-02-28 10:12:25,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:25,695 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-02-28 10:12:25,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-28 10:12:25,695 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-02-28 10:12:25,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:25,696 INFO L225 Difference]: With dead ends: 65 [2019-02-28 10:12:25,696 INFO L226 Difference]: Without dead ends: 63 [2019-02-28 10:12:25,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-02-28 10:12:25,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-28 10:12:25,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-02-28 10:12:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-02-28 10:12:25,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-02-28 10:12:25,700 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-02-28 10:12:25,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:25,700 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-02-28 10:12:25,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-28 10:12:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-02-28 10:12:25,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-02-28 10:12:25,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:25,701 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-02-28 10:12:25,701 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:25,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:25,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-02-28 10:12:25,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:25,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:25,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:25,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:25,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:29,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:29,831 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:29,831 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:29,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:29,832 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:29,832 INFO 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-02-28 10:12:29,840 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:29,840 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:30,138 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-02-28 10:12:30,138 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:30,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 61 conjunts are in the unsatisfiable core [2019-02-28 10:12:30,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:30,153 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:34,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:34,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-02-28 10:12:34,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:34,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-02-28 10:12:34,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-02-28 10:12:34,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:12:34,145 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-02-28 10:12:34,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:34,222 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-28 10:12:34,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-28 10:12:34,223 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-02-28 10:12:34,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:34,223 INFO L225 Difference]: With dead ends: 66 [2019-02-28 10:12:34,223 INFO L226 Difference]: Without dead ends: 64 [2019-02-28 10:12:34,224 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-02-28 10:12:34,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-02-28 10:12:34,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-02-28 10:12:34,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-28 10:12:34,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-28 10:12:34,227 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-02-28 10:12:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:34,227 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-28 10:12:34,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-02-28 10:12:34,227 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-28 10:12:34,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-28 10:12:34,227 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:34,228 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-02-28 10:12:34,228 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:34,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:34,228 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-02-28 10:12:34,228 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:34,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:34,229 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:34,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:34,229 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:34,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:35,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:35,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:35,868 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:35,868 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:35,868 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:35,868 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:35,868 INFO 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-02-28 10:12:35,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:35,877 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:35,913 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:35,913 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:35,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 62 conjunts are in the unsatisfiable core [2019-02-28 10:12:35,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:35,924 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:35,924 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:40,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:40,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-02-28 10:12:40,175 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:40,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-28 10:12:40,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-28 10:12:40,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:12:40,176 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-02-28 10:12:40,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:40,286 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-02-28 10:12:40,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-28 10:12:40,287 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-02-28 10:12:40,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:40,287 INFO L225 Difference]: With dead ends: 67 [2019-02-28 10:12:40,287 INFO L226 Difference]: Without dead ends: 65 [2019-02-28 10:12:40,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-02-28 10:12:40,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-28 10:12:40,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-02-28 10:12:40,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-02-28 10:12:40,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-02-28 10:12:40,290 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-02-28 10:12:40,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:40,290 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-02-28 10:12:40,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-28 10:12:40,290 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-02-28 10:12:40,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-02-28 10:12:40,290 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:40,290 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-02-28 10:12:40,290 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:40,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:40,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-02-28 10:12:40,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:40,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:40,291 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:40,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:40,292 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:41,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:41,970 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:41,970 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:41,970 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:41,971 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:41,971 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:41,971 INFO 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-02-28 10:12:41,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:41,980 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:12:42,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:42,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 63 conjunts are in the unsatisfiable core [2019-02-28 10:12:42,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:42,031 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:46,188 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:46,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:46,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-02-28 10:12:46,206 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:46,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-02-28 10:12:46,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-02-28 10:12:46,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:12:46,208 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-02-28 10:12:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:46,338 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-28 10:12:46,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-28 10:12:46,339 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-02-28 10:12:46,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:46,339 INFO L225 Difference]: With dead ends: 68 [2019-02-28 10:12:46,340 INFO L226 Difference]: Without dead ends: 66 [2019-02-28 10:12:46,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-02-28 10:12:46,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-02-28 10:12:46,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-02-28 10:12:46,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-28 10:12:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-28 10:12:46,342 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-02-28 10:12:46,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:46,343 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-28 10:12:46,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-02-28 10:12:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-28 10:12:46,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-28 10:12:46,343 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:46,343 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-02-28 10:12:46,343 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:46,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:46,344 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-02-28 10:12:46,344 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:46,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:46,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:12:46,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:46,344 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:46,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:49,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:49,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:49,632 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:49,633 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:49,633 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:49,633 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:49,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 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-02-28 10:12:49,642 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:12:49,642 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:12:49,971 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-02-28 10:12:49,972 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:49,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 64 conjunts are in the unsatisfiable core [2019-02-28 10:12:49,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:49,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:49,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:12:54,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:54,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:12:54,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-02-28 10:12:54,326 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:12:54,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-28 10:12:54,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-28 10:12:54,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:12:54,328 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-02-28 10:12:54,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:12:54,448 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-02-28 10:12:54,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-28 10:12:54,448 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-02-28 10:12:54,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:12:54,449 INFO L225 Difference]: With dead ends: 69 [2019-02-28 10:12:54,449 INFO L226 Difference]: Without dead ends: 67 [2019-02-28 10:12:54,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-02-28 10:12:54,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-28 10:12:54,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-02-28 10:12:54,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-02-28 10:12:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-02-28 10:12:54,452 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-02-28 10:12:54,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:12:54,453 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-02-28 10:12:54,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-28 10:12:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-02-28 10:12:54,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-02-28 10:12:54,453 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:12:54,453 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-02-28 10:12:54,454 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:12:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:12:54,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-02-28 10:12:54,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:12:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:54,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:12:54,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:12:54,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:12:54,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:12:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:56,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:56,807 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:12:56,807 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:12:56,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:12:56,807 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:12:56,807 INFO 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-02-28 10:12:56,817 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:12:56,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:12:56,882 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:12:56,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:12:56,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 65 conjunts are in the unsatisfiable core [2019-02-28 10:12:56,885 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:12:56,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:12:56,897 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:01,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:01,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:01,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-02-28 10:13:01,426 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:01,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-02-28 10:13:01,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-02-28 10:13:01,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:13:01,428 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-02-28 10:13:01,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:01,540 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-28 10:13:01,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-28 10:13:01,547 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-02-28 10:13:01,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:01,548 INFO L225 Difference]: With dead ends: 70 [2019-02-28 10:13:01,548 INFO L226 Difference]: Without dead ends: 68 [2019-02-28 10:13:01,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-02-28 10:13:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-02-28 10:13:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-02-28 10:13:01,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-28 10:13:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-28 10:13:01,551 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-02-28 10:13:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:01,551 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-28 10:13:01,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-02-28 10:13:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-28 10:13:01,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-28 10:13:01,552 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:01,552 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-02-28 10:13:01,552 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:01,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:01,553 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-02-28 10:13:01,553 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:01,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:01,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:01,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:01,554 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:03,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:03,366 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:03,366 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:03,366 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:03,366 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:03,366 INFO 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-02-28 10:13:03,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:03,376 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:03,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:03,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 66 conjunts are in the unsatisfiable core [2019-02-28 10:13:03,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:03,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:03,433 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:09,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:09,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:09,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-02-28 10:13:09,052 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:09,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-28 10:13:09,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-28 10:13:09,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-28 10:13:09,054 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-02-28 10:13:09,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:09,146 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-02-28 10:13:09,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-28 10:13:09,146 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-02-28 10:13:09,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:09,147 INFO L225 Difference]: With dead ends: 71 [2019-02-28 10:13:09,147 INFO L226 Difference]: Without dead ends: 69 [2019-02-28 10:13:09,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-02-28 10:13:09,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-28 10:13:09,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-02-28 10:13:09,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-02-28 10:13:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-02-28 10:13:09,150 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-02-28 10:13:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:09,151 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-02-28 10:13:09,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-28 10:13:09,151 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-02-28 10:13:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-02-28 10:13:09,151 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:09,151 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-02-28 10:13:09,151 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:09,152 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-02-28 10:13:09,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:09,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:09,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:09,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:09,152 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:11,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:11,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:11,286 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:11,286 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:11,286 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:11,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:11,286 INFO 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-02-28 10:13:11,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:11,295 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:11,702 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-02-28 10:13:11,702 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:11,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 67 conjunts are in the unsatisfiable core [2019-02-28 10:13:11,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:11,717 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:16,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:16,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:16,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-02-28 10:13:16,567 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:16,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-02-28 10:13:16,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-02-28 10:13:16,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:13:16,568 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-02-28 10:13:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:16,677 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-28 10:13:16,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-28 10:13:16,678 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-02-28 10:13:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:16,678 INFO L225 Difference]: With dead ends: 72 [2019-02-28 10:13:16,678 INFO L226 Difference]: Without dead ends: 70 [2019-02-28 10:13:16,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-02-28 10:13:16,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-02-28 10:13:16,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-02-28 10:13:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-28 10:13:16,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-28 10:13:16,681 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-02-28 10:13:16,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:16,681 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-28 10:13:16,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-02-28 10:13:16,681 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-28 10:13:16,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-28 10:13:16,682 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:16,682 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-02-28 10:13:16,682 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:16,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:16,682 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-02-28 10:13:16,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:16,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:16,683 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:16,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:16,683 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:16,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:18,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:18,564 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:18,564 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:18,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:18,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:18,564 INFO 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-02-28 10:13:18,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:18,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:18,615 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:18,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:18,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 68 conjunts are in the unsatisfiable core [2019-02-28 10:13:18,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:18,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:18,634 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:23,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:23,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:23,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-02-28 10:13:23,701 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:23,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-28 10:13:23,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-28 10:13:23,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:13:23,703 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-02-28 10:13:23,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:23,995 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-02-28 10:13:23,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-28 10:13:23,996 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-02-28 10:13:23,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:23,996 INFO L225 Difference]: With dead ends: 73 [2019-02-28 10:13:23,996 INFO L226 Difference]: Without dead ends: 71 [2019-02-28 10:13:23,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-02-28 10:13:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-28 10:13:23,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-02-28 10:13:23,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-02-28 10:13:23,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-02-28 10:13:23,999 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-02-28 10:13:23,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:23,999 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-02-28 10:13:23,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-28 10:13:23,999 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-02-28 10:13:24,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-02-28 10:13:24,000 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:24,000 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-02-28 10:13:24,000 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:24,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:24,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-02-28 10:13:24,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:24,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:24,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:24,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:24,001 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:25,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:25,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:25,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:25,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:25,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:25,654 INFO 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-02-28 10:13:25,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:25,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:25,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 69 conjunts are in the unsatisfiable core [2019-02-28 10:13:25,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:25,715 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:25,716 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:30,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:30,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:30,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-02-28 10:13:30,660 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:30,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-02-28 10:13:30,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-02-28 10:13:30,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:13:30,661 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-02-28 10:13:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:30,753 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-28 10:13:30,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-28 10:13:30,754 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-02-28 10:13:30,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:30,755 INFO L225 Difference]: With dead ends: 74 [2019-02-28 10:13:30,755 INFO L226 Difference]: Without dead ends: 72 [2019-02-28 10:13:30,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-02-28 10:13:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-02-28 10:13:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-02-28 10:13:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-28 10:13:30,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-28 10:13:30,759 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-02-28 10:13:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:30,759 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-28 10:13:30,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-02-28 10:13:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-28 10:13:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-28 10:13:30,760 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:30,760 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-02-28 10:13:30,760 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-02-28 10:13:30,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:30,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:30,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:30,761 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:32,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:32,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:32,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:32,457 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:32,457 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:32,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:32,457 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:13:32,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:32,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:32,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-02-28 10:13:32,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:32,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 70 conjunts are in the unsatisfiable core [2019-02-28 10:13:32,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:32,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:32,928 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:38,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:38,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:38,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-02-28 10:13:38,051 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:38,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-28 10:13:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-28 10:13:38,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:13:38,052 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-02-28 10:13:38,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:38,254 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-02-28 10:13:38,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-28 10:13:38,254 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-02-28 10:13:38,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:38,254 INFO L225 Difference]: With dead ends: 75 [2019-02-28 10:13:38,254 INFO L226 Difference]: Without dead ends: 73 [2019-02-28 10:13:38,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-02-28 10:13:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-28 10:13:38,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-02-28 10:13:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-02-28 10:13:38,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-02-28 10:13:38,257 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-02-28 10:13:38,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:38,257 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-02-28 10:13:38,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-28 10:13:38,257 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-02-28 10:13:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-02-28 10:13:38,258 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:38,258 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-02-28 10:13:38,258 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:38,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:38,258 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-02-28 10:13:38,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:38,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:38,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:38,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:38,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:38,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:40,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:40,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:40,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:40,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:40,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:40,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:13:40,377 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:13:40,377 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:13:40,432 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:13:40,432 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:40,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 71 conjunts are in the unsatisfiable core [2019-02-28 10:13:40,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:40,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:40,447 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:45,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:45,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-02-28 10:13:45,725 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:45,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-02-28 10:13:45,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-02-28 10:13:45,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:13:45,726 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-02-28 10:13:45,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:45,907 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-28 10:13:45,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-02-28 10:13:45,908 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-02-28 10:13:45,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:45,908 INFO L225 Difference]: With dead ends: 76 [2019-02-28 10:13:45,908 INFO L226 Difference]: Without dead ends: 74 [2019-02-28 10:13:45,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-02-28 10:13:45,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-02-28 10:13:45,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-02-28 10:13:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-28 10:13:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-28 10:13:45,913 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-02-28 10:13:45,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:45,913 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-28 10:13:45,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-02-28 10:13:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-28 10:13:45,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-28 10:13:45,914 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:45,914 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-02-28 10:13:45,914 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:45,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:45,915 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-02-28 10:13:45,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:45,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:45,915 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:13:45,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:45,916 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:47,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:47,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:47,711 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:47,711 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:47,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:47,711 INFO 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-02-28 10:13:47,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:47,719 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:13:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:47,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 72 conjunts are in the unsatisfiable core [2019-02-28 10:13:47,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:47,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:47,778 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:13:53,281 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:53,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:13:53,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-02-28 10:13:53,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:13:53,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-28 10:13:53,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-28 10:13:53,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-28 10:13:53,301 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-02-28 10:13:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:13:53,499 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-02-28 10:13:53,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-02-28 10:13:53,499 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-02-28 10:13:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:13:53,499 INFO L225 Difference]: With dead ends: 77 [2019-02-28 10:13:53,499 INFO L226 Difference]: Without dead ends: 75 [2019-02-28 10:13:53,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-02-28 10:13:53,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-28 10:13:53,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-02-28 10:13:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-02-28 10:13:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-02-28 10:13:53,503 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-02-28 10:13:53,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:13:53,503 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-02-28 10:13:53,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-28 10:13:53,503 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-02-28 10:13:53,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-02-28 10:13:53,504 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:13:53,504 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-02-28 10:13:53,504 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:13:53,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:13:53,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-02-28 10:13:53,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:13:53,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:53,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:13:53,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:13:53,505 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:13:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:13:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:55,589 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:55,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:13:55,590 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:13:55,590 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:13:55,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:13:55,590 INFO 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-02-28 10:13:55,598 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:13:55,598 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:13:56,134 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-02-28 10:13:56,134 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:13:56,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 73 conjunts are in the unsatisfiable core [2019-02-28 10:13:56,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:13:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:13:56,163 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:01,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:01,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-02-28 10:14:01,832 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:01,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-02-28 10:14:01,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-02-28 10:14:01,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:14:01,834 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-02-28 10:14:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:01,972 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-28 10:14:01,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-02-28 10:14:01,972 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-02-28 10:14:01,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:01,973 INFO L225 Difference]: With dead ends: 78 [2019-02-28 10:14:01,973 INFO L226 Difference]: Without dead ends: 76 [2019-02-28 10:14:01,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-02-28 10:14:01,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-02-28 10:14:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-02-28 10:14:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-28 10:14:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-28 10:14:01,977 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-02-28 10:14:01,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:01,977 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-28 10:14:01,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-02-28 10:14:01,977 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-28 10:14:01,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-28 10:14:01,978 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:01,978 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-02-28 10:14:01,978 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:01,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:01,978 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-02-28 10:14:01,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:01,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:01,979 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:01,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:01,979 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:03,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:03,987 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:03,987 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:03,987 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:03,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:03,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 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-02-28 10:14:03,996 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:03,996 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:04,042 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:04,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:04,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 74 conjunts are in the unsatisfiable core [2019-02-28 10:14:04,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:04,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:04,062 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:10,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:10,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-02-28 10:14:10,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:10,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-28 10:14:10,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-28 10:14:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:14:10,144 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-02-28 10:14:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:10,288 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-02-28 10:14:10,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-02-28 10:14:10,288 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-02-28 10:14:10,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:10,289 INFO L225 Difference]: With dead ends: 79 [2019-02-28 10:14:10,289 INFO L226 Difference]: Without dead ends: 77 [2019-02-28 10:14:10,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-02-28 10:14:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-28 10:14:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-02-28 10:14:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-02-28 10:14:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-02-28 10:14:10,292 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-02-28 10:14:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:10,292 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-02-28 10:14:10,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-28 10:14:10,292 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-02-28 10:14:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-02-28 10:14:10,293 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:10,293 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-02-28 10:14:10,294 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:10,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-02-28 10:14:10,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:10,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:10,295 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:10,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:10,295 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:12,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:12,578 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:12,578 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:12,578 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:12,578 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:12,578 INFO 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-02-28 10:14:12,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:12,587 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:12,633 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 75 conjunts are in the unsatisfiable core [2019-02-28 10:14:12,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:12,649 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:18,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:18,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:18,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-02-28 10:14:18,413 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:18,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-02-28 10:14:18,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-02-28 10:14:18,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:14:18,414 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-02-28 10:14:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:18,566 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-28 10:14:18,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-02-28 10:14:18,566 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-02-28 10:14:18,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:18,567 INFO L225 Difference]: With dead ends: 80 [2019-02-28 10:14:18,567 INFO L226 Difference]: Without dead ends: 78 [2019-02-28 10:14:18,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-02-28 10:14:18,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-02-28 10:14:18,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-02-28 10:14:18,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-28 10:14:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-28 10:14:18,570 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-02-28 10:14:18,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:18,570 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-28 10:14:18,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-02-28 10:14:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-28 10:14:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-28 10:14:18,571 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:18,571 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-02-28 10:14:18,571 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:18,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:18,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-02-28 10:14:18,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:18,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:18,572 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:20,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:20,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:20,958 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:20,958 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:20,958 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:20,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:20,958 INFO 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-02-28 10:14:20,967 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:14:20,967 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:14:21,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-02-28 10:14:21,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:21,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 76 conjunts are in the unsatisfiable core [2019-02-28 10:14:21,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:21,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:21,583 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:27,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:27,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:27,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-02-28 10:14:27,647 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:27,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-28 10:14:27,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-28 10:14:27,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:14:27,649 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-02-28 10:14:27,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:27,755 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-02-28 10:14:27,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-02-28 10:14:27,756 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-02-28 10:14:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:27,757 INFO L225 Difference]: With dead ends: 81 [2019-02-28 10:14:27,757 INFO L226 Difference]: Without dead ends: 79 [2019-02-28 10:14:27,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-02-28 10:14:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-28 10:14:27,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-02-28 10:14:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-02-28 10:14:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-02-28 10:14:27,761 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-02-28 10:14:27,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:27,762 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-02-28 10:14:27,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-28 10:14:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-02-28 10:14:27,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-02-28 10:14:27,762 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:27,762 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-02-28 10:14:27,763 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:27,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:27,763 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-02-28 10:14:27,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:27,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:27,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:27,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:27,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:27,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:30,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:30,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:30,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:30,126 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:30,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:30,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:30,126 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:14:30,134 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:30,134 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:30,181 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:30,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:30,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 77 conjunts are in the unsatisfiable core [2019-02-28 10:14:30,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:30,197 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:30,197 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:36,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:36,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-02-28 10:14:36,479 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:36,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-02-28 10:14:36,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-02-28 10:14:36,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:14:36,480 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-02-28 10:14:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:36,594 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-28 10:14:36,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-02-28 10:14:36,595 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-02-28 10:14:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:36,596 INFO L225 Difference]: With dead ends: 82 [2019-02-28 10:14:36,596 INFO L226 Difference]: Without dead ends: 80 [2019-02-28 10:14:36,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-02-28 10:14:36,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-02-28 10:14:36,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-02-28 10:14:36,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-28 10:14:36,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-28 10:14:36,599 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-02-28 10:14:36,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:36,599 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-28 10:14:36,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-02-28 10:14:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-28 10:14:36,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-28 10:14:36,599 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:36,600 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-02-28 10:14:36,600 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:36,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:36,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-02-28 10:14:36,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:36,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:36,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:36,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:36,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:38,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:38,661 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:38,661 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:38,662 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:38,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:38,662 INFO 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-02-28 10:14:38,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:38,670 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:14:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:38,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 78 conjunts are in the unsatisfiable core [2019-02-28 10:14:38,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:38,731 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:38,731 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:45,656 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:45,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:45,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-02-28 10:14:45,674 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:45,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-28 10:14:45,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-28 10:14:45,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:14:45,676 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-02-28 10:14:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:46,043 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-02-28 10:14:46,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-02-28 10:14:46,043 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-02-28 10:14:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:46,044 INFO L225 Difference]: With dead ends: 83 [2019-02-28 10:14:46,044 INFO L226 Difference]: Without dead ends: 81 [2019-02-28 10:14:46,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-02-28 10:14:46,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-28 10:14:46,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-02-28 10:14:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-02-28 10:14:46,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-02-28 10:14:46,047 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-02-28 10:14:46,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:46,047 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-02-28 10:14:46,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-28 10:14:46,047 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-02-28 10:14:46,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-02-28 10:14:46,047 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:46,047 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-02-28 10:14:46,047 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:46,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:46,048 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-02-28 10:14:46,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:46,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:46,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:14:46,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:46,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:46,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:48,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:48,191 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:48,191 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:48,192 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:48,192 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:48,192 INFO 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-02-28 10:14:48,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:14:48,199 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:14:48,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-02-28 10:14:48,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:48,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 79 conjunts are in the unsatisfiable core [2019-02-28 10:14:48,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:48,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:48,940 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:14:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:55,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:14:55,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-02-28 10:14:55,823 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:14:55,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-02-28 10:14:55,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-02-28 10:14:55,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:14:55,825 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-02-28 10:14:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:14:56,464 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-28 10:14:56,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-02-28 10:14:56,465 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-02-28 10:14:56,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:14:56,466 INFO L225 Difference]: With dead ends: 84 [2019-02-28 10:14:56,466 INFO L226 Difference]: Without dead ends: 82 [2019-02-28 10:14:56,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-02-28 10:14:56,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-02-28 10:14:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-02-28 10:14:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-28 10:14:56,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-28 10:14:56,469 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-02-28 10:14:56,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:14:56,470 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-28 10:14:56,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-02-28 10:14:56,470 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-28 10:14:56,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-28 10:14:56,470 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:14:56,471 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-02-28 10:14:56,471 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:14:56,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:14:56,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-02-28 10:14:56,471 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:14:56,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:56,472 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:14:56,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:14:56,472 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:14:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:14:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:58,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:58,724 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:14:58,724 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:14:58,724 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:14:58,724 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:14:58,724 INFO 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-02-28 10:14:58,733 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:14:58,733 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:14:58,790 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:14:58,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:14:58,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 80 conjunts are in the unsatisfiable core [2019-02-28 10:14:58,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:14:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:14:58,815 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:06,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:06,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:06,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-02-28 10:15:06,079 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:06,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-28 10:15:06,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-28 10:15:06,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:15:06,081 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-02-28 10:15:06,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:06,225 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-02-28 10:15:06,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-02-28 10:15:06,225 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-02-28 10:15:06,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:06,226 INFO L225 Difference]: With dead ends: 85 [2019-02-28 10:15:06,226 INFO L226 Difference]: Without dead ends: 83 [2019-02-28 10:15:06,227 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-02-28 10:15:06,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-28 10:15:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-02-28 10:15:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-02-28 10:15:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-02-28 10:15:06,230 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-02-28 10:15:06,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:06,230 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-02-28 10:15:06,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-28 10:15:06,230 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-02-28 10:15:06,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-02-28 10:15:06,231 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:06,231 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-02-28 10:15:06,231 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:06,231 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-02-28 10:15:06,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:06,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:06,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:06,232 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:08,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-02-28 10:15:08,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:08,522 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:08,522 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:08,522 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:08,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:08,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 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-02-28 10:15:08,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:08,531 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:08,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 81 conjunts are in the unsatisfiable core [2019-02-28 10:15:08,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:08,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:08,599 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:15,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:15,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:15,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-02-28 10:15:15,494 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:15,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-02-28 10:15:15,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-02-28 10:15:15,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:15:15,495 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-02-28 10:15:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:15,613 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-28 10:15:15,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-02-28 10:15:15,613 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-02-28 10:15:15,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:15,614 INFO L225 Difference]: With dead ends: 86 [2019-02-28 10:15:15,614 INFO L226 Difference]: Without dead ends: 84 [2019-02-28 10:15:15,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-02-28 10:15:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-02-28 10:15:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-02-28 10:15:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-28 10:15:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-28 10:15:15,619 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-02-28 10:15:15,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:15,619 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-28 10:15:15,619 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-02-28 10:15:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-28 10:15:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-28 10:15:15,619 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:15,619 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-02-28 10:15:15,620 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:15,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-02-28 10:15:15,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:15,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:15,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:15,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:15,621 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:18,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:18,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:18,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:18,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:18,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:18,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:18,117 INFO 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-02-28 10:15:18,126 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:18,126 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:18,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-02-28 10:15:18,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:18,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 82 conjunts are in the unsatisfiable core [2019-02-28 10:15:18,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:18,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:18,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:26,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:26,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:26,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-02-28 10:15:26,305 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:26,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-28 10:15:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-28 10:15:26,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:15:26,307 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-02-28 10:15:26,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:26,482 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-02-28 10:15:26,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-02-28 10:15:26,482 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-02-28 10:15:26,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:26,483 INFO L225 Difference]: With dead ends: 87 [2019-02-28 10:15:26,483 INFO L226 Difference]: Without dead ends: 85 [2019-02-28 10:15:26,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-02-28 10:15:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-28 10:15:26,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-02-28 10:15:26,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-02-28 10:15:26,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-02-28 10:15:26,486 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-02-28 10:15:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:26,486 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-02-28 10:15:26,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-28 10:15:26,487 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-02-28 10:15:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-02-28 10:15:26,487 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:26,487 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-02-28 10:15:26,487 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:26,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:26,488 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-02-28 10:15:26,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:26,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:26,488 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:26,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:26,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:28,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:28,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:28,835 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:28,835 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:28,836 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:28,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:28,836 INFO 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-02-28 10:15:28,846 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:15:28,846 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:15:28,896 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:15:28,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:28,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 83 conjunts are in the unsatisfiable core [2019-02-28 10:15:28,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:28,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:28,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:36,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:36,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-02-28 10:15:36,654 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:36,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-02-28 10:15:36,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-02-28 10:15:36,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-02-28 10:15:36,655 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-02-28 10:15:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:36,818 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-28 10:15:36,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-02-28 10:15:36,819 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-02-28 10:15:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:36,819 INFO L225 Difference]: With dead ends: 88 [2019-02-28 10:15:36,819 INFO L226 Difference]: Without dead ends: 86 [2019-02-28 10:15:36,820 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-02-28 10:15:36,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-02-28 10:15:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-02-28 10:15:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-28 10:15:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-28 10:15:36,822 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-02-28 10:15:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:36,823 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-28 10:15:36,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-02-28 10:15:36,823 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-28 10:15:36,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-28 10:15:36,823 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:36,823 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-02-28 10:15:36,823 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:36,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:36,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-02-28 10:15:36,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:36,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:36,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:36,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:36,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:39,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:39,222 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:39,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:39,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:39,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:39,222 INFO 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-02-28 10:15:39,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:39,232 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:15:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:39,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 84 conjunts are in the unsatisfiable core [2019-02-28 10:15:39,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:39,302 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:46,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:46,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:46,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-02-28 10:15:46,840 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:46,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-28 10:15:46,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-28 10:15:46,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:15:46,842 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-02-28 10:15:47,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:47,063 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-02-28 10:15:47,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-02-28 10:15:47,064 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-02-28 10:15:47,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:47,064 INFO L225 Difference]: With dead ends: 89 [2019-02-28 10:15:47,064 INFO L226 Difference]: Without dead ends: 87 [2019-02-28 10:15:47,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-02-28 10:15:47,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-28 10:15:47,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-02-28 10:15:47,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-02-28 10:15:47,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-02-28 10:15:47,068 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-02-28 10:15:47,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:47,068 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-02-28 10:15:47,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-28 10:15:47,068 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-02-28 10:15:47,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-02-28 10:15:47,069 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:47,069 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-02-28 10:15:47,069 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-02-28 10:15:47,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:47,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:47,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:15:47,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:47,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:15:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:49,620 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:49,620 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:15:49,621 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:15:49,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:15:49,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:15:49,621 INFO 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-02-28 10:15:49,629 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:15:49,630 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:15:50,563 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-02-28 10:15:50,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:15:50,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 85 conjunts are in the unsatisfiable core [2019-02-28 10:15:50,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:15:50,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:50,582 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:15:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:15:58,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:15:58,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-02-28 10:15:58,338 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:15:58,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-02-28 10:15:58,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-02-28 10:15:58,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:15:58,339 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-02-28 10:15:58,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:15:58,483 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-28 10:15:58,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-02-28 10:15:58,484 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-02-28 10:15:58,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:15:58,484 INFO L225 Difference]: With dead ends: 90 [2019-02-28 10:15:58,484 INFO L226 Difference]: Without dead ends: 88 [2019-02-28 10:15:58,485 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-02-28 10:15:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-02-28 10:15:58,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-02-28 10:15:58,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-28 10:15:58,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-28 10:15:58,488 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-02-28 10:15:58,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:15:58,489 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-28 10:15:58,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-02-28 10:15:58,489 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-28 10:15:58,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-28 10:15:58,489 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:15:58,489 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-02-28 10:15:58,490 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:15:58,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:15:58,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-02-28 10:15:58,490 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:15:58,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:58,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:15:58,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:15:58,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:15:58,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:01,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:01,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:01,068 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:01,068 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:01,068 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:01,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:01,069 INFO 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-02-28 10:16:01,077 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:16:01,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:16:01,129 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:16:01,129 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:01,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 86 conjunts are in the unsatisfiable core [2019-02-28 10:16:01,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:01,145 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:01,146 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:09,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:09,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:09,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-02-28 10:16:09,131 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:09,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-28 10:16:09,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-28 10:16:09,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:16:09,133 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-02-28 10:16:09,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:09,286 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-02-28 10:16:09,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-02-28 10:16:09,286 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-02-28 10:16:09,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:09,287 INFO L225 Difference]: With dead ends: 91 [2019-02-28 10:16:09,287 INFO L226 Difference]: Without dead ends: 89 [2019-02-28 10:16:09,288 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-02-28 10:16:09,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-28 10:16:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-02-28 10:16:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-02-28 10:16:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-02-28 10:16:09,292 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-02-28 10:16:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:09,292 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-02-28 10:16:09,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-28 10:16:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-02-28 10:16:09,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-02-28 10:16:09,293 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:09,293 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-02-28 10:16:09,295 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:09,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:09,295 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-02-28 10:16:09,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:09,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:09,296 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:09,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:09,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:12,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:12,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:12,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:12,052 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:12,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:12,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:12,052 INFO 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-02-28 10:16:12,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:12,064 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:16:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:12,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 87 conjunts are in the unsatisfiable core [2019-02-28 10:16:12,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:12,129 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:20,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:20,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-02-28 10:16:20,025 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:20,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-02-28 10:16:20,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-02-28 10:16:20,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:16:20,027 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-02-28 10:16:20,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:20,369 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-28 10:16:20,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-02-28 10:16:20,369 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-02-28 10:16:20,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:20,370 INFO L225 Difference]: With dead ends: 92 [2019-02-28 10:16:20,370 INFO L226 Difference]: Without dead ends: 90 [2019-02-28 10:16:20,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-02-28 10:16:20,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-02-28 10:16:20,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-02-28 10:16:20,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-28 10:16:20,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-28 10:16:20,373 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-02-28 10:16:20,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:20,373 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-28 10:16:20,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-02-28 10:16:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-28 10:16:20,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-28 10:16:20,374 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:20,374 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-02-28 10:16:20,375 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:20,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:20,375 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-02-28 10:16:20,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:20,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:20,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:20,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:20,376 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:23,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:23,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:23,246 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:23,247 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:23,247 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:23,247 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:23,247 INFO 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-02-28 10:16:23,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:16:23,257 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:16:24,278 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-02-28 10:16:24,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:24,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 88 conjunts are in the unsatisfiable core [2019-02-28 10:16:24,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:24,297 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:32,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:32,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-02-28 10:16:32,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:32,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-28 10:16:32,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-28 10:16:32,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:16:32,426 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-02-28 10:16:32,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:32,741 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-02-28 10:16:32,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-02-28 10:16:32,742 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-02-28 10:16:32,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:32,742 INFO L225 Difference]: With dead ends: 93 [2019-02-28 10:16:32,742 INFO L226 Difference]: Without dead ends: 91 [2019-02-28 10:16:32,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-02-28 10:16:32,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-28 10:16:32,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-02-28 10:16:32,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-02-28 10:16:32,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-02-28 10:16:32,745 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-02-28 10:16:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:32,745 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-02-28 10:16:32,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-28 10:16:32,745 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-02-28 10:16:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-02-28 10:16:32,746 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:32,746 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-02-28 10:16:32,746 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:32,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:32,746 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-02-28 10:16:32,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:32,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:32,747 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:32,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:32,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:32,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:35,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:35,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:35,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:35,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:35,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:35,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:35,566 INFO 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-02-28 10:16:35,576 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:16:35,576 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:16:35,630 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:16:35,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:16:35,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 89 conjunts are in the unsatisfiable core [2019-02-28 10:16:35,633 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:35,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:35,648 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:43,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:43,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-02-28 10:16:43,968 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:43,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-02-28 10:16:43,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-02-28 10:16:43,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:16:43,970 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-02-28 10:16:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:44,098 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-28 10:16:44,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-02-28 10:16:44,098 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-02-28 10:16:44,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:44,099 INFO L225 Difference]: With dead ends: 94 [2019-02-28 10:16:44,099 INFO L226 Difference]: Without dead ends: 92 [2019-02-28 10:16:44,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-02-28 10:16:44,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-02-28 10:16:44,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-02-28 10:16:44,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-28 10:16:44,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-28 10:16:44,102 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-02-28 10:16:44,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:44,102 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-28 10:16:44,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-02-28 10:16:44,102 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-28 10:16:44,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-28 10:16:44,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:44,103 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-02-28 10:16:44,103 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:44,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:44,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-02-28 10:16:44,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:44,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:44,104 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:16:44,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:44,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:46,838 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:46,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:46,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:46,839 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:46,839 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:46,839 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:46,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 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-02-28 10:16:46,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:46,847 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:16:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:46,902 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 90 conjunts are in the unsatisfiable core [2019-02-28 10:16:46,903 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:16:46,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:46,918 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:16:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:55,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:16:55,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-02-28 10:16:55,700 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:16:55,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-28 10:16:55,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-28 10:16:55,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-02-28 10:16:55,702 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-02-28 10:16:55,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:16:55,924 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-02-28 10:16:55,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-02-28 10:16:55,924 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-02-28 10:16:55,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:16:55,925 INFO L225 Difference]: With dead ends: 95 [2019-02-28 10:16:55,925 INFO L226 Difference]: Without dead ends: 93 [2019-02-28 10:16:55,926 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-02-28 10:16:55,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-28 10:16:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-02-28 10:16:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-02-28 10:16:55,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-02-28 10:16:55,928 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-02-28 10:16:55,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:16:55,928 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-02-28 10:16:55,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-28 10:16:55,928 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-02-28 10:16:55,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-02-28 10:16:55,928 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:16:55,928 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-02-28 10:16:55,929 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:16:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:16:55,929 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-02-28 10:16:55,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:16:55,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:55,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:16:55,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:16:55,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:16:55,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:16:59,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:16:59,080 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:59,081 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:16:59,081 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:16:59,081 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:16:59,081 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:16:59,081 INFO 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-02-28 10:16:59,089 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:16:59,089 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:17:00,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-02-28 10:17:00,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:00,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 91 conjunts are in the unsatisfiable core [2019-02-28 10:17:00,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:00,314 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:00,314 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:09,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:09,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-02-28 10:17:09,218 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:09,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-02-28 10:17:09,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-02-28 10:17:09,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:17:09,220 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-02-28 10:17:09,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:09,369 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-28 10:17:09,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-02-28 10:17:09,370 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-02-28 10:17:09,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:09,371 INFO L225 Difference]: With dead ends: 96 [2019-02-28 10:17:09,371 INFO L226 Difference]: Without dead ends: 94 [2019-02-28 10:17:09,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-02-28 10:17:09,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-02-28 10:17:09,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-02-28 10:17:09,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-28 10:17:09,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-28 10:17:09,375 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-02-28 10:17:09,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:09,375 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-28 10:17:09,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-02-28 10:17:09,375 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-28 10:17:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-28 10:17:09,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:09,376 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-02-28 10:17:09,376 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:09,377 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-02-28 10:17:09,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:09,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:09,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:09,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:09,377 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:09,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:12,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:12,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:12,299 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:12,299 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:12,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:12,299 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:12,300 INFO 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-02-28 10:17:12,307 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:17:12,308 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:17:12,364 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:17:12,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:12,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 92 conjunts are in the unsatisfiable core [2019-02-28 10:17:12,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:12,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:12,381 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:21,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:21,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-02-28 10:17:21,575 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:21,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-28 10:17:21,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-28 10:17:21,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:17:21,577 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-02-28 10:17:21,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:21,820 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-02-28 10:17:21,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-02-28 10:17:21,821 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-02-28 10:17:21,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:21,821 INFO L225 Difference]: With dead ends: 97 [2019-02-28 10:17:21,821 INFO L226 Difference]: Without dead ends: 95 [2019-02-28 10:17:21,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-02-28 10:17:21,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-28 10:17:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-02-28 10:17:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-02-28 10:17:21,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-02-28 10:17:21,824 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-02-28 10:17:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:21,824 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-02-28 10:17:21,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-28 10:17:21,824 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-02-28 10:17:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-02-28 10:17:21,825 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:21,825 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-02-28 10:17:21,825 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:21,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:21,825 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-02-28 10:17:21,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:21,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:21,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:21,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:21,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:25,024 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:25,024 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:25,024 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:25,025 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:25,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:25,025 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:17:25,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:25,033 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:17:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:25,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 93 conjunts are in the unsatisfiable core [2019-02-28 10:17:25,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:25,105 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:34,131 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:34,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:34,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-02-28 10:17:34,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:34,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-02-28 10:17:34,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-02-28 10:17:34,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:17:34,151 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-02-28 10:17:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:34,370 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-28 10:17:34,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-02-28 10:17:34,371 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-02-28 10:17:34,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:34,371 INFO L225 Difference]: With dead ends: 98 [2019-02-28 10:17:34,371 INFO L226 Difference]: Without dead ends: 96 [2019-02-28 10:17:34,373 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-02-28 10:17:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-02-28 10:17:34,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-02-28 10:17:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-28 10:17:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-28 10:17:34,375 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-02-28 10:17:34,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:34,376 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-28 10:17:34,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-02-28 10:17:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-28 10:17:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-28 10:17:34,376 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:34,377 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-02-28 10:17:34,377 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:34,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-02-28 10:17:34,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:34,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:34,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:17:34,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:34,378 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:37,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:37,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:37,683 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:37,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:37,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:37,683 INFO 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-02-28 10:17:37,691 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:17:37,691 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:17:38,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-02-28 10:17:38,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:39,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 94 conjunts are in the unsatisfiable core [2019-02-28 10:17:39,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:39,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:39,016 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:17:48,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:48,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:17:48,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-02-28 10:17:48,216 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:17:48,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-28 10:17:48,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-28 10:17:48,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:17:48,218 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-02-28 10:17:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:17:48,382 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-02-28 10:17:48,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-02-28 10:17:48,383 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-02-28 10:17:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:17:48,383 INFO L225 Difference]: With dead ends: 99 [2019-02-28 10:17:48,383 INFO L226 Difference]: Without dead ends: 97 [2019-02-28 10:17:48,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-02-28 10:17:48,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-28 10:17:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-02-28 10:17:48,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-02-28 10:17:48,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-02-28 10:17:48,386 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-02-28 10:17:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:17:48,386 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-02-28 10:17:48,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-28 10:17:48,386 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-02-28 10:17:48,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-02-28 10:17:48,387 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:17:48,387 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-02-28 10:17:48,387 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:17:48,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:17:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-02-28 10:17:48,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:17:48,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:48,388 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:17:48,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:17:48,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:17:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:17:51,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:51,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:51,639 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:17:51,639 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:17:51,639 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:17:51,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:17:51,639 INFO 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-02-28 10:17:51,647 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:17:51,647 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:17:51,705 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:17:51,705 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:17:51,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 95 conjunts are in the unsatisfiable core [2019-02-28 10:17:51,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:17:51,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:17:51,722 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:01,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:01,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:01,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-02-28 10:18:01,289 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:01,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-02-28 10:18:01,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-02-28 10:18:01,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:18:01,291 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-02-28 10:18:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:01,440 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-28 10:18:01,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-02-28 10:18:01,440 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-02-28 10:18:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:01,441 INFO L225 Difference]: With dead ends: 100 [2019-02-28 10:18:01,441 INFO L226 Difference]: Without dead ends: 98 [2019-02-28 10:18:01,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-02-28 10:18:01,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-02-28 10:18:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-02-28 10:18:01,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-28 10:18:01,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-28 10:18:01,445 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-02-28 10:18:01,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:01,445 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-28 10:18:01,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-02-28 10:18:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-28 10:18:01,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-28 10:18:01,446 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:01,446 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-02-28 10:18:01,446 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:01,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:01,447 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-02-28 10:18:01,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:01,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:01,447 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:01,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:01,448 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:01,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:04,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:04,705 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:04,705 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:04,706 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:04,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:04,706 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:18:04,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:04,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:18:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:04,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 96 conjunts are in the unsatisfiable core [2019-02-28 10:18:04,774 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:04,790 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:04,790 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:13,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:13,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-02-28 10:18:13,987 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:13,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-28 10:18:13,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-28 10:18:13,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:18:13,989 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-02-28 10:18:14,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:14,140 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-02-28 10:18:14,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-02-28 10:18:14,140 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-02-28 10:18:14,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:14,141 INFO L225 Difference]: With dead ends: 101 [2019-02-28 10:18:14,141 INFO L226 Difference]: Without dead ends: 99 [2019-02-28 10:18:14,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-02-28 10:18:14,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-28 10:18:14,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-02-28 10:18:14,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-02-28 10:18:14,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-02-28 10:18:14,145 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-02-28 10:18:14,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:14,145 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-02-28 10:18:14,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-28 10:18:14,145 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-02-28 10:18:14,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-02-28 10:18:14,146 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:14,146 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-02-28 10:18:14,146 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:14,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:14,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-02-28 10:18:14,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:14,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:14,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:14,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:14,147 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:17,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:17,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:17,883 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:17,883 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:17,883 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:17,883 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-02-28 10:18:17,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:18:17,892 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:18:19,405 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-02-28 10:18:19,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:19,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 97 conjunts are in the unsatisfiable core [2019-02-28 10:18:19,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:19,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:19,426 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:29,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:29,351 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:29,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-02-28 10:18:29,352 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:29,352 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-02-28 10:18:29,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-02-28 10:18:29,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:18:29,354 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-02-28 10:18:29,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:29,517 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-28 10:18:29,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-02-28 10:18:29,518 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-02-28 10:18:29,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:29,518 INFO L225 Difference]: With dead ends: 102 [2019-02-28 10:18:29,518 INFO L226 Difference]: Without dead ends: 100 [2019-02-28 10:18:29,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-02-28 10:18:29,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-02-28 10:18:29,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-02-28 10:18:29,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-28 10:18:29,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-28 10:18:29,522 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-02-28 10:18:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:29,522 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-28 10:18:29,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-02-28 10:18:29,522 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-28 10:18:29,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-28 10:18:29,523 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:29,523 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-02-28 10:18:29,523 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:29,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:29,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-02-28 10:18:29,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:29,524 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:29,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:29,525 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:29,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:33,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:33,060 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:33,060 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:33,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:33,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:33,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:33,061 INFO 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-02-28 10:18:33,070 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:18:33,070 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:18:33,131 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:18:33,131 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:18:33,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 98 conjunts are in the unsatisfiable core [2019-02-28 10:18:33,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:33,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:33,150 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:43,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:43,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:43,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-02-28 10:18:43,440 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:43,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-28 10:18:43,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-28 10:18:43,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:18:43,441 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-02-28 10:18:43,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:43,656 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-02-28 10:18:43,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-02-28 10:18:43,657 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-02-28 10:18:43,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:43,657 INFO L225 Difference]: With dead ends: 103 [2019-02-28 10:18:43,657 INFO L226 Difference]: Without dead ends: 101 [2019-02-28 10:18:43,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-02-28 10:18:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-28 10:18:43,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-02-28 10:18:43,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-02-28 10:18:43,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-02-28 10:18:43,660 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-02-28 10:18:43,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:43,660 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-02-28 10:18:43,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-28 10:18:43,660 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-02-28 10:18:43,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-02-28 10:18:43,661 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:43,661 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-02-28 10:18:43,661 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:43,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-02-28 10:18:43,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:43,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:43,662 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:18:43,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:43,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:47,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:47,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:18:47,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:18:47,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:18:47,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:18:47,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 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-02-28 10:18:47,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:47,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:18:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:18:47,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 99 conjunts are in the unsatisfiable core [2019-02-28 10:18:47,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:18:47,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:47,274 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:18:57,605 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:18:57,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:18:57,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-02-28 10:18:57,623 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:18:57,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-02-28 10:18:57,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-02-28 10:18:57,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:18:57,626 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-02-28 10:18:57,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:18:57,919 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-28 10:18:57,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-02-28 10:18:57,919 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-02-28 10:18:57,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:18:57,920 INFO L225 Difference]: With dead ends: 104 [2019-02-28 10:18:57,920 INFO L226 Difference]: Without dead ends: 102 [2019-02-28 10:18:57,921 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-02-28 10:18:57,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-02-28 10:18:57,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-02-28 10:18:57,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-28 10:18:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-28 10:18:57,924 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-02-28 10:18:57,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:18:57,924 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-28 10:18:57,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-02-28 10:18:57,924 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-28 10:18:57,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-28 10:18:57,925 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:18:57,925 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-02-28 10:18:57,925 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:18:57,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:18:57,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-02-28 10:18:57,926 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:18:57,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:57,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:18:57,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:18:57,926 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:18:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:01,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:01,535 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:01,535 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:01,536 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:01,536 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:01,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:01,536 INFO 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-02-28 10:19:01,544 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:19:01,544 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:19:03,188 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-02-28 10:19:03,188 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:03,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 100 conjunts are in the unsatisfiable core [2019-02-28 10:19:03,194 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:03,209 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:03,209 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:13,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:13,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:13,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-02-28 10:19:13,928 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:13,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-28 10:19:13,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-28 10:19:13,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:19:13,931 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-02-28 10:19:14,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:14,183 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-02-28 10:19:14,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-02-28 10:19:14,184 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-02-28 10:19:14,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:14,184 INFO L225 Difference]: With dead ends: 105 [2019-02-28 10:19:14,184 INFO L226 Difference]: Without dead ends: 103 [2019-02-28 10:19:14,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-02-28 10:19:14,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-28 10:19:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-02-28 10:19:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-02-28 10:19:14,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-02-28 10:19:14,188 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-02-28 10:19:14,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:14,188 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-02-28 10:19:14,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-28 10:19:14,188 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-02-28 10:19:14,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-02-28 10:19:14,189 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:14,189 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-02-28 10:19:14,189 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-02-28 10:19:14,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:14,190 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:14,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:14,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:18,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:18,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:18,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:18,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:18,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:18,012 INFO 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-02-28 10:19:18,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:19:18,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:19:18,079 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:19:18,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:18,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 101 conjunts are in the unsatisfiable core [2019-02-28 10:19:18,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:18,099 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:28,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:28,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-02-28 10:19:28,852 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:28,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-02-28 10:19:28,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-02-28 10:19:28,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:19:28,854 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-02-28 10:19:29,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:29,113 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-28 10:19:29,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-02-28 10:19:29,114 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-02-28 10:19:29,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:29,114 INFO L225 Difference]: With dead ends: 106 [2019-02-28 10:19:29,114 INFO L226 Difference]: Without dead ends: 104 [2019-02-28 10:19:29,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-02-28 10:19:29,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-02-28 10:19:29,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-02-28 10:19:29,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-28 10:19:29,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-28 10:19:29,118 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-02-28 10:19:29,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:29,118 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-28 10:19:29,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-02-28 10:19:29,119 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-28 10:19:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-28 10:19:29,119 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:29,119 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-02-28 10:19:29,119 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-02-28 10:19:29,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:29,120 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:19:29,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:29,120 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:29,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:32,982 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:32,982 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:32,982 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:32,982 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:32,983 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:32,983 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:32,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 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-02-28 10:19:32,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:32,991 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:19:33,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:33,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 102 conjunts are in the unsatisfiable core [2019-02-28 10:19:33,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:33,078 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:19:44,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:44,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:19:44,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-02-28 10:19:44,274 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:19:44,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-28 10:19:44,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-28 10:19:44,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-28 10:19:44,277 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-02-28 10:19:44,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:19:44,456 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-02-28 10:19:44,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-02-28 10:19:44,456 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-02-28 10:19:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:19:44,457 INFO L225 Difference]: With dead ends: 107 [2019-02-28 10:19:44,458 INFO L226 Difference]: Without dead ends: 105 [2019-02-28 10:19:44,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-02-28 10:19:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-28 10:19:44,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-02-28 10:19:44,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-02-28 10:19:44,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-02-28 10:19:44,462 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-02-28 10:19:44,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:19:44,462 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-02-28 10:19:44,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-28 10:19:44,462 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-02-28 10:19:44,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-02-28 10:19:44,463 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:19:44,463 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-02-28 10:19:44,463 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:19:44,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:19:44,464 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-02-28 10:19:44,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:19:44,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:44,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:19:44,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:19:44,465 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:19:44,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:19:48,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:48,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:48,378 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:19:48,378 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:19:48,378 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:19:48,378 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:19:48,379 INFO 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-02-28 10:19:48,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:19:48,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:19:50,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-02-28 10:19:50,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:19:50,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 103 conjunts are in the unsatisfiable core [2019-02-28 10:19:50,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:19:50,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:19:50,330 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:01,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:01,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-02-28 10:20:01,559 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:01,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-02-28 10:20:01,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-02-28 10:20:01,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:20:01,563 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-02-28 10:20:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:01,886 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-28 10:20:01,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-02-28 10:20:01,886 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-02-28 10:20:01,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:01,887 INFO L225 Difference]: With dead ends: 108 [2019-02-28 10:20:01,887 INFO L226 Difference]: Without dead ends: 106 [2019-02-28 10:20:01,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-02-28 10:20:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-02-28 10:20:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-02-28 10:20:01,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-28 10:20:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-28 10:20:01,892 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-02-28 10:20:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:01,892 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-28 10:20:01,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-02-28 10:20:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-28 10:20:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-28 10:20:01,893 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:01,893 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-02-28 10:20:01,894 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:01,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:01,894 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-02-28 10:20:01,894 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:01,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:01,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:01,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:01,895 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:05,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:05,950 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:05,950 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:05,951 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:05,951 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:05,951 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:05,951 INFO 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-02-28 10:20:05,958 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:20:05,959 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:20:06,036 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:20:06,036 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:06,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 104 conjunts are in the unsatisfiable core [2019-02-28 10:20:06,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:06,065 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:06,065 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:17,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:17,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-02-28 10:20:17,393 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:17,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-28 10:20:17,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-28 10:20:17,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:20:17,396 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-02-28 10:20:17,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:17,680 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-02-28 10:20:17,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-02-28 10:20:17,680 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-02-28 10:20:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:17,680 INFO L225 Difference]: With dead ends: 109 [2019-02-28 10:20:17,681 INFO L226 Difference]: Without dead ends: 107 [2019-02-28 10:20:17,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-02-28 10:20:17,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-28 10:20:17,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-02-28 10:20:17,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-02-28 10:20:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-02-28 10:20:17,684 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-02-28 10:20:17,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:17,685 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-02-28 10:20:17,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-28 10:20:17,685 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-02-28 10:20:17,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-02-28 10:20:17,685 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:17,685 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-02-28 10:20:17,686 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:17,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:17,686 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-02-28 10:20:17,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:17,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:17,687 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:17,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:17,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:17,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:21,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:21,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:21,523 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:21,523 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:21,523 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:21,523 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:21,523 INFO 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-02-28 10:20:21,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:21,548 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:20:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:21,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 105 conjunts are in the unsatisfiable core [2019-02-28 10:20:21,610 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:21,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:21,628 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:33,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:33,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:33,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-02-28 10:20:33,580 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:33,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-02-28 10:20:33,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-02-28 10:20:33,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:20:33,583 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-02-28 10:20:33,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:33,808 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-28 10:20:33,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-02-28 10:20:33,808 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-02-28 10:20:33,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:33,809 INFO L225 Difference]: With dead ends: 110 [2019-02-28 10:20:33,809 INFO L226 Difference]: Without dead ends: 108 [2019-02-28 10:20:33,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-02-28 10:20:33,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-02-28 10:20:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-02-28 10:20:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-28 10:20:33,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-28 10:20:33,813 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-02-28 10:20:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:33,813 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-28 10:20:33,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-02-28 10:20:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-28 10:20:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-28 10:20:33,814 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:33,814 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-02-28 10:20:33,814 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:33,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:33,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-02-28 10:20:33,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:33,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:33,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:20:33,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:33,815 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:33,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:37,709 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:37,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:37,710 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:37,710 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:37,710 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:37,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:37,710 INFO 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-02-28 10:20:37,742 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:20:37,742 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:20:39,848 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-02-28 10:20:39,848 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:39,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 428 conjuncts, 106 conjunts are in the unsatisfiable core [2019-02-28 10:20:39,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:39,881 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:39,881 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:20:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:51,634 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:20:51,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-02-28 10:20:51,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:20:51,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-28 10:20:51,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-28 10:20:51,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-28 10:20:51,637 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-02-28 10:20:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:20:51,876 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-02-28 10:20:51,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-02-28 10:20:51,877 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-02-28 10:20:51,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:20:51,877 INFO L225 Difference]: With dead ends: 111 [2019-02-28 10:20:51,877 INFO L226 Difference]: Without dead ends: 109 [2019-02-28 10:20:51,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-02-28 10:20:51,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-28 10:20:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-02-28 10:20:51,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-02-28 10:20:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-02-28 10:20:51,882 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-02-28 10:20:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:20:51,882 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-02-28 10:20:51,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-28 10:20:51,882 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-02-28 10:20:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-02-28 10:20:51,883 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:20:51,883 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-02-28 10:20:51,883 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:20:51,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:20:51,883 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-02-28 10:20:51,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:20:51,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:51,884 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:20:51,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:20:51,884 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:20:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:20:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:56,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:56,012 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:20:56,012 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:20:56,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:20:56,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:20:56,012 INFO 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-02-28 10:20:56,021 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:20:56,021 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:20:56,087 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:20:56,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:20:56,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 107 conjunts are in the unsatisfiable core [2019-02-28 10:20:56,091 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:20:56,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:20:56,134 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:08,249 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:08,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:08,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-02-28 10:21:08,268 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:08,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-02-28 10:21:08,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-02-28 10:21:08,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-02-28 10:21:08,270 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-02-28 10:21:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:08,515 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-28 10:21:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-02-28 10:21:08,515 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-02-28 10:21:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:08,516 INFO L225 Difference]: With dead ends: 112 [2019-02-28 10:21:08,516 INFO L226 Difference]: Without dead ends: 110 [2019-02-28 10:21:08,517 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-02-28 10:21:08,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-02-28 10:21:08,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-02-28 10:21:08,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-28 10:21:08,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-28 10:21:08,520 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-02-28 10:21:08,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:08,520 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-28 10:21:08,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-02-28 10:21:08,520 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-28 10:21:08,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-28 10:21:08,521 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:08,521 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-02-28 10:21:08,521 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:08,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-02-28 10:21:08,521 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:08,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:08,522 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:08,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:08,522 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:08,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:12,648 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:12,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:12,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:12,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:12,649 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:12,649 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:12,649 INFO 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-02-28 10:21:12,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:12,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:21:12,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:12,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 108 conjunts are in the unsatisfiable core [2019-02-28 10:21:12,720 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:12,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:12,736 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:25,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:25,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-02-28 10:21:25,191 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:25,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-28 10:21:25,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-28 10:21:25,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-28 10:21:25,194 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-02-28 10:21:25,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:25,478 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-02-28 10:21:25,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-02-28 10:21:25,479 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-02-28 10:21:25,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:25,479 INFO L225 Difference]: With dead ends: 113 [2019-02-28 10:21:25,479 INFO L226 Difference]: Without dead ends: 111 [2019-02-28 10:21:25,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-02-28 10:21:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-28 10:21:25,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-02-28 10:21:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-02-28 10:21:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-02-28 10:21:25,483 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-02-28 10:21:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:25,483 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-02-28 10:21:25,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-28 10:21:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-02-28 10:21:25,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-02-28 10:21:25,484 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:25,484 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-02-28 10:21:25,484 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:25,484 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-02-28 10:21:25,484 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:25,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:25,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:21:25,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:25,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:25,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:29,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:29,565 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:29,565 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:29,565 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:29,565 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:29,565 INFO 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-02-28 10:21:29,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:21:29,574 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:21:31,986 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-02-28 10:21:31,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:31,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 109 conjunts are in the unsatisfiable core [2019-02-28 10:21:31,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:32,011 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:32,011 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:21:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:44,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:21:44,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-02-28 10:21:44,416 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:21:44,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-02-28 10:21:44,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-02-28 10:21:44,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-28 10:21:44,418 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-02-28 10:21:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:21:44,742 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-28 10:21:44,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-02-28 10:21:44,742 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-02-28 10:21:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:21:44,743 INFO L225 Difference]: With dead ends: 114 [2019-02-28 10:21:44,743 INFO L226 Difference]: Without dead ends: 112 [2019-02-28 10:21:44,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-02-28 10:21:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-02-28 10:21:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-02-28 10:21:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-28 10:21:44,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-28 10:21:44,747 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-02-28 10:21:44,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:21:44,747 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-28 10:21:44,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-02-28 10:21:44,747 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-28 10:21:44,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-28 10:21:44,748 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:21:44,748 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-02-28 10:21:44,748 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:21:44,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:21:44,748 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-02-28 10:21:44,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:21:44,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:44,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:21:44,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:21:44,749 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:21:44,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:21:49,355 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:49,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:49,356 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:21:49,356 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:21:49,356 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:21:49,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:21:49,356 INFO 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-02-28 10:21:49,364 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:21:49,364 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:21:49,428 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:21:49,428 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:21:49,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 110 conjunts are in the unsatisfiable core [2019-02-28 10:21:49,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:21:49,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:21:49,451 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:02,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:02,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:02,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-02-28 10:22:02,386 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:02,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-28 10:22:02,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-28 10:22:02,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-28 10:22:02,389 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-02-28 10:22:02,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:02,648 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-02-28 10:22:02,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-02-28 10:22:02,648 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-02-28 10:22:02,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:02,649 INFO L225 Difference]: With dead ends: 115 [2019-02-28 10:22:02,649 INFO L226 Difference]: Without dead ends: 113 [2019-02-28 10:22:02,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.4s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-02-28 10:22:02,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-28 10:22:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-02-28 10:22:02,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-02-28 10:22:02,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-02-28 10:22:02,653 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-02-28 10:22:02,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:02,653 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-02-28 10:22:02,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-28 10:22:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-02-28 10:22:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-02-28 10:22:02,654 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:02,654 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-02-28 10:22:02,654 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:02,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:02,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-02-28 10:22:02,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:02,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:02,655 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:02,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:02,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:07,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:07,153 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:07,153 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:07,153 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:07,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:07,153 INFO 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-02-28 10:22:07,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:07,161 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-28 10:22:07,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:07,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 111 conjunts are in the unsatisfiable core [2019-02-28 10:22:07,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:07,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:07,248 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:20,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:20,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:20,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-02-28 10:22:20,111 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:20,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-02-28 10:22:20,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-02-28 10:22:20,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-28 10:22:20,113 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-02-28 10:22:20,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:20,329 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-28 10:22:20,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-02-28 10:22:20,329 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-02-28 10:22:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:20,330 INFO L225 Difference]: With dead ends: 116 [2019-02-28 10:22:20,330 INFO L226 Difference]: Without dead ends: 114 [2019-02-28 10:22:20,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-02-28 10:22:20,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-02-28 10:22:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-02-28 10:22:20,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-28 10:22:20,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-28 10:22:20,334 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-02-28 10:22:20,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:20,334 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-28 10:22:20,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-02-28 10:22:20,334 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-28 10:22:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-28 10:22:20,335 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:20,335 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-02-28 10:22:20,335 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-02-28 10:22:20,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:20,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:20,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 10:22:20,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:20,337 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:24,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:24,930 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:24,930 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:24,930 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:24,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:24,930 INFO 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-02-28 10:22:24,937 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-28 10:22:24,938 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-28 10:22:27,553 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-02-28 10:22:27,554 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:27,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 112 conjunts are in the unsatisfiable core [2019-02-28 10:22:27,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:27,578 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-02-28 10:22:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:40,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-28 10:22:40,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-02-28 10:22:40,799 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-28 10:22:40,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-28 10:22:40,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-28 10:22:40,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-28 10:22:40,804 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-02-28 10:22:41,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 10:22:41,188 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-02-28 10:22:41,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-02-28 10:22:41,188 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-02-28 10:22:41,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 10:22:41,188 INFO L225 Difference]: With dead ends: 117 [2019-02-28 10:22:41,188 INFO L226 Difference]: Without dead ends: 115 [2019-02-28 10:22:41,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-02-28 10:22:41,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-28 10:22:41,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-02-28 10:22:41,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-02-28 10:22:41,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-02-28 10:22:41,193 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-02-28 10:22:41,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 10:22:41,194 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-02-28 10:22:41,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-28 10:22:41,194 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-02-28 10:22:41,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-02-28 10:22:41,194 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 10:22:41,194 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-02-28 10:22:41,195 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 10:22:41,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 10:22:41,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-02-28 10:22:41,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 10:22:41,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:41,196 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-28 10:22:41,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 10:22:41,196 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 10:22:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 10:22:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:45,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:45,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 10:22:45,643 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-28 10:22:45,643 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-28 10:22:45,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 10:22:45,643 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 112 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-28 10:22:45,652 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-28 10:22:45,652 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-28 10:22:45,718 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-28 10:22:45,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-28 10:22:45,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 113 conjunts are in the unsatisfiable core [2019-02-28 10:22:45,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-02-28 10:22:45,742 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 10:22:45,742 INFO L322 TraceCheckSpWp]: Computing backward predicates...