java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 17:52:58,438 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 17:52:58,440 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 17:52:58,452 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 17:52:58,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 17:52:58,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 17:52:58,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 17:52:58,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 17:52:58,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 17:52:58,460 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 17:52:58,461 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 17:52:58,461 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 17:52:58,462 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 17:52:58,463 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 17:52:58,465 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 17:52:58,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 17:52:58,466 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 17:52:58,468 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 17:52:58,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 17:52:58,473 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 17:52:58,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 17:52:58,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 17:52:58,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 17:52:58,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 17:52:58,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 17:52:58,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 17:52:58,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 17:52:58,482 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 17:52:58,483 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 17:52:58,484 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 17:52:58,484 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 17:52:58,485 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 17:52:58,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 17:52:58,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 17:52:58,487 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 17:52:58,488 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 17:52:58,488 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-18 17:52:58,513 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 17:52:58,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 17:52:58,514 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 17:52:58,514 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 17:52:58,514 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 17:52:58,515 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 17:52:58,515 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 17:52:58,515 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 17:52:58,515 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 17:52:58,516 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-18 17:52:58,519 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 17:52:58,519 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 17:52:58,519 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 17:52:58,520 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 17:52:58,520 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 17:52:58,521 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 17:52:58,522 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 17:52:58,523 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 17:52:58,523 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 17:52:58,523 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 17:52:58,523 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 17:52:58,523 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 17:52:58,523 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 17:52:58,524 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 17:52:58,525 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 17:52:58,525 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 17:52:58,526 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 17:52:58,527 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 17:52:58,527 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 17:52:58,527 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 17:52:58,527 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:52:58,527 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 17:52:58,528 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 17:52:58,528 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 17:52:58,528 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 17:52:58,528 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 17:52:58,528 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 17:52:58,529 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 17:52:58,529 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 17:52:58,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 17:52:58,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 17:52:58,575 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 17:52:58,577 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 17:52:58,577 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 17:52:58,578 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl [2019-01-18 17:52:58,578 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array2.i_3.bpl' [2019-01-18 17:52:58,618 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 17:52:58,620 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 17:52:58,620 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 17:52:58,620 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 17:52:58,621 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 17:52:58,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,647 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,655 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 17:52:58,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 17:52:58,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 17:52:58,656 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 17:52:58,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,668 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,669 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,672 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... [2019-01-18 17:52:58,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 17:52:58,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 17:52:58,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 17:52:58,677 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 17:52:58,678 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 17:52:58,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 17:52:58,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 17:52:58,975 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 17:52:58,975 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-18 17:52:58,976 INFO L202 PluginConnector]: Adding new model array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:52:58 BoogieIcfgContainer [2019-01-18 17:52:58,978 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 17:52:58,980 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-18 17:52:58,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-18 17:52:58,985 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-18 17:52:58,985 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 05:52:58" (1/2) ... [2019-01-18 17:52:58,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d866d26 and model type array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.01 05:52:58, skipping insertion in model container [2019-01-18 17:52:58,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array2.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 05:52:58" (2/2) ... [2019-01-18 17:52:58,989 INFO L112 eAbstractionObserver]: Analyzing ICFG array2.i_3.bpl [2019-01-18 17:52:59,001 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-18 17:52:59,011 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-18 17:52:59,031 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-18 17:52:59,072 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-18 17:52:59,073 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-18 17:52:59,073 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-18 17:52:59,073 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-18 17:52:59,073 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-18 17:52:59,074 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-18 17:52:59,074 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-18 17:52:59,074 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-18 17:52:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-18 17:52:59,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-18 17:52:59,099 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:52:59,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-18 17:52:59,102 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:52:59,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:52:59,109 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-01-18 17:52:59,112 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:52:59,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:52:59,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,169 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:52:59,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:52:59,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:52:59,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-18 17:52:59,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-18 17:52:59,271 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-18 17:52:59,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-18 17:52:59,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-18 17:52:59,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:52:59,286 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-18 17:52:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:52:59,335 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-18 17:52:59,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-18 17:52:59,337 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-18 17:52:59,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:52:59,349 INFO L225 Difference]: With dead ends: 9 [2019-01-18 17:52:59,349 INFO L226 Difference]: Without dead ends: 5 [2019-01-18 17:52:59,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-18 17:52:59,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-18 17:52:59,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-18 17:52:59,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-18 17:52:59,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-18 17:52:59,387 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-18 17:52:59,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:52:59,388 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-18 17:52:59,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-18 17:52:59,388 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-18 17:52:59,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-18 17:52:59,388 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:52:59,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-18 17:52:59,389 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:52:59,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:52:59,389 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-01-18 17:52:59,389 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:52:59,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:52:59,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:52:59,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:52:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:52:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:52:59,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:52:59,468 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:52:59,470 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-18 17:52:59,472 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-18 17:52:59,541 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-18 17:52:59,542 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 17:53:00,795 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 17:53:00,796 INFO L272 AbstractInterpreter]: Visited 4 different actions 18 times. Merged at 1 different actions 7 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-01-18 17:53:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:00,807 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-01-18 17:53:00,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:00,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:00,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:00,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:00,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:00,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:01,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2019-01-18 17:53:01,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:01,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-18 17:53:01,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-18 17:53:01,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:53:01,105 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-01-18 17:53:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:01,146 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-01-18 17:53:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-18 17:53:01,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-01-18 17:53:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:01,147 INFO L225 Difference]: With dead ends: 8 [2019-01-18 17:53:01,147 INFO L226 Difference]: Without dead ends: 6 [2019-01-18 17:53:01,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-18 17:53:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-01-18 17:53:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-01-18 17:53:01,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-01-18 17:53:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-01-18 17:53:01,151 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-01-18 17:53:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:01,151 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-01-18 17:53:01,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-18 17:53:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-01-18 17:53:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-18 17:53:01,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:01,152 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-01-18 17:53:01,153 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:01,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-01-18 17:53:01,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:01,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,324 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:01,324 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:01,324 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:01,325 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:01,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:01,325 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:01,336 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:01,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:01,349 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-01-18 17:53:01,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:01,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,354 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:01,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2019-01-18 17:53:01,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:01,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-18 17:53:01,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-18 17:53:01,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:53:01,464 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-01-18 17:53:01,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:01,516 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-01-18 17:53:01,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-18 17:53:01,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-18 17:53:01,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:01,517 INFO L225 Difference]: With dead ends: 9 [2019-01-18 17:53:01,517 INFO L226 Difference]: Without dead ends: 7 [2019-01-18 17:53:01,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-18 17:53:01,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-01-18 17:53:01,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-01-18 17:53:01,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-01-18 17:53:01,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-01-18 17:53:01,520 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-01-18 17:53:01,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:01,520 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-01-18 17:53:01,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-18 17:53:01,520 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-01-18 17:53:01,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-18 17:53:01,521 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:01,521 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-01-18 17:53:01,521 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:01,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:01,522 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-01-18 17:53:01,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:01,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:01,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:01,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:01,826 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,826 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:01,826 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:01,827 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:01,827 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:01,827 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:01,827 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:01,837 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:01,838 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:01,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:01,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:01,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:01,857 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:01,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:02,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2019-01-18 17:53:02,200 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:02,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-18 17:53:02,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-18 17:53:02,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-18 17:53:02,201 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-01-18 17:53:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:02,218 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-01-18 17:53:02,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-18 17:53:02,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-01-18 17:53:02,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:02,221 INFO L225 Difference]: With dead ends: 10 [2019-01-18 17:53:02,221 INFO L226 Difference]: Without dead ends: 8 [2019-01-18 17:53:02,222 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-01-18 17:53:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-01-18 17:53:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-01-18 17:53:02,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-01-18 17:53:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-01-18 17:53:02,225 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-01-18 17:53:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:02,225 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-01-18 17:53:02,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-18 17:53:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-01-18 17:53:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-01-18 17:53:02,226 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:02,226 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-01-18 17:53:02,226 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:02,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:02,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-01-18 17:53:02,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:02,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,228 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:02,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,228 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:02,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:02,427 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:02,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:02,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:02,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:02,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:02,429 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:02,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:02,438 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:02,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:02,448 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:02,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:02,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2019-01-18 17:53:02,712 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:02,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-18 17:53:02,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-18 17:53:02,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:53:02,714 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-01-18 17:53:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:02,738 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-01-18 17:53:02,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-18 17:53:02,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-01-18 17:53:02,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:02,738 INFO L225 Difference]: With dead ends: 11 [2019-01-18 17:53:02,739 INFO L226 Difference]: Without dead ends: 9 [2019-01-18 17:53:02,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-18 17:53:02,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-01-18 17:53:02,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-01-18 17:53:02,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-01-18 17:53:02,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-01-18 17:53:02,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-01-18 17:53:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:02,742 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-01-18 17:53:02,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-18 17:53:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-01-18 17:53:02,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-18 17:53:02,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:02,743 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-01-18 17:53:02,743 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:02,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:02,744 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-01-18 17:53:02,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:02,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:02,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:02,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:02,823 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,823 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:02,823 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:02,823 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:02,823 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:02,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:02,824 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:02,832 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:02,833 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:02,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-18 17:53:02,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:02,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:02,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:02,853 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:02,980 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:03,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2019-01-18 17:53:03,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:03,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-18 17:53:03,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-18 17:53:03,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-01-18 17:53:03,003 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-01-18 17:53:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:03,054 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-01-18 17:53:03,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-18 17:53:03,059 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-01-18 17:53:03,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:03,060 INFO L225 Difference]: With dead ends: 12 [2019-01-18 17:53:03,060 INFO L226 Difference]: Without dead ends: 10 [2019-01-18 17:53:03,060 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-01-18 17:53:03,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-01-18 17:53:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-01-18 17:53:03,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-01-18 17:53:03,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-01-18 17:53:03,063 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-01-18 17:53:03,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:03,063 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-01-18 17:53:03,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-18 17:53:03,063 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-01-18 17:53:03,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-18 17:53:03,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:03,064 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-01-18 17:53:03,064 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:03,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:03,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-01-18 17:53:03,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:03,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:03,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:03,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:03,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,453 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:03,453 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:03,453 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:03,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,454 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:03,464 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:03,464 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:03,479 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:03,480 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:03,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:03,486 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:03,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2019-01-18 17:53:03,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:03,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-18 17:53:03,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-18 17:53:03,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:53:03,657 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-01-18 17:53:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:03,693 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-01-18 17:53:03,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-18 17:53:03,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-01-18 17:53:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:03,694 INFO L225 Difference]: With dead ends: 13 [2019-01-18 17:53:03,694 INFO L226 Difference]: Without dead ends: 11 [2019-01-18 17:53:03,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-01-18 17:53:03,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-01-18 17:53:03,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-01-18 17:53:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-01-18 17:53:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-01-18 17:53:03,698 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-01-18 17:53:03,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:03,699 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-01-18 17:53:03,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-18 17:53:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-01-18 17:53:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-18 17:53:03,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:03,699 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-01-18 17:53:03,700 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:03,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:03,700 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-01-18 17:53:03,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:03,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:03,701 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:03,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:03,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:03,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:03,865 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,866 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,866 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:03,866 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:03,866 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:03,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:03,867 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:03,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:03,878 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:03,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:03,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:03,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:04,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2019-01-18 17:53:04,608 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:04,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-18 17:53:04,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-18 17:53:04,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:53:04,609 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-01-18 17:53:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:04,667 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-01-18 17:53:04,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-18 17:53:04,669 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-01-18 17:53:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:04,669 INFO L225 Difference]: With dead ends: 14 [2019-01-18 17:53:04,669 INFO L226 Difference]: Without dead ends: 12 [2019-01-18 17:53:04,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-01-18 17:53:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-01-18 17:53:04,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-01-18 17:53:04,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-01-18 17:53:04,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-01-18 17:53:04,673 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-01-18 17:53:04,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:04,673 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-01-18 17:53:04,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-18 17:53:04,673 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-01-18 17:53:04,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-18 17:53:04,674 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:04,674 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-01-18 17:53:04,674 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:04,674 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-01-18 17:53:04,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:04,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:04,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:04,675 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:04,777 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:04,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:04,778 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:04,778 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:04,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:04,778 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:04,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:04,789 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:04,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-01-18 17:53:04,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:04,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:04,829 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:05,052 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:05,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2019-01-18 17:53:05,073 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:05,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-18 17:53:05,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-18 17:53:05,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:53:05,075 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-01-18 17:53:05,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:05,116 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-01-18 17:53:05,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-18 17:53:05,117 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-01-18 17:53:05,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:05,117 INFO L225 Difference]: With dead ends: 15 [2019-01-18 17:53:05,117 INFO L226 Difference]: Without dead ends: 13 [2019-01-18 17:53:05,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-01-18 17:53:05,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-01-18 17:53:05,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-01-18 17:53:05,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-01-18 17:53:05,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-01-18 17:53:05,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-01-18 17:53:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:05,120 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-01-18 17:53:05,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-18 17:53:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-01-18 17:53:05,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-18 17:53:05,121 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:05,121 INFO L402 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-01-18 17:53:05,121 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:05,121 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-01-18 17:53:05,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:05,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:05,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:05,236 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,237 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:05,237 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:05,237 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:05,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:05,247 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:05,247 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:05,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:05,259 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:05,261 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:05,266 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,266 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:05,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2019-01-18 17:53:05,455 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:05,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-18 17:53:05,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-18 17:53:05,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:53:05,457 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-01-18 17:53:05,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:05,499 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-01-18 17:53:05,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-18 17:53:05,500 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-01-18 17:53:05,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:05,500 INFO L225 Difference]: With dead ends: 16 [2019-01-18 17:53:05,500 INFO L226 Difference]: Without dead ends: 14 [2019-01-18 17:53:05,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-01-18 17:53:05,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-01-18 17:53:05,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-01-18 17:53:05,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-01-18 17:53:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-01-18 17:53:05,504 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-01-18 17:53:05,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:05,504 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-01-18 17:53:05,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-18 17:53:05,504 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-01-18 17:53:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-18 17:53:05,504 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:05,505 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-01-18 17:53:05,505 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:05,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-01-18 17:53:05,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:05,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,506 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:05,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:05,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:05,717 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:05,717 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:05,717 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:05,717 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:05,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:05,727 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:05,741 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:05,747 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:06,059 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:06,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2019-01-18 17:53:06,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:06,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-18 17:53:06,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-18 17:53:06,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:53:06,089 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-01-18 17:53:06,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:06,119 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-01-18 17:53:06,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-18 17:53:06,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-01-18 17:53:06,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:06,120 INFO L225 Difference]: With dead ends: 17 [2019-01-18 17:53:06,120 INFO L226 Difference]: Without dead ends: 15 [2019-01-18 17:53:06,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-01-18 17:53:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-01-18 17:53:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-01-18 17:53:06,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-01-18 17:53:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-01-18 17:53:06,124 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-01-18 17:53:06,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:06,124 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-01-18 17:53:06,125 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-18 17:53:06,125 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-01-18 17:53:06,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-18 17:53:06,125 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:06,125 INFO L402 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-01-18 17:53:06,125 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:06,126 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-01-18 17:53:06,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:06,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:06,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:06,485 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:06,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:06,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:06,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:06,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:06,505 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:06,527 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-01-18 17:53:06,527 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:06,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:06,534 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:06,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2019-01-18 17:53:06,760 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:06,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-18 17:53:06,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-18 17:53:06,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:53:06,761 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-01-18 17:53:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:06,811 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-01-18 17:53:06,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-18 17:53:06,811 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-01-18 17:53:06,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:06,812 INFO L225 Difference]: With dead ends: 18 [2019-01-18 17:53:06,812 INFO L226 Difference]: Without dead ends: 16 [2019-01-18 17:53:06,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-01-18 17:53:06,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-18 17:53:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-18 17:53:06,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-18 17:53:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-01-18 17:53:06,815 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-01-18 17:53:06,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:06,815 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-01-18 17:53:06,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-18 17:53:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-01-18 17:53:06,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-18 17:53:06,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:06,816 INFO L402 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-01-18 17:53:06,816 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:06,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:06,816 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-01-18 17:53:06,817 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:06,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:06,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:06,818 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:06,946 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:06,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:06,947 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:06,947 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:06,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:06,947 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:06,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:06,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:06,997 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:06,997 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:06,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:07,005 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:07,005 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:07,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:07,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2019-01-18 17:53:07,652 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:07,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-01-18 17:53:07,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-01-18 17:53:07,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2019-01-18 17:53:07,653 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-01-18 17:53:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:07,739 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-01-18 17:53:07,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-18 17:53:07,743 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-01-18 17:53:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:07,744 INFO L225 Difference]: With dead ends: 19 [2019-01-18 17:53:07,744 INFO L226 Difference]: Without dead ends: 17 [2019-01-18 17:53:07,745 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-01-18 17:53:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-01-18 17:53:07,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-01-18 17:53:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-01-18 17:53:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-01-18 17:53:07,748 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-01-18 17:53:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:07,749 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-01-18 17:53:07,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-01-18 17:53:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-01-18 17:53:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-18 17:53:07,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:07,750 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-01-18 17:53:07,750 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:07,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-01-18 17:53:07,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:07,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:08,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,117 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:08,117 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:08,117 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:08,117 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,118 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:08,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:08,128 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:08,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:08,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:08,150 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:08,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:08,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2019-01-18 17:53:08,525 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:08,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-01-18 17:53:08,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-01-18 17:53:08,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:53:08,526 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-01-18 17:53:08,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:08,555 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-01-18 17:53:08,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-18 17:53:08,556 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-01-18 17:53:08,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:08,557 INFO L225 Difference]: With dead ends: 20 [2019-01-18 17:53:08,557 INFO L226 Difference]: Without dead ends: 18 [2019-01-18 17:53:08,558 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-01-18 17:53:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-01-18 17:53:08,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-01-18 17:53:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-01-18 17:53:08,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-01-18 17:53:08,561 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-01-18 17:53:08,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:08,561 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-01-18 17:53:08,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-01-18 17:53:08,561 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-01-18 17:53:08,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-18 17:53:08,562 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:08,562 INFO L402 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-01-18 17:53:08,562 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:08,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:08,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-01-18 17:53:08,562 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:08,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:08,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:08,563 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:08,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:08,746 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,746 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:08,746 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:08,747 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:08,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:08,747 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:08,756 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:08,756 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:08,779 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2019-01-18 17:53:08,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:08,781 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:08,788 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:09,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:09,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2019-01-18 17:53:09,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:09,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-01-18 17:53:09,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-01-18 17:53:09,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:53:09,118 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-01-18 17:53:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:09,157 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-01-18 17:53:09,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-18 17:53:09,158 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-01-18 17:53:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:09,159 INFO L225 Difference]: With dead ends: 21 [2019-01-18 17:53:09,159 INFO L226 Difference]: Without dead ends: 19 [2019-01-18 17:53:09,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-01-18 17:53:09,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-01-18 17:53:09,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-01-18 17:53:09,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-01-18 17:53:09,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-01-18 17:53:09,163 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-01-18 17:53:09,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:09,164 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-01-18 17:53:09,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-01-18 17:53:09,164 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-01-18 17:53:09,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-18 17:53:09,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:09,165 INFO L402 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-01-18 17:53:09,165 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:09,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:09,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-01-18 17:53:09,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:09,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:09,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:09,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:09,486 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:09,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:09,486 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:09,486 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:09,486 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:09,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:09,487 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:09,495 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:09,495 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:09,525 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:09,525 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:09,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:09,534 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:09,534 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:09,962 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:09,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:09,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2019-01-18 17:53:09,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:09,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-18 17:53:09,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-18 17:53:09,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:53:09,982 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-01-18 17:53:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:10,015 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-01-18 17:53:10,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-18 17:53:10,016 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-01-18 17:53:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:10,017 INFO L225 Difference]: With dead ends: 22 [2019-01-18 17:53:10,017 INFO L226 Difference]: Without dead ends: 20 [2019-01-18 17:53:10,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2019-01-18 17:53:10,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-01-18 17:53:10,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-01-18 17:53:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-18 17:53:10,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-01-18 17:53:10,021 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-01-18 17:53:10,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:10,022 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-01-18 17:53:10,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-18 17:53:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-01-18 17:53:10,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-18 17:53:10,023 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:10,023 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-01-18 17:53:10,023 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:10,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:10,023 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-01-18 17:53:10,023 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:10,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:10,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:10,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:10,024 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:10,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:10,905 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:10,905 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:10,905 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:10,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:10,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:10,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:10,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:10,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:10,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:10,951 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:11,634 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:11,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:11,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2019-01-18 17:53:11,655 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:11,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-01-18 17:53:11,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-01-18 17:53:11,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-18 17:53:11,656 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-01-18 17:53:11,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:11,683 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-01-18 17:53:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-18 17:53:11,685 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-01-18 17:53:11,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:11,685 INFO L225 Difference]: With dead ends: 23 [2019-01-18 17:53:11,685 INFO L226 Difference]: Without dead ends: 21 [2019-01-18 17:53:11,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-01-18 17:53:11,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-01-18 17:53:11,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-01-18 17:53:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-01-18 17:53:11,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-01-18 17:53:11,689 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-01-18 17:53:11,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:11,689 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-01-18 17:53:11,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-01-18 17:53:11,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-01-18 17:53:11,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-18 17:53:11,690 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:11,690 INFO L402 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-01-18 17:53:11,691 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:11,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:11,691 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-01-18 17:53:11,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:11,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:11,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:11,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:11,692 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:11,899 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:11,899 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:11,900 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:11,900 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:11,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:11,900 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:11,911 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:11,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:11,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2019-01-18 17:53:11,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:11,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:11,948 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:12,686 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:12,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:12,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2019-01-18 17:53:12,706 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:12,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-01-18 17:53:12,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-01-18 17:53:12,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:53:12,707 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-01-18 17:53:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:12,734 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-01-18 17:53:12,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-18 17:53:12,735 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-01-18 17:53:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:12,736 INFO L225 Difference]: With dead ends: 24 [2019-01-18 17:53:12,736 INFO L226 Difference]: Without dead ends: 22 [2019-01-18 17:53:12,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2019-01-18 17:53:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-18 17:53:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-18 17:53:12,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-18 17:53:12,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-01-18 17:53:12,741 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-01-18 17:53:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:12,741 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-01-18 17:53:12,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-01-18 17:53:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-01-18 17:53:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-18 17:53:12,742 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:12,742 INFO L402 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-01-18 17:53:12,742 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:12,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-01-18 17:53:12,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:12,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:12,744 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:12,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:12,744 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:12,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:13,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:13,362 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:13,362 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:13,362 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:13,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:13,363 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:13,372 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:13,372 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:13,405 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:13,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:13,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:13,423 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:13,423 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:13,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:13,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2019-01-18 17:53:13,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:13,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-18 17:53:13,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-18 17:53:13,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:53:13,908 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-01-18 17:53:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:13,947 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2019-01-18 17:53:13,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-18 17:53:13,948 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-01-18 17:53:13,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:13,949 INFO L225 Difference]: With dead ends: 25 [2019-01-18 17:53:13,949 INFO L226 Difference]: Without dead ends: 23 [2019-01-18 17:53:13,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2019-01-18 17:53:13,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-18 17:53:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-18 17:53:13,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-18 17:53:13,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-18 17:53:13,953 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-01-18 17:53:13,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:13,953 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-18 17:53:13,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-18 17:53:13,954 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-18 17:53:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-18 17:53:13,954 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:13,954 INFO L402 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-01-18 17:53:13,955 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:13,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:13,955 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-01-18 17:53:13,955 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:13,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:13,956 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:13,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:13,956 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:14,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:14,233 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:14,234 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:14,234 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:14,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:14,234 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:14,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:14,244 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:14,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:14,283 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:14,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:14,854 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:14,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:14,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2019-01-18 17:53:14,876 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:14,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-18 17:53:14,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-18 17:53:14,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:53:14,878 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-01-18 17:53:14,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:14,922 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-01-18 17:53:14,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-18 17:53:14,924 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-01-18 17:53:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:14,925 INFO L225 Difference]: With dead ends: 26 [2019-01-18 17:53:14,925 INFO L226 Difference]: Without dead ends: 24 [2019-01-18 17:53:14,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2019-01-18 17:53:14,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-01-18 17:53:14,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-01-18 17:53:14,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-18 17:53:14,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-01-18 17:53:14,928 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-01-18 17:53:14,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:14,929 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-01-18 17:53:14,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-18 17:53:14,929 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-01-18 17:53:14,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-18 17:53:14,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:14,930 INFO L402 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-01-18 17:53:14,930 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:14,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:14,930 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-01-18 17:53:14,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:14,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:14,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:14,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:14,931 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:15,235 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:15,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:15,236 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:15,236 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:15,236 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:15,236 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:15,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 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:15,246 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:15,246 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:15,293 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-01-18 17:53:15,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:15,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:15,302 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:15,303 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:16,097 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:16,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:16,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 43 [2019-01-18 17:53:16,117 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:16,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-18 17:53:16,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-18 17:53:16,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:53:16,119 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2019-01-18 17:53:16,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:16,158 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-01-18 17:53:16,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-18 17:53:16,159 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2019-01-18 17:53:16,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:16,160 INFO L225 Difference]: With dead ends: 27 [2019-01-18 17:53:16,160 INFO L226 Difference]: Without dead ends: 25 [2019-01-18 17:53:16,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2019-01-18 17:53:16,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-18 17:53:16,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-18 17:53:16,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-18 17:53:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-01-18 17:53:16,164 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2019-01-18 17:53:16,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:16,165 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-01-18 17:53:16,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-18 17:53:16,165 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-01-18 17:53:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-01-18 17:53:16,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:16,166 INFO L402 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2019-01-18 17:53:16,166 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:16,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:16,166 INFO L82 PathProgramCache]: Analyzing trace with hash -947519700, now seen corresponding path program 21 times [2019-01-18 17:53:16,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:16,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:16,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:16,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:16,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:16,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:17,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-01-18 17:53:17,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:17,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:17,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:17,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:17,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:17,270 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:17,280 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:17,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:17,300 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:17,300 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:17,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:17,310 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:17,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:17,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:17,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2019-01-18 17:53:17,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:17,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-01-18 17:53:17,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-01-18 17:53:17,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:53:17,884 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2019-01-18 17:53:17,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:17,951 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-01-18 17:53:17,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-18 17:53:17,953 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2019-01-18 17:53:17,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:17,954 INFO L225 Difference]: With dead ends: 28 [2019-01-18 17:53:17,954 INFO L226 Difference]: Without dead ends: 26 [2019-01-18 17:53:17,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2019-01-18 17:53:17,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-18 17:53:17,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-18 17:53:17,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-18 17:53:17,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-01-18 17:53:17,957 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2019-01-18 17:53:17,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:17,958 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-01-18 17:53:17,958 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-01-18 17:53:17,958 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-01-18 17:53:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-01-18 17:53:17,959 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:17,959 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2019-01-18 17:53:17,959 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:17,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:17,959 INFO L82 PathProgramCache]: Analyzing trace with hash 691662179, now seen corresponding path program 22 times [2019-01-18 17:53:17,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:17,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:17,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:17,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:17,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:18,221 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:18,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:18,221 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:18,222 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:18,222 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:18,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:18,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 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:18,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:18,230 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:18,255 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:18,262 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:18,262 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:18,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:18,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 47 [2019-01-18 17:53:18,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:18,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-01-18 17:53:18,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-01-18 17:53:18,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-18 17:53:18,915 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2019-01-18 17:53:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:18,950 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-01-18 17:53:18,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-18 17:53:18,951 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2019-01-18 17:53:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:18,952 INFO L225 Difference]: With dead ends: 29 [2019-01-18 17:53:18,952 INFO L226 Difference]: Without dead ends: 27 [2019-01-18 17:53:18,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2019-01-18 17:53:18,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-18 17:53:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-18 17:53:18,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-18 17:53:18,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-01-18 17:53:18,955 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2019-01-18 17:53:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:18,956 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-01-18 17:53:18,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-01-18 17:53:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-01-18 17:53:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-18 17:53:18,957 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:18,957 INFO L402 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2019-01-18 17:53:18,957 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:18,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:18,957 INFO L82 PathProgramCache]: Analyzing trace with hash -33307124, now seen corresponding path program 23 times [2019-01-18 17:53:18,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:18,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:18,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:18,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:18,958 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:19,262 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:19,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:19,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:19,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:19,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:19,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:19,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:19,272 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:19,272 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:19,315 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-01-18 17:53:19,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:19,317 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:19,324 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:20,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:20,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2019-01-18 17:53:20,125 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:20,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-01-18 17:53:20,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-01-18 17:53:20,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2019-01-18 17:53:20,126 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2019-01-18 17:53:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:20,172 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-01-18 17:53:20,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-01-18 17:53:20,173 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2019-01-18 17:53:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:20,173 INFO L225 Difference]: With dead ends: 30 [2019-01-18 17:53:20,174 INFO L226 Difference]: Without dead ends: 28 [2019-01-18 17:53:20,175 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-01-18 17:53:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-18 17:53:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-18 17:53:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-18 17:53:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-18 17:53:20,178 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2019-01-18 17:53:20,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:20,178 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-18 17:53:20,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-01-18 17:53:20,178 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-18 17:53:20,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-18 17:53:20,179 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:20,179 INFO L402 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-01-18 17:53:20,179 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:20,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:20,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1032519037, now seen corresponding path program 24 times [2019-01-18 17:53:20,180 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:20,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:20,180 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:20,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:20,181 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:20,623 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:20,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:20,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:20,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:20,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:20,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:20,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:20,636 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:20,636 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:20,660 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:20,661 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:20,662 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:20,670 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:21,745 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:21,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:21,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 51 [2019-01-18 17:53:21,764 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:21,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-01-18 17:53:21,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-01-18 17:53:21,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:53:21,766 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-01-18 17:53:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:21,826 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2019-01-18 17:53:21,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-18 17:53:21,830 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-01-18 17:53:21,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:21,830 INFO L225 Difference]: With dead ends: 31 [2019-01-18 17:53:21,830 INFO L226 Difference]: Without dead ends: 29 [2019-01-18 17:53:21,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2019-01-18 17:53:21,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-18 17:53:21,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-18 17:53:21,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-18 17:53:21,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-01-18 17:53:21,836 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2019-01-18 17:53:21,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:21,836 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-01-18 17:53:21,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-01-18 17:53:21,836 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-01-18 17:53:21,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-18 17:53:21,837 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:21,837 INFO L402 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-01-18 17:53:21,837 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:21,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:21,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317268, now seen corresponding path program 25 times [2019-01-18 17:53:21,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:21,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:21,839 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:21,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:21,839 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:22,291 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:22,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:22,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:22,292 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:22,292 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:22,292 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:22,292 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:22,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:22,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:22,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:22,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:22,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:24,728 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:24,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:24,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 53 [2019-01-18 17:53:24,748 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:24,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-01-18 17:53:24,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-01-18 17:53:24,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:53:24,749 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-01-18 17:53:24,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:24,818 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-01-18 17:53:24,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-01-18 17:53:24,819 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-01-18 17:53:24,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:24,819 INFO L225 Difference]: With dead ends: 32 [2019-01-18 17:53:24,819 INFO L226 Difference]: Without dead ends: 30 [2019-01-18 17:53:24,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2019-01-18 17:53:24,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-18 17:53:24,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-01-18 17:53:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-18 17:53:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-01-18 17:53:24,823 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2019-01-18 17:53:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:24,823 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-01-18 17:53:24,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-01-18 17:53:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-01-18 17:53:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-18 17:53:24,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:24,824 INFO L402 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2019-01-18 17:53:24,824 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:24,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:24,824 INFO L82 PathProgramCache]: Analyzing trace with hash -113291357, now seen corresponding path program 26 times [2019-01-18 17:53:24,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:24,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:24,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:24,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:24,825 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:25,465 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:25,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:25,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:25,466 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:25,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:25,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:25,466 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:25,475 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:25,475 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:25,525 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2019-01-18 17:53:25,526 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:25,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:25,535 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:26,580 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:26,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:26,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 55 [2019-01-18 17:53:26,599 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:26,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-01-18 17:53:26,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-01-18 17:53:26,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:53:26,600 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2019-01-18 17:53:26,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:26,814 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-18 17:53:26,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-01-18 17:53:26,815 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2019-01-18 17:53:26,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:26,815 INFO L225 Difference]: With dead ends: 33 [2019-01-18 17:53:26,816 INFO L226 Difference]: Without dead ends: 31 [2019-01-18 17:53:26,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2019-01-18 17:53:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-18 17:53:26,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2019-01-18 17:53:26,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-18 17:53:26,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2019-01-18 17:53:26,821 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2019-01-18 17:53:26,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:26,821 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2019-01-18 17:53:26,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-01-18 17:53:26,821 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2019-01-18 17:53:26,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-18 17:53:26,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:26,822 INFO L402 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2019-01-18 17:53:26,822 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:26,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:26,822 INFO L82 PathProgramCache]: Analyzing trace with hash 782937036, now seen corresponding path program 27 times [2019-01-18 17:53:26,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:26,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:26,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:26,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:26,823 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:26,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:27,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:27,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:27,327 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:27,327 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:27,327 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:27,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:27,336 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:27,337 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:27,361 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:27,361 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:27,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:27,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:28,285 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:28,304 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:28,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2019-01-18 17:53:28,304 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:28,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-01-18 17:53:28,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-01-18 17:53:28,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:53:28,306 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2019-01-18 17:53:28,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:28,339 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-01-18 17:53:28,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-18 17:53:28,339 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2019-01-18 17:53:28,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:28,340 INFO L225 Difference]: With dead ends: 34 [2019-01-18 17:53:28,340 INFO L226 Difference]: Without dead ends: 32 [2019-01-18 17:53:28,341 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2019-01-18 17:53:28,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-18 17:53:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-01-18 17:53:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-18 17:53:28,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-18 17:53:28,345 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2019-01-18 17:53:28,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:28,345 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-18 17:53:28,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-01-18 17:53:28,345 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-18 17:53:28,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-18 17:53:28,346 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:28,346 INFO L402 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2019-01-18 17:53:28,346 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:28,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:28,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1498753853, now seen corresponding path program 28 times [2019-01-18 17:53:28,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:28,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:28,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:28,348 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:28,755 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:28,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:28,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:28,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:28,756 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:28,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:28,756 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:28,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:28,766 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:28,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:28,801 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:28,802 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:29,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:29,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 59 [2019-01-18 17:53:29,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:29,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-01-18 17:53:29,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-01-18 17:53:29,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-18 17:53:29,710 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2019-01-18 17:53:29,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:29,788 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-18 17:53:29,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-18 17:53:29,789 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2019-01-18 17:53:29,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:29,789 INFO L225 Difference]: With dead ends: 35 [2019-01-18 17:53:29,790 INFO L226 Difference]: Without dead ends: 33 [2019-01-18 17:53:29,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2019-01-18 17:53:29,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-18 17:53:29,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-01-18 17:53:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-18 17:53:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2019-01-18 17:53:29,793 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2019-01-18 17:53:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:29,794 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2019-01-18 17:53:29,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-01-18 17:53:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2019-01-18 17:53:29,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-18 17:53:29,794 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:29,794 INFO L402 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2019-01-18 17:53:29,795 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:29,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:29,795 INFO L82 PathProgramCache]: Analyzing trace with hash 783272620, now seen corresponding path program 29 times [2019-01-18 17:53:29,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:29,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:29,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:29,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:29,796 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:29,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:30,343 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:30,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:30,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:30,344 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:30,344 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:30,344 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:30,344 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:30,354 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:30,354 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:30,419 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2019-01-18 17:53:30,419 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:30,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:30,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:31,727 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:31,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:31,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 61 [2019-01-18 17:53:31,746 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:31,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-01-18 17:53:31,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-01-18 17:53:31,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:53:31,748 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2019-01-18 17:53:31,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:31,833 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-01-18 17:53:31,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-18 17:53:31,835 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2019-01-18 17:53:31,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:31,835 INFO L225 Difference]: With dead ends: 36 [2019-01-18 17:53:31,835 INFO L226 Difference]: Without dead ends: 34 [2019-01-18 17:53:31,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2019-01-18 17:53:31,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-01-18 17:53:31,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-01-18 17:53:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-01-18 17:53:31,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-01-18 17:53:31,838 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2019-01-18 17:53:31,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:31,839 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-01-18 17:53:31,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-01-18 17:53:31,839 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-01-18 17:53:31,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-18 17:53:31,839 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:31,839 INFO L402 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2019-01-18 17:53:31,839 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:31,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:31,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1488350749, now seen corresponding path program 30 times [2019-01-18 17:53:31,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:31,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:31,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:31,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:31,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:32,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:32,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:32,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:32,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:32,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:32,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:32,274 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:32,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:32,305 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:32,305 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:32,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:32,315 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:32,315 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:33,340 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:33,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:33,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 63 [2019-01-18 17:53:33,359 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:33,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-01-18 17:53:33,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-01-18 17:53:33,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:53:33,360 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2019-01-18 17:53:33,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:33,446 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-01-18 17:53:33,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-18 17:53:33,447 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2019-01-18 17:53:33,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:33,448 INFO L225 Difference]: With dead ends: 37 [2019-01-18 17:53:33,448 INFO L226 Difference]: Without dead ends: 35 [2019-01-18 17:53:33,448 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2019-01-18 17:53:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-18 17:53:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-01-18 17:53:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-18 17:53:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2019-01-18 17:53:33,450 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2019-01-18 17:53:33,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:33,450 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2019-01-18 17:53:33,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-01-18 17:53:33,450 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2019-01-18 17:53:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-18 17:53:33,451 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:33,451 INFO L402 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2019-01-18 17:53:33,451 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:33,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:33,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1105768844, now seen corresponding path program 31 times [2019-01-18 17:53:33,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:33,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:33,452 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:33,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:33,452 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:34,455 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:34,455 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:34,456 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:34,456 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:34,456 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:34,456 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:34,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:34,465 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:34,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:34,499 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:35,626 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:35,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:35,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 65 [2019-01-18 17:53:35,645 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:35,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-01-18 17:53:35,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-01-18 17:53:35,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-18 17:53:35,646 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2019-01-18 17:53:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:35,714 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-01-18 17:53:35,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-18 17:53:35,714 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2019-01-18 17:53:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:35,715 INFO L225 Difference]: With dead ends: 38 [2019-01-18 17:53:35,715 INFO L226 Difference]: Without dead ends: 36 [2019-01-18 17:53:35,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2019-01-18 17:53:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-18 17:53:35,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-01-18 17:53:35,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-18 17:53:35,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-18 17:53:35,722 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2019-01-18 17:53:35,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:35,722 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-18 17:53:35,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-01-18 17:53:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-18 17:53:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-18 17:53:35,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:35,723 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-01-18 17:53:35,723 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:35,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:35,723 INFO L82 PathProgramCache]: Analyzing trace with hash -80902397, now seen corresponding path program 32 times [2019-01-18 17:53:35,723 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:35,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:35,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:35,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:35,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:35,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:36,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:36,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:36,599 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:36,599 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:36,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:36,599 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:36,609 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:36,609 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:36,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2019-01-18 17:53:36,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:36,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:36,693 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:37,892 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:37,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:37,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 67 [2019-01-18 17:53:37,912 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:37,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-01-18 17:53:37,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-01-18 17:53:37,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:53:37,913 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-01-18 17:53:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:37,980 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-18 17:53:37,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-01-18 17:53:37,980 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-01-18 17:53:37,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:37,981 INFO L225 Difference]: With dead ends: 39 [2019-01-18 17:53:37,981 INFO L226 Difference]: Without dead ends: 37 [2019-01-18 17:53:37,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2019-01-18 17:53:37,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-01-18 17:53:37,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-01-18 17:53:37,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-18 17:53:37,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-01-18 17:53:37,985 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2019-01-18 17:53:37,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:37,986 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-01-18 17:53:37,986 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-01-18 17:53:37,986 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-01-18 17:53:37,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-18 17:53:37,986 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:37,986 INFO L402 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-01-18 17:53:37,987 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:37,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:37,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1786994796, now seen corresponding path program 33 times [2019-01-18 17:53:37,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:37,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:37,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:37,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:37,988 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:38,529 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:38,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:38,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:38,530 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:38,530 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:38,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:38,530 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:38,539 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:38,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:38,583 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:38,583 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:38,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:38,594 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:39,763 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:39,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:39,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2019-01-18 17:53:39,782 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:39,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-18 17:53:39,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-18 17:53:39,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:53:39,783 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-01-18 17:53:39,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:39,897 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-01-18 17:53:39,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-18 17:53:39,897 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-01-18 17:53:39,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:39,898 INFO L225 Difference]: With dead ends: 40 [2019-01-18 17:53:39,898 INFO L226 Difference]: Without dead ends: 38 [2019-01-18 17:53:39,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-01-18 17:53:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-18 17:53:39,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-01-18 17:53:39,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-01-18 17:53:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-01-18 17:53:39,902 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2019-01-18 17:53:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:39,902 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-01-18 17:53:39,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-18 17:53:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-01-18 17:53:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-01-18 17:53:39,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:39,903 INFO L402 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2019-01-18 17:53:39,903 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:39,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:39,903 INFO L82 PathProgramCache]: Analyzing trace with hash -437734365, now seen corresponding path program 34 times [2019-01-18 17:53:39,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:39,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:39,904 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:39,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:39,904 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:39,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:40,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:40,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:40,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:40,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:40,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:40,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:40,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:40,487 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:40,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:40,535 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:40,553 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:42,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:42,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 71 [2019-01-18 17:53:42,107 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:42,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-01-18 17:53:42,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-01-18 17:53:42,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-18 17:53:42,108 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2019-01-18 17:53:42,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:42,174 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-01-18 17:53:42,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-18 17:53:42,174 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2019-01-18 17:53:42,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:42,175 INFO L225 Difference]: With dead ends: 41 [2019-01-18 17:53:42,175 INFO L226 Difference]: Without dead ends: 39 [2019-01-18 17:53:42,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2019-01-18 17:53:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-18 17:53:42,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-01-18 17:53:42,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-01-18 17:53:42,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-01-18 17:53:42,179 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2019-01-18 17:53:42,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:42,179 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-01-18 17:53:42,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-01-18 17:53:42,179 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-01-18 17:53:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-18 17:53:42,180 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:42,180 INFO L402 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2019-01-18 17:53:42,180 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:42,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash -684861620, now seen corresponding path program 35 times [2019-01-18 17:53:42,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:42,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:42,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:42,182 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:42,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:42,845 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:42,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:42,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:42,845 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:42,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:42,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:42,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 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:42,854 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:42,854 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:42,950 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2019-01-18 17:53:42,950 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:42,952 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:42,960 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:42,961 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:44,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:44,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 73 [2019-01-18 17:53:44,398 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:44,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-01-18 17:53:44,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-01-18 17:53:44,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:53:44,399 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2019-01-18 17:53:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:44,449 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-01-18 17:53:44,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-18 17:53:44,450 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2019-01-18 17:53:44,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:44,451 INFO L225 Difference]: With dead ends: 42 [2019-01-18 17:53:44,451 INFO L226 Difference]: Without dead ends: 40 [2019-01-18 17:53:44,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2019-01-18 17:53:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-18 17:53:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-01-18 17:53:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-18 17:53:44,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-18 17:53:44,454 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2019-01-18 17:53:44,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:44,454 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-18 17:53:44,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-01-18 17:53:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-18 17:53:44,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-18 17:53:44,455 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:44,455 INFO L402 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2019-01-18 17:53:44,455 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash 244128067, now seen corresponding path program 36 times [2019-01-18 17:53:44,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:44,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:44,456 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:45,402 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:45,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:45,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:45,403 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:45,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:45,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:45,403 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:45,413 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:45,413 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:45,447 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:45,447 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:45,449 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:45,458 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:47,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:47,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 75 [2019-01-18 17:53:47,208 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:47,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-18 17:53:47,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-18 17:53:47,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:53:47,210 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2019-01-18 17:53:47,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:47,264 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-18 17:53:47,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-01-18 17:53:47,265 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2019-01-18 17:53:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:47,266 INFO L225 Difference]: With dead ends: 43 [2019-01-18 17:53:47,266 INFO L226 Difference]: Without dead ends: 41 [2019-01-18 17:53:47,267 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2019-01-18 17:53:47,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-01-18 17:53:47,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-01-18 17:53:47,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-18 17:53:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-01-18 17:53:47,269 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2019-01-18 17:53:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:47,269 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-01-18 17:53:47,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-18 17:53:47,269 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-01-18 17:53:47,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-18 17:53:47,270 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:47,270 INFO L402 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2019-01-18 17:53:47,270 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:47,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:47,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1021962708, now seen corresponding path program 37 times [2019-01-18 17:53:47,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:47,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:47,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:47,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:47,271 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:48,103 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:48,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:48,104 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:48,104 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:48,104 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:48,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:48,105 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:48,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:48,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:48,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:48,152 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:49,683 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:49,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:49,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 77 [2019-01-18 17:53:49,702 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:49,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-01-18 17:53:49,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-01-18 17:53:49,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:53:49,703 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2019-01-18 17:53:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:49,778 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-01-18 17:53:49,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-18 17:53:49,778 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2019-01-18 17:53:49,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:49,779 INFO L225 Difference]: With dead ends: 44 [2019-01-18 17:53:49,779 INFO L226 Difference]: Without dead ends: 42 [2019-01-18 17:53:49,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2019-01-18 17:53:49,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-18 17:53:49,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-18 17:53:49,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-18 17:53:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-01-18 17:53:49,781 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2019-01-18 17:53:49,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:49,781 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-01-18 17:53:49,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-01-18 17:53:49,781 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-01-18 17:53:49,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-18 17:53:49,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:49,782 INFO L402 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2019-01-18 17:53:49,782 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:49,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:49,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1616071069, now seen corresponding path program 38 times [2019-01-18 17:53:49,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:49,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:49,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:49,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:49,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:49,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:50,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:50,494 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:50,494 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:50,494 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:50,494 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:50,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 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:50,504 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:50,504 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:50,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2019-01-18 17:53:50,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:50,607 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:50,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:52,598 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:52,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:52,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 79 [2019-01-18 17:53:52,618 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:52,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-18 17:53:52,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-18 17:53:52,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:53:52,619 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2019-01-18 17:53:52,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:52,680 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-01-18 17:53:52,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-18 17:53:52,680 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2019-01-18 17:53:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:52,681 INFO L225 Difference]: With dead ends: 45 [2019-01-18 17:53:52,681 INFO L226 Difference]: Without dead ends: 43 [2019-01-18 17:53:52,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2019-01-18 17:53:52,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-18 17:53:52,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-01-18 17:53:52,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-01-18 17:53:52,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-01-18 17:53:52,684 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2019-01-18 17:53:52,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:52,684 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-01-18 17:53:52,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-18 17:53:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-01-18 17:53:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-18 17:53:52,685 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:52,685 INFO L402 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2019-01-18 17:53:52,685 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:52,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:52,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1441406220, now seen corresponding path program 39 times [2019-01-18 17:53:52,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:52,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:52,686 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:52,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:52,687 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:53,328 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:53,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:53,329 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:53,329 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:53,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:53,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:53,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 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:53,338 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:53:53,339 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:53:53,375 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:53:53,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:53,377 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:53,383 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:55,027 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:55,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:55,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 81 [2019-01-18 17:53:55,047 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:55,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-01-18 17:53:55,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-01-18 17:53:55,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:53:55,048 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2019-01-18 17:53:55,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:55,118 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-01-18 17:53:55,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-01-18 17:53:55,118 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2019-01-18 17:53:55,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:55,119 INFO L225 Difference]: With dead ends: 46 [2019-01-18 17:53:55,119 INFO L226 Difference]: Without dead ends: 44 [2019-01-18 17:53:55,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2019-01-18 17:53:55,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-18 17:53:55,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-01-18 17:53:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-18 17:53:55,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-18 17:53:55,122 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2019-01-18 17:53:55,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:55,123 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-18 17:53:55,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-01-18 17:53:55,123 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-18 17:53:55,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-18 17:53:55,123 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:55,124 INFO L402 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-01-18 17:53:55,124 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:55,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:55,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1733921667, now seen corresponding path program 40 times [2019-01-18 17:53:55,124 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:55,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:53:55,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:55,125 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:55,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:55,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:55,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:55,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:55,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:55,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:55,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:55,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:55,856 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:53:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:55,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:55,905 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:55,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:53:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:57,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:53:57,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 83 [2019-01-18 17:53:57,960 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:53:57,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-01-18 17:53:57,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-01-18 17:53:57,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-18 17:53:57,961 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-01-18 17:53:58,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:53:58,063 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-18 17:53:58,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-01-18 17:53:58,064 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-01-18 17:53:58,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:53:58,064 INFO L225 Difference]: With dead ends: 47 [2019-01-18 17:53:58,065 INFO L226 Difference]: Without dead ends: 45 [2019-01-18 17:53:58,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2019-01-18 17:53:58,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-01-18 17:53:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-01-18 17:53:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-18 17:53:58,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-01-18 17:53:58,067 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2019-01-18 17:53:58,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:53:58,068 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-01-18 17:53:58,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-01-18 17:53:58,068 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-01-18 17:53:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-18 17:53:58,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:53:58,068 INFO L402 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-01-18 17:53:58,068 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:53:58,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:53:58,069 INFO L82 PathProgramCache]: Analyzing trace with hash -2083001364, now seen corresponding path program 41 times [2019-01-18 17:53:58,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:53:58,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:58,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:53:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:53:58,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:53:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:53:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:58,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:58,913 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:53:58,913 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:53:58,914 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:53:58,914 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:53:58,914 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:53:58,922 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:53:58,922 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:53:59,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2019-01-18 17:53:59,067 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:53:59,071 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:53:59,078 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:53:59,079 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:00,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:00,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 85 [2019-01-18 17:54:00,945 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:00,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-18 17:54:00,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-18 17:54:00,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:54:00,946 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-01-18 17:54:01,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:01,019 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-01-18 17:54:01,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-01-18 17:54:01,020 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-01-18 17:54:01,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:01,021 INFO L225 Difference]: With dead ends: 48 [2019-01-18 17:54:01,021 INFO L226 Difference]: Without dead ends: 46 [2019-01-18 17:54:01,022 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2019-01-18 17:54:01,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-18 17:54:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2019-01-18 17:54:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-18 17:54:01,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-01-18 17:54:01,024 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2019-01-18 17:54:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:01,024 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-01-18 17:54:01,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-18 17:54:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-01-18 17:54:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-18 17:54:01,025 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:01,025 INFO L402 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2019-01-18 17:54:01,025 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:01,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:01,025 INFO L82 PathProgramCache]: Analyzing trace with hash -148531037, now seen corresponding path program 42 times [2019-01-18 17:54:01,026 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:01,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:01,026 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:01,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:01,027 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:01,802 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:01,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:01,802 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:01,802 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:01,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:01,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:01,803 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:01,811 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:01,811 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:01,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:01,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:01,855 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:01,864 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:01,864 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:04,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:04,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 87 [2019-01-18 17:54:04,054 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:04,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-18 17:54:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-18 17:54:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:54:04,055 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2019-01-18 17:54:04,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:04,124 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-01-18 17:54:04,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-01-18 17:54:04,124 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2019-01-18 17:54:04,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:04,125 INFO L225 Difference]: With dead ends: 49 [2019-01-18 17:54:04,125 INFO L226 Difference]: Without dead ends: 47 [2019-01-18 17:54:04,125 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2019-01-18 17:54:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-18 17:54:04,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-01-18 17:54:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-18 17:54:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-01-18 17:54:04,128 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2019-01-18 17:54:04,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:04,128 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-01-18 17:54:04,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-18 17:54:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-01-18 17:54:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-18 17:54:04,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:04,129 INFO L402 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2019-01-18 17:54:04,130 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash -309493044, now seen corresponding path program 43 times [2019-01-18 17:54:04,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:04,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:04,131 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:04,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:04,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:04,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:05,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:05,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:05,167 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:05,167 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:05,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:05,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:05,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:05,177 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:05,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:05,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:05,228 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:05,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:07,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-01-18 17:54:07,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:07,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 89 [2019-01-18 17:54:07,622 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:07,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2019-01-18 17:54:07,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2019-01-18 17:54:07,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-18 17:54:07,623 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2019-01-18 17:54:07,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:07,822 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-01-18 17:54:07,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-01-18 17:54:07,823 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2019-01-18 17:54:07,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:07,823 INFO L225 Difference]: With dead ends: 50 [2019-01-18 17:54:07,823 INFO L226 Difference]: Without dead ends: 48 [2019-01-18 17:54:07,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2019-01-18 17:54:07,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-18 17:54:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-01-18 17:54:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-18 17:54:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-18 17:54:07,826 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2019-01-18 17:54:07,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:07,826 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-18 17:54:07,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2019-01-18 17:54:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-18 17:54:07,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-18 17:54:07,827 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:07,827 INFO L402 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2019-01-18 17:54:07,827 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:07,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1004347965, now seen corresponding path program 44 times [2019-01-18 17:54:07,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:07,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:07,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:07,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:07,828 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:08,714 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:08,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:08,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:08,715 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:08,715 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:08,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:08,715 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:08,726 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:08,726 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:08,869 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2019-01-18 17:54:08,869 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:08,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:08,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:10,961 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:10,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:10,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 91 [2019-01-18 17:54:10,981 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:10,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-01-18 17:54:10,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-01-18 17:54:10,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:54:10,982 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2019-01-18 17:54:11,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:11,040 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-18 17:54:11,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-01-18 17:54:11,041 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2019-01-18 17:54:11,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:11,042 INFO L225 Difference]: With dead ends: 51 [2019-01-18 17:54:11,042 INFO L226 Difference]: Without dead ends: 49 [2019-01-18 17:54:11,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2019-01-18 17:54:11,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-01-18 17:54:11,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-01-18 17:54:11,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-18 17:54:11,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-01-18 17:54:11,045 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2019-01-18 17:54:11,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:11,045 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-01-18 17:54:11,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-01-18 17:54:11,045 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-01-18 17:54:11,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-18 17:54:11,046 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:11,046 INFO L402 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2019-01-18 17:54:11,046 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:11,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:11,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1070014036, now seen corresponding path program 45 times [2019-01-18 17:54:11,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:11,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:11,047 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:11,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:11,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:11,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:11,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:11,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:11,898 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:11,898 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:11,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:11,898 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:11,908 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:11,908 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:11,951 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:11,951 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:11,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:11,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:14,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:14,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2019-01-18 17:54:14,460 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:14,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2019-01-18 17:54:14,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2019-01-18 17:54:14,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2019-01-18 17:54:14,462 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2019-01-18 17:54:14,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:14,764 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-01-18 17:54:14,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-01-18 17:54:14,765 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2019-01-18 17:54:14,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:14,765 INFO L225 Difference]: With dead ends: 52 [2019-01-18 17:54:14,766 INFO L226 Difference]: Without dead ends: 50 [2019-01-18 17:54:14,766 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-01-18 17:54:14,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-18 17:54:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-01-18 17:54:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-01-18 17:54:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-01-18 17:54:14,768 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2019-01-18 17:54:14,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:14,769 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-01-18 17:54:14,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2019-01-18 17:54:14,769 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-01-18 17:54:14,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-18 17:54:14,769 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:14,769 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2019-01-18 17:54:14,770 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:14,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:14,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1189305059, now seen corresponding path program 46 times [2019-01-18 17:54:14,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:14,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:14,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:14,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:14,771 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:15,780 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:15,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:15,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:15,781 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:15,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:15,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:15,781 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:15,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:15,792 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:15,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:15,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:15,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:18,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:18,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 95 [2019-01-18 17:54:18,451 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:18,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-01-18 17:54:18,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-01-18 17:54:18,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-18 17:54:18,452 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2019-01-18 17:54:18,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:18,545 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-01-18 17:54:18,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-01-18 17:54:18,546 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2019-01-18 17:54:18,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:18,546 INFO L225 Difference]: With dead ends: 53 [2019-01-18 17:54:18,546 INFO L226 Difference]: Without dead ends: 51 [2019-01-18 17:54:18,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2019-01-18 17:54:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-18 17:54:18,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-01-18 17:54:18,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-01-18 17:54:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2019-01-18 17:54:18,549 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2019-01-18 17:54:18,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:18,549 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2019-01-18 17:54:18,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-01-18 17:54:18,549 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2019-01-18 17:54:18,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-18 17:54:18,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:18,550 INFO L402 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2019-01-18 17:54:18,550 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:18,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:18,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1786247028, now seen corresponding path program 47 times [2019-01-18 17:54:18,550 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:18,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:18,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:18,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:18,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:19,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:19,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:19,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:19,624 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:19,624 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:19,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:19,624 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:19,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:19,634 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:19,824 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 25 check-sat command(s) [2019-01-18 17:54:19,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:19,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:19,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:22,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:22,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:22,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2019-01-18 17:54:22,722 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:22,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-01-18 17:54:22,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-01-18 17:54:22,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:54:22,723 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2019-01-18 17:54:22,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:22,783 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-01-18 17:54:22,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-01-18 17:54:22,784 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2019-01-18 17:54:22,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:22,788 INFO L225 Difference]: With dead ends: 54 [2019-01-18 17:54:22,788 INFO L226 Difference]: Without dead ends: 52 [2019-01-18 17:54:22,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2019-01-18 17:54:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-18 17:54:22,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-01-18 17:54:22,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-18 17:54:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-18 17:54:22,795 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2019-01-18 17:54:22,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:22,795 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-18 17:54:22,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-01-18 17:54:22,795 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-18 17:54:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-18 17:54:22,796 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:22,796 INFO L402 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-01-18 17:54:22,796 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:22,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:22,796 INFO L82 PathProgramCache]: Analyzing trace with hash 460918787, now seen corresponding path program 48 times [2019-01-18 17:54:22,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:22,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:22,797 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:22,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:22,798 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:22,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:23,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:23,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:23,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:23,767 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:23,767 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:23,767 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:23,767 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:23,777 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:23,777 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:23,824 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:23,824 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:23,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:23,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:23,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:26,287 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:26,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:26,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 99 [2019-01-18 17:54:26,317 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:26,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-18 17:54:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-18 17:54:26,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:54:26,319 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-01-18 17:54:26,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:26,455 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-18 17:54:26,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-01-18 17:54:26,455 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-01-18 17:54:26,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:26,456 INFO L225 Difference]: With dead ends: 55 [2019-01-18 17:54:26,456 INFO L226 Difference]: Without dead ends: 53 [2019-01-18 17:54:26,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2019-01-18 17:54:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-01-18 17:54:26,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-01-18 17:54:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-18 17:54:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-01-18 17:54:26,459 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2019-01-18 17:54:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:26,460 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-01-18 17:54:26,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-18 17:54:26,460 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-01-18 17:54:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-18 17:54:26,460 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:26,460 INFO L402 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-01-18 17:54:26,460 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:26,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1403582316, now seen corresponding path program 49 times [2019-01-18 17:54:26,461 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:26,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:26,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:26,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:26,463 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:27,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:27,906 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:27,906 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:27,906 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:27,906 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:27,907 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:27,907 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:27,917 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:27,917 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:27,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:27,972 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:30,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:30,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 101 [2019-01-18 17:54:30,508 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:30,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-18 17:54:30,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-18 17:54:30,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:54:30,510 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-01-18 17:54:30,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:30,573 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-18 17:54:30,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-01-18 17:54:30,574 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-01-18 17:54:30,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:30,575 INFO L225 Difference]: With dead ends: 56 [2019-01-18 17:54:30,575 INFO L226 Difference]: Without dead ends: 54 [2019-01-18 17:54:30,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2019-01-18 17:54:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-18 17:54:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-01-18 17:54:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-01-18 17:54:30,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-01-18 17:54:30,578 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2019-01-18 17:54:30,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:30,579 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-01-18 17:54:30,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-18 17:54:30,579 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-01-18 17:54:30,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-18 17:54:30,579 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:30,579 INFO L402 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2019-01-18 17:54:30,579 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:30,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:30,580 INFO L82 PathProgramCache]: Analyzing trace with hash 561380643, now seen corresponding path program 50 times [2019-01-18 17:54:30,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:30,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:30,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:30,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:30,580 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:30,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:31,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:31,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:31,611 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:31,611 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:31,611 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:31,611 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:31,621 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:31,621 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:31,828 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 26 check-sat command(s) [2019-01-18 17:54:31,828 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:31,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:31,846 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:34,959 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:34,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:34,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 103 [2019-01-18 17:54:34,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:34,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-01-18 17:54:34,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-01-18 17:54:34,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:54:34,993 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2019-01-18 17:54:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:35,147 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-01-18 17:54:35,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-01-18 17:54:35,147 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2019-01-18 17:54:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:35,148 INFO L225 Difference]: With dead ends: 57 [2019-01-18 17:54:35,148 INFO L226 Difference]: Without dead ends: 55 [2019-01-18 17:54:35,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2019-01-18 17:54:35,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-18 17:54:35,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-01-18 17:54:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-01-18 17:54:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2019-01-18 17:54:35,151 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2019-01-18 17:54:35,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:35,152 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2019-01-18 17:54:35,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-01-18 17:54:35,152 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2019-01-18 17:54:35,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-01-18 17:54:35,152 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:35,152 INFO L402 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2019-01-18 17:54:35,152 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:35,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:35,153 INFO L82 PathProgramCache]: Analyzing trace with hash 222932556, now seen corresponding path program 51 times [2019-01-18 17:54:35,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:35,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:35,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:35,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:35,154 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:36,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:36,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:36,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:36,390 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:36,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:36,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:36,391 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:36,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:36,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:36,450 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:36,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:36,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:36,472 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:39,444 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:39,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:39,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 105 [2019-01-18 17:54:39,463 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:39,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-18 17:54:39,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-18 17:54:39,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:54:39,465 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2019-01-18 17:54:39,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:39,560 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-01-18 17:54:39,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-01-18 17:54:39,561 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2019-01-18 17:54:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:39,562 INFO L225 Difference]: With dead ends: 58 [2019-01-18 17:54:39,562 INFO L226 Difference]: Without dead ends: 56 [2019-01-18 17:54:39,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2019-01-18 17:54:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-18 17:54:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-18 17:54:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-18 17:54:39,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-18 17:54:39,565 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2019-01-18 17:54:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:39,566 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-18 17:54:39,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-18 17:54:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-18 17:54:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-18 17:54:39,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:39,567 INFO L402 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2019-01-18 17:54:39,567 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:39,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:39,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1679023549, now seen corresponding path program 52 times [2019-01-18 17:54:39,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:39,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:39,568 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:39,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:39,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:39,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:40,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:40,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:40,937 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:40,937 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:40,937 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:40,937 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:40,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:40,946 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:40,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:41,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:41,003 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:44,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:44,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:44,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 107 [2019-01-18 17:54:44,180 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:44,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-18 17:54:44,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-18 17:54:44,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-18 17:54:44,181 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2019-01-18 17:54:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:44,288 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2019-01-18 17:54:44,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-01-18 17:54:44,289 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2019-01-18 17:54:44,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:44,290 INFO L225 Difference]: With dead ends: 59 [2019-01-18 17:54:44,290 INFO L226 Difference]: Without dead ends: 57 [2019-01-18 17:54:44,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2019-01-18 17:54:44,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-01-18 17:54:44,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-01-18 17:54:44,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-18 17:54:44,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2019-01-18 17:54:44,293 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2019-01-18 17:54:44,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:44,293 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2019-01-18 17:54:44,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-18 17:54:44,294 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2019-01-18 17:54:44,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-18 17:54:44,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:44,294 INFO L402 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2019-01-18 17:54:44,294 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:44,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:44,295 INFO L82 PathProgramCache]: Analyzing trace with hash -510120660, now seen corresponding path program 53 times [2019-01-18 17:54:44,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:44,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:44,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:44,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:44,296 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:45,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:45,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:45,389 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:45,389 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:45,389 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:45,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:45,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:45,400 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:54:45,400 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:54:45,656 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2019-01-18 17:54:45,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:45,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:45,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:45,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:48,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:48,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 109 [2019-01-18 17:54:48,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:48,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-18 17:54:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-18 17:54:48,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:54:48,844 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2019-01-18 17:54:48,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:48,913 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-01-18 17:54:48,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-01-18 17:54:48,914 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2019-01-18 17:54:48,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:48,915 INFO L225 Difference]: With dead ends: 60 [2019-01-18 17:54:48,915 INFO L226 Difference]: Without dead ends: 58 [2019-01-18 17:54:48,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2019-01-18 17:54:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-01-18 17:54:48,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-01-18 17:54:48,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-01-18 17:54:48,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-01-18 17:54:48,918 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2019-01-18 17:54:48,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:48,918 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-01-18 17:54:48,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-18 17:54:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-01-18 17:54:48,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-18 17:54:48,919 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:48,919 INFO L402 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2019-01-18 17:54:48,919 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:48,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:48,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1366130531, now seen corresponding path program 54 times [2019-01-18 17:54:48,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:48,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:48,920 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:48,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:48,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:50,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:50,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:50,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:50,776 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:50,776 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:50,776 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:50,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:50,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:54:50,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:54:50,837 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:54:50,837 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:54:50,840 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:50,850 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:54,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:54,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:54,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 111 [2019-01-18 17:54:54,312 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:54,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-01-18 17:54:54,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-01-18 17:54:54,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:54:54,314 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2019-01-18 17:54:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:54,411 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-01-18 17:54:54,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-18 17:54:54,412 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2019-01-18 17:54:54,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:54,412 INFO L225 Difference]: With dead ends: 61 [2019-01-18 17:54:54,412 INFO L226 Difference]: Without dead ends: 59 [2019-01-18 17:54:54,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2019-01-18 17:54:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-01-18 17:54:54,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-01-18 17:54:54,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-01-18 17:54:54,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2019-01-18 17:54:54,415 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2019-01-18 17:54:54,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:54,415 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2019-01-18 17:54:54,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-01-18 17:54:54,415 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2019-01-18 17:54:54,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-18 17:54:54,415 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:54,416 INFO L402 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2019-01-18 17:54:54,416 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:54,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:54,416 INFO L82 PathProgramCache]: Analyzing trace with hash -599624692, now seen corresponding path program 55 times [2019-01-18 17:54:54,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:54,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:54,417 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:54:54,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:54,417 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:55,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:55,681 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:54:55,681 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:54:55,682 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:54:55,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:54:55,682 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:54:55,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:55,692 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:54:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:54:55,744 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:54:55,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:55,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:54:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:54:59,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:54:59,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 113 [2019-01-18 17:54:59,234 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:54:59,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-18 17:54:59,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-18 17:54:59,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:54:59,236 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2019-01-18 17:54:59,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:54:59,353 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-01-18 17:54:59,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-01-18 17:54:59,354 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2019-01-18 17:54:59,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:54:59,354 INFO L225 Difference]: With dead ends: 62 [2019-01-18 17:54:59,354 INFO L226 Difference]: Without dead ends: 60 [2019-01-18 17:54:59,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2019-01-18 17:54:59,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-18 17:54:59,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-01-18 17:54:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-01-18 17:54:59,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-01-18 17:54:59,358 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2019-01-18 17:54:59,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:54:59,358 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-01-18 17:54:59,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-18 17:54:59,358 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-01-18 17:54:59,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-18 17:54:59,359 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:54:59,359 INFO L402 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-01-18 17:54:59,359 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:54:59,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:54:59,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1408494461, now seen corresponding path program 56 times [2019-01-18 17:54:59,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:54:59,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:59,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:54:59,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:54:59,360 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:54:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:00,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:00,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:00,571 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:00,571 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:00,571 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:00,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:00,572 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:00,582 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:00,582 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:00,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 29 check-sat command(s) [2019-01-18 17:55:00,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:00,867 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:00,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:04,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:04,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:04,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 115 [2019-01-18 17:55:04,395 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:04,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-01-18 17:55:04,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-01-18 17:55:04,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-18 17:55:04,396 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-01-18 17:55:04,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:04,472 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2019-01-18 17:55:04,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-01-18 17:55:04,472 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-01-18 17:55:04,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:04,473 INFO L225 Difference]: With dead ends: 63 [2019-01-18 17:55:04,473 INFO L226 Difference]: Without dead ends: 61 [2019-01-18 17:55:04,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2019-01-18 17:55:04,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-18 17:55:04,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-18 17:55:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-18 17:55:04,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-01-18 17:55:04,477 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2019-01-18 17:55:04,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:04,477 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-01-18 17:55:04,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-01-18 17:55:04,478 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-01-18 17:55:04,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-18 17:55:04,478 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:04,478 INFO L402 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-01-18 17:55:04,478 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:04,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:04,479 INFO L82 PathProgramCache]: Analyzing trace with hash -713653524, now seen corresponding path program 57 times [2019-01-18 17:55:04,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:04,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:04,480 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:04,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:04,480 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:06,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:06,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:06,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:06,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:06,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:06,110 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:06,119 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:06,119 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:06,171 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:06,171 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:06,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:06,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:06,198 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:10,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:10,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:10,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 117 [2019-01-18 17:55:10,093 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:10,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-18 17:55:10,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-18 17:55:10,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:55:10,095 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-01-18 17:55:10,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:10,200 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-01-18 17:55:10,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-01-18 17:55:10,200 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-01-18 17:55:10,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:10,201 INFO L225 Difference]: With dead ends: 64 [2019-01-18 17:55:10,201 INFO L226 Difference]: Without dead ends: 62 [2019-01-18 17:55:10,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2019-01-18 17:55:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-18 17:55:10,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-18 17:55:10,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-18 17:55:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-01-18 17:55:10,204 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2019-01-18 17:55:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:10,205 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-01-18 17:55:10,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-18 17:55:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-01-18 17:55:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-18 17:55:10,205 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:10,205 INFO L402 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2019-01-18 17:55:10,205 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:10,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:10,206 INFO L82 PathProgramCache]: Analyzing trace with hash -648420957, now seen corresponding path program 58 times [2019-01-18 17:55:10,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:10,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:10,207 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:10,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:10,207 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:11,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:11,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:11,651 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:11,651 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:11,651 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:11,651 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:11,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:11,663 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:11,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:11,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:11,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:15,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:15,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 119 [2019-01-18 17:55:15,742 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:15,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-01-18 17:55:15,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-01-18 17:55:15,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-18 17:55:15,744 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2019-01-18 17:55:15,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:15,839 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2019-01-18 17:55:15,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-01-18 17:55:15,839 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2019-01-18 17:55:15,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:15,840 INFO L225 Difference]: With dead ends: 65 [2019-01-18 17:55:15,840 INFO L226 Difference]: Without dead ends: 63 [2019-01-18 17:55:15,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2019-01-18 17:55:15,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-01-18 17:55:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-01-18 17:55:15,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-01-18 17:55:15,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2019-01-18 17:55:15,842 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2019-01-18 17:55:15,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:15,843 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2019-01-18 17:55:15,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-01-18 17:55:15,843 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2019-01-18 17:55:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-18 17:55:15,843 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:15,843 INFO L402 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2019-01-18 17:55:15,843 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:15,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1373788620, now seen corresponding path program 59 times [2019-01-18 17:55:15,844 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:15,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:15,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:15,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:17,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:17,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:17,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:17,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:17,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:17,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:17,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:17,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:17,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:17,544 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 31 check-sat command(s) [2019-01-18 17:55:17,544 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:17,548 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:17,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:17,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:21,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:21,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 121 [2019-01-18 17:55:21,563 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:21,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-18 17:55:21,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-18 17:55:21,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:55:21,564 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2019-01-18 17:55:21,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:21,641 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-01-18 17:55:21,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-01-18 17:55:21,642 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2019-01-18 17:55:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:21,642 INFO L225 Difference]: With dead ends: 66 [2019-01-18 17:55:21,642 INFO L226 Difference]: Without dead ends: 64 [2019-01-18 17:55:21,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2019-01-18 17:55:21,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-01-18 17:55:21,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-01-18 17:55:21,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-01-18 17:55:21,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-01-18 17:55:21,646 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2019-01-18 17:55:21,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:21,646 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-01-18 17:55:21,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-18 17:55:21,646 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-01-18 17:55:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-18 17:55:21,646 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:21,646 INFO L402 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2019-01-18 17:55:21,647 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:21,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:21,647 INFO L82 PathProgramCache]: Analyzing trace with hash -362223933, now seen corresponding path program 60 times [2019-01-18 17:55:21,647 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:21,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:21,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:21,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:21,648 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:21,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:22,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:22,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:22,996 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:22,996 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:22,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:22,996 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:23,007 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:23,007 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:23,063 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:23,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:23,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:23,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:27,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:27,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:27,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 123 [2019-01-18 17:55:27,182 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:27,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-01-18 17:55:27,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-01-18 17:55:27,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:55:27,183 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2019-01-18 17:55:27,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:27,321 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2019-01-18 17:55:27,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-01-18 17:55:27,321 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2019-01-18 17:55:27,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:27,322 INFO L225 Difference]: With dead ends: 67 [2019-01-18 17:55:27,322 INFO L226 Difference]: Without dead ends: 65 [2019-01-18 17:55:27,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2019-01-18 17:55:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-01-18 17:55:27,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-01-18 17:55:27,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-01-18 17:55:27,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2019-01-18 17:55:27,326 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2019-01-18 17:55:27,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:27,326 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2019-01-18 17:55:27,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-01-18 17:55:27,326 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2019-01-18 17:55:27,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-18 17:55:27,326 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:27,326 INFO L402 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2019-01-18 17:55:27,327 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:27,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:27,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1655961772, now seen corresponding path program 61 times [2019-01-18 17:55:27,327 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:27,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:27,328 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:27,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:27,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:28,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:28,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:28,745 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:28,745 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:28,745 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:28,745 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:28,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:28,754 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:28,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:28,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:33,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:33,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 125 [2019-01-18 17:55:33,030 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:33,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2019-01-18 17:55:33,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2019-01-18 17:55:33,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:55:33,032 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2019-01-18 17:55:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:33,176 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-01-18 17:55:33,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-01-18 17:55:33,176 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2019-01-18 17:55:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:33,177 INFO L225 Difference]: With dead ends: 68 [2019-01-18 17:55:33,177 INFO L226 Difference]: Without dead ends: 66 [2019-01-18 17:55:33,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2019-01-18 17:55:33,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-18 17:55:33,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-18 17:55:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-18 17:55:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-01-18 17:55:33,180 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2019-01-18 17:55:33,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:33,181 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-01-18 17:55:33,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2019-01-18 17:55:33,181 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-01-18 17:55:33,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-01-18 17:55:33,181 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:33,181 INFO L402 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2019-01-18 17:55:33,182 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:33,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:33,182 INFO L82 PathProgramCache]: Analyzing trace with hash -204790813, now seen corresponding path program 62 times [2019-01-18 17:55:33,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:33,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:33,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:33,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:33,183 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:34,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:34,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:34,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:34,917 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:34,917 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:34,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:34,917 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:34,927 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:34,927 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:35,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2019-01-18 17:55:35,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:35,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:35,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:35,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:39,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:39,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 127 [2019-01-18 17:55:39,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:39,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-18 17:55:39,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-18 17:55:39,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 17:55:39,598 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2019-01-18 17:55:39,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:39,714 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-01-18 17:55:39,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-01-18 17:55:39,714 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2019-01-18 17:55:39,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:39,715 INFO L225 Difference]: With dead ends: 69 [2019-01-18 17:55:39,715 INFO L226 Difference]: Without dead ends: 67 [2019-01-18 17:55:39,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2019-01-18 17:55:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-01-18 17:55:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-01-18 17:55:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-01-18 17:55:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2019-01-18 17:55:39,719 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2019-01-18 17:55:39,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:39,719 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2019-01-18 17:55:39,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-18 17:55:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2019-01-18 17:55:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-18 17:55:39,720 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:39,720 INFO L402 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2019-01-18 17:55:39,721 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:39,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:39,721 INFO L82 PathProgramCache]: Analyzing trace with hash -2053546100, now seen corresponding path program 63 times [2019-01-18 17:55:39,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:39,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:39,722 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:39,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:39,722 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:41,226 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:41,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:41,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:41,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:41,226 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:41,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:41,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:41,239 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:55:41,239 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:55:41,318 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:55:41,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:41,322 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:41,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:45,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:45,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 129 [2019-01-18 17:55:45,792 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:45,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-18 17:55:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-18 17:55:45,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:55:45,794 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2019-01-18 17:55:45,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:45,915 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-01-18 17:55:45,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-01-18 17:55:45,922 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2019-01-18 17:55:45,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:45,923 INFO L225 Difference]: With dead ends: 70 [2019-01-18 17:55:45,923 INFO L226 Difference]: Without dead ends: 68 [2019-01-18 17:55:45,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2019-01-18 17:55:45,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-01-18 17:55:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-01-18 17:55:45,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-01-18 17:55:45,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-01-18 17:55:45,926 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2019-01-18 17:55:45,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:45,927 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-01-18 17:55:45,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-18 17:55:45,927 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-01-18 17:55:45,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-18 17:55:45,927 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:45,927 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-01-18 17:55:45,928 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:45,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:45,928 INFO L82 PathProgramCache]: Analyzing trace with hash 764582147, now seen corresponding path program 64 times [2019-01-18 17:55:45,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:45,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:55:45,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:45,929 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:45,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:47,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:47,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:47,505 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:47,505 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:47,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:47,505 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:47,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:47,516 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:55:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:47,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:47,585 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:55:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:52,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:55:52,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 131 [2019-01-18 17:55:52,148 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:55:52,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-18 17:55:52,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-18 17:55:52,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-18 17:55:52,150 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-01-18 17:55:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:55:52,243 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2019-01-18 17:55:52,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-01-18 17:55:52,243 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-01-18 17:55:52,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:55:52,244 INFO L225 Difference]: With dead ends: 71 [2019-01-18 17:55:52,244 INFO L226 Difference]: Without dead ends: 69 [2019-01-18 17:55:52,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2019-01-18 17:55:52,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-01-18 17:55:52,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-01-18 17:55:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-18 17:55:52,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-01-18 17:55:52,247 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2019-01-18 17:55:52,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:55:52,248 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-01-18 17:55:52,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-18 17:55:52,248 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-01-18 17:55:52,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-18 17:55:52,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:55:52,248 INFO L402 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-01-18 17:55:52,248 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:55:52,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:55:52,249 INFO L82 PathProgramCache]: Analyzing trace with hash -2067755412, now seen corresponding path program 65 times [2019-01-18 17:55:52,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:55:52,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:52,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:55:52,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:55:52,250 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:55:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:55:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:54,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:54,815 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:55:54,815 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:55:54,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:55:54,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:55:54,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:55:54,825 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:55:54,825 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:55:55,295 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2019-01-18 17:55:55,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:55:55,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:55:55,309 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:55:55,310 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:00,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:00,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:00,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2019-01-18 17:56:00,045 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:00,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-01-18 17:56:00,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-01-18 17:56:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:56:00,046 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-01-18 17:56:00,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:00,170 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-01-18 17:56:00,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-01-18 17:56:00,170 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-01-18 17:56:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:00,171 INFO L225 Difference]: With dead ends: 72 [2019-01-18 17:56:00,171 INFO L226 Difference]: Without dead ends: 70 [2019-01-18 17:56:00,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2019-01-18 17:56:00,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-01-18 17:56:00,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-01-18 17:56:00,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-01-18 17:56:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-01-18 17:56:00,175 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2019-01-18 17:56:00,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:00,176 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-01-18 17:56:00,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-01-18 17:56:00,176 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-01-18 17:56:00,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-18 17:56:00,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:00,176 INFO L402 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2019-01-18 17:56:00,177 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:00,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:00,177 INFO L82 PathProgramCache]: Analyzing trace with hash 324093475, now seen corresponding path program 66 times [2019-01-18 17:56:00,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:00,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:00,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:00,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:00,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:01,774 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:01,774 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:01,774 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:01,774 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:01,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:01,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:01,775 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:01,786 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:01,786 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:01,843 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:01,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:01,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:01,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:08,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:08,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:08,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 135 [2019-01-18 17:56:08,086 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:08,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-01-18 17:56:08,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-01-18 17:56:08,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:56:08,087 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2019-01-18 17:56:08,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:08,420 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2019-01-18 17:56:08,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-01-18 17:56:08,421 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2019-01-18 17:56:08,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:08,421 INFO L225 Difference]: With dead ends: 73 [2019-01-18 17:56:08,421 INFO L226 Difference]: Without dead ends: 71 [2019-01-18 17:56:08,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2019-01-18 17:56:08,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-01-18 17:56:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-01-18 17:56:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-01-18 17:56:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2019-01-18 17:56:08,424 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2019-01-18 17:56:08,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:08,424 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2019-01-18 17:56:08,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-01-18 17:56:08,424 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2019-01-18 17:56:08,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-01-18 17:56:08,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:08,424 INFO L402 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2019-01-18 17:56:08,425 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:08,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:08,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1456964940, now seen corresponding path program 67 times [2019-01-18 17:56:08,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:08,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:08,427 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:08,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:08,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:10,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:10,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:10,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:10,427 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:10,427 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:10,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:10,427 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 68 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:10,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:10,436 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:10,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:10,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:15,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:15,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 137 [2019-01-18 17:56:15,642 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:15,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-18 17:56:15,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-18 17:56:15,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-18 17:56:15,644 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2019-01-18 17:56:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:15,741 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-01-18 17:56:15,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-01-18 17:56:15,742 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2019-01-18 17:56:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:15,743 INFO L225 Difference]: With dead ends: 74 [2019-01-18 17:56:15,743 INFO L226 Difference]: Without dead ends: 72 [2019-01-18 17:56:15,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2019-01-18 17:56:15,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-01-18 17:56:15,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-01-18 17:56:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-01-18 17:56:15,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-01-18 17:56:15,746 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2019-01-18 17:56:15,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:15,746 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-01-18 17:56:15,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-18 17:56:15,746 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-01-18 17:56:15,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-18 17:56:15,747 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:15,747 INFO L402 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2019-01-18 17:56:15,747 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:15,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:15,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2078725309, now seen corresponding path program 68 times [2019-01-18 17:56:15,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:15,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:15,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:15,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:15,748 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:17,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:17,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:17,476 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:17,476 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:17,476 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:17,476 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 69 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:17,485 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:56:17,486 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:56:18,003 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 35 check-sat command(s) [2019-01-18 17:56:18,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:18,008 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:18,027 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:23,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:23,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 70, 70] total 139 [2019-01-18 17:56:23,325 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:23,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-01-18 17:56:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-01-18 17:56:23,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 17:56:23,327 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2019-01-18 17:56:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:23,528 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2019-01-18 17:56:23,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-01-18 17:56:23,528 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2019-01-18 17:56:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:23,529 INFO L225 Difference]: With dead ends: 75 [2019-01-18 17:56:23,529 INFO L226 Difference]: Without dead ends: 73 [2019-01-18 17:56:23,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2019-01-18 17:56:23,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-01-18 17:56:23,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-01-18 17:56:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-01-18 17:56:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2019-01-18 17:56:23,531 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2019-01-18 17:56:23,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:23,532 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2019-01-18 17:56:23,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-01-18 17:56:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2019-01-18 17:56:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-01-18 17:56:23,532 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:23,532 INFO L402 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2019-01-18 17:56:23,532 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:23,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash -15973332, now seen corresponding path program 69 times [2019-01-18 17:56:23,533 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:23,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:23,533 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:23,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:23,533 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:23,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:25,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:25,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:25,622 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:25,622 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:25,622 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:25,622 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 70 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:25,631 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:25,631 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:25,694 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:25,694 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:25,697 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:25,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:25,709 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:30,997 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:31,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:31,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71, 71, 71] total 141 [2019-01-18 17:56:31,016 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:31,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2019-01-18 17:56:31,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2019-01-18 17:56:31,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2019-01-18 17:56:31,017 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2019-01-18 17:56:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:31,185 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-01-18 17:56:31,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-01-18 17:56:31,185 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2019-01-18 17:56:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:31,186 INFO L225 Difference]: With dead ends: 76 [2019-01-18 17:56:31,186 INFO L226 Difference]: Without dead ends: 74 [2019-01-18 17:56:31,187 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-01-18 17:56:31,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-01-18 17:56:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-01-18 17:56:31,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-18 17:56:31,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-01-18 17:56:31,190 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2019-01-18 17:56:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:31,190 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-01-18 17:56:31,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2019-01-18 17:56:31,190 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-01-18 17:56:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-01-18 17:56:31,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:31,191 INFO L402 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2019-01-18 17:56:31,191 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:31,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:31,191 INFO L82 PathProgramCache]: Analyzing trace with hash -495171485, now seen corresponding path program 70 times [2019-01-18 17:56:31,191 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:31,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:31,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:31,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:31,192 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:33,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:33,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:33,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:33,400 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:33,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:33,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:33,400 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 71 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:33,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:33,411 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:33,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:33,483 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:38,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:38,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:38,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72, 72, 72] total 143 [2019-01-18 17:56:38,862 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:38,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-01-18 17:56:38,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-01-18 17:56:38,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-18 17:56:38,864 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2019-01-18 17:56:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:39,044 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-01-18 17:56:39,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-01-18 17:56:39,045 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2019-01-18 17:56:39,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:39,046 INFO L225 Difference]: With dead ends: 77 [2019-01-18 17:56:39,046 INFO L226 Difference]: Without dead ends: 75 [2019-01-18 17:56:39,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2019-01-18 17:56:39,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-01-18 17:56:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-01-18 17:56:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-01-18 17:56:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2019-01-18 17:56:39,050 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2019-01-18 17:56:39,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:39,051 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2019-01-18 17:56:39,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-01-18 17:56:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2019-01-18 17:56:39,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-01-18 17:56:39,052 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:39,052 INFO L402 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2019-01-18 17:56:39,052 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:39,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:39,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1829554956, now seen corresponding path program 71 times [2019-01-18 17:56:39,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:39,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:39,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:39,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:39,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:39,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:41,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:41,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:41,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:41,150 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:41,150 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:41,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:41,150 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 72 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:41,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:56:41,159 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:56:41,821 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 37 check-sat command(s) [2019-01-18 17:56:41,821 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:41,827 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:41,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:41,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:47,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:47,345 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:47,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 73, 73] total 145 [2019-01-18 17:56:47,346 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:47,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-18 17:56:47,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-18 17:56:47,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:56:47,348 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2019-01-18 17:56:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:47,491 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-01-18 17:56:47,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-01-18 17:56:47,491 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2019-01-18 17:56:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:47,492 INFO L225 Difference]: With dead ends: 78 [2019-01-18 17:56:47,492 INFO L226 Difference]: Without dead ends: 76 [2019-01-18 17:56:47,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2019-01-18 17:56:47,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-01-18 17:56:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-01-18 17:56:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-01-18 17:56:47,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-01-18 17:56:47,496 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2019-01-18 17:56:47,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:47,496 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-01-18 17:56:47,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-18 17:56:47,496 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-01-18 17:56:47,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-01-18 17:56:47,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:47,497 INFO L402 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-01-18 17:56:47,497 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:47,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:47,497 INFO L82 PathProgramCache]: Analyzing trace with hash 881630595, now seen corresponding path program 72 times [2019-01-18 17:56:47,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:47,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:47,498 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:47,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:47,499 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:47,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:49,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:49,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:49,434 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:49,434 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:49,434 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:49,434 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:49,442 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:56:49,443 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:56:49,509 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:56:49,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:56:49,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:49,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:56:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:55,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:56:55,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 74, 74] total 147 [2019-01-18 17:56:55,362 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:56:55,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-18 17:56:55,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-18 17:56:55,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:56:55,363 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-01-18 17:56:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:56:55,517 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2019-01-18 17:56:55,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-01-18 17:56:55,517 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-01-18 17:56:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:56:55,518 INFO L225 Difference]: With dead ends: 79 [2019-01-18 17:56:55,518 INFO L226 Difference]: Without dead ends: 77 [2019-01-18 17:56:55,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2019-01-18 17:56:55,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-01-18 17:56:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-01-18 17:56:55,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-01-18 17:56:55,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-01-18 17:56:55,521 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2019-01-18 17:56:55,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:56:55,521 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-01-18 17:56:55,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-18 17:56:55,522 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-01-18 17:56:55,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-18 17:56:55,522 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:56:55,522 INFO L402 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-01-18 17:56:55,522 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:56:55,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:56:55,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1560746476, now seen corresponding path program 73 times [2019-01-18 17:56:55,523 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:56:55,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:55,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:56:55,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:56:55,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:56:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:57,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:57,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:56:57,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:56:57,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:56:57,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:56:57,849 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 74 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:56:57,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:56:57,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:56:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:56:57,924 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:56:57,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:56:57,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:03,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:03,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:03,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75, 75, 75] total 149 [2019-01-18 17:57:03,963 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:03,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2019-01-18 17:57:03,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2019-01-18 17:57:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:57:03,965 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2019-01-18 17:57:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:04,125 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-01-18 17:57:04,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-01-18 17:57:04,125 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2019-01-18 17:57:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:04,126 INFO L225 Difference]: With dead ends: 80 [2019-01-18 17:57:04,126 INFO L226 Difference]: Without dead ends: 78 [2019-01-18 17:57:04,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2019-01-18 17:57:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-01-18 17:57:04,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2019-01-18 17:57:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-01-18 17:57:04,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-01-18 17:57:04,129 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2019-01-18 17:57:04,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:04,129 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-01-18 17:57:04,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2019-01-18 17:57:04,129 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-01-18 17:57:04,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-18 17:57:04,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:04,129 INFO L402 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2019-01-18 17:57:04,129 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:04,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:04,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1138502307, now seen corresponding path program 74 times [2019-01-18 17:57:04,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:04,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:04,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:04,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:04,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:04,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:06,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:06,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:06,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:06,303 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:06,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:06,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:06,304 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 75 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:06,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:57:06,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:57:07,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 38 check-sat command(s) [2019-01-18 17:57:07,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:07,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:07,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:07,045 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:13,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:13,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:13,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76, 76, 76] total 151 [2019-01-18 17:57:13,065 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:13,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-01-18 17:57:13,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-01-18 17:57:13,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-18 17:57:13,067 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2019-01-18 17:57:13,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:13,171 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2019-01-18 17:57:13,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-01-18 17:57:13,171 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2019-01-18 17:57:13,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:13,172 INFO L225 Difference]: With dead ends: 81 [2019-01-18 17:57:13,172 INFO L226 Difference]: Without dead ends: 79 [2019-01-18 17:57:13,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2019-01-18 17:57:13,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-01-18 17:57:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2019-01-18 17:57:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-18 17:57:13,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2019-01-18 17:57:13,175 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2019-01-18 17:57:13,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:13,176 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2019-01-18 17:57:13,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-01-18 17:57:13,176 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2019-01-18 17:57:13,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-18 17:57:13,176 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:13,176 INFO L402 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2019-01-18 17:57:13,177 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:13,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:13,177 INFO L82 PathProgramCache]: Analyzing trace with hash 933834956, now seen corresponding path program 75 times [2019-01-18 17:57:13,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:13,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:13,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:13,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:13,178 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:15,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:15,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:15,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:15,253 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:15,253 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:15,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:15,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 76 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:15,263 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:57:15,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:57:15,330 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:57:15,330 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:15,333 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:15,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:15,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:21,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:21,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 77, 77] total 153 [2019-01-18 17:57:21,515 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:21,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-01-18 17:57:21,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-01-18 17:57:21,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:57:21,516 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2019-01-18 17:57:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:21,687 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-01-18 17:57:21,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-01-18 17:57:21,687 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2019-01-18 17:57:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:21,688 INFO L225 Difference]: With dead ends: 82 [2019-01-18 17:57:21,688 INFO L226 Difference]: Without dead ends: 80 [2019-01-18 17:57:21,688 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2019-01-18 17:57:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-01-18 17:57:21,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-01-18 17:57:21,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-01-18 17:57:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-01-18 17:57:21,692 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2019-01-18 17:57:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:21,692 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-01-18 17:57:21,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-01-18 17:57:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-01-18 17:57:21,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-01-18 17:57:21,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:21,692 INFO L402 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2019-01-18 17:57:21,693 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:21,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:21,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1115885629, now seen corresponding path program 76 times [2019-01-18 17:57:21,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:21,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:21,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:21,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:21,694 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:23,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:23,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:23,816 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:23,816 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:23,816 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:23,816 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:23,817 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 77 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:23,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:23,826 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:57:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:23,897 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:23,910 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:30,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:30,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:30,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78, 78, 78] total 155 [2019-01-18 17:57:30,221 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:30,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-01-18 17:57:30,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-01-18 17:57:30,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 17:57:30,222 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2019-01-18 17:57:31,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:31,059 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2019-01-18 17:57:31,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-01-18 17:57:31,059 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2019-01-18 17:57:31,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:31,060 INFO L225 Difference]: With dead ends: 83 [2019-01-18 17:57:31,060 INFO L226 Difference]: Without dead ends: 81 [2019-01-18 17:57:31,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2019-01-18 17:57:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-01-18 17:57:31,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2019-01-18 17:57:31,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-01-18 17:57:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2019-01-18 17:57:31,065 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2019-01-18 17:57:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:31,065 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2019-01-18 17:57:31,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-01-18 17:57:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2019-01-18 17:57:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-18 17:57:31,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:31,066 INFO L402 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2019-01-18 17:57:31,066 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:31,066 INFO L82 PathProgramCache]: Analyzing trace with hash -232714324, now seen corresponding path program 77 times [2019-01-18 17:57:31,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:31,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:31,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:31,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:31,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:33,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:33,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:33,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:33,617 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:33,617 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:33,617 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:33,617 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:33,627 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:57:33,627 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:57:34,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2019-01-18 17:57:34,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:34,429 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:34,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:34,440 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:40,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:40,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:40,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79, 79, 79] total 157 [2019-01-18 17:57:40,837 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:40,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2019-01-18 17:57:40,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2019-01-18 17:57:40,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:57:40,839 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2019-01-18 17:57:41,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:41,484 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-01-18 17:57:41,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2019-01-18 17:57:41,484 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2019-01-18 17:57:41,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:41,485 INFO L225 Difference]: With dead ends: 84 [2019-01-18 17:57:41,485 INFO L226 Difference]: Without dead ends: 82 [2019-01-18 17:57:41,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2019-01-18 17:57:41,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-01-18 17:57:41,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-01-18 17:57:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-01-18 17:57:41,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-01-18 17:57:41,489 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2019-01-18 17:57:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:41,489 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-01-18 17:57:41,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2019-01-18 17:57:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-01-18 17:57:41,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-01-18 17:57:41,490 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:41,490 INFO L402 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2019-01-18 17:57:41,490 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:41,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1375792355, now seen corresponding path program 78 times [2019-01-18 17:57:41,491 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:41,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:41,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:41,491 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:41,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:43,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:43,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:43,965 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:43,965 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:43,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:43,965 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:43,974 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:57:43,974 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:57:44,049 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:57:44,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:57:44,054 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:44,077 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:44,077 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:57:50,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:50,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:57:50,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80, 80, 80] total 159 [2019-01-18 17:57:50,826 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:57:50,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-01-18 17:57:50,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-01-18 17:57:50,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:57:50,828 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2019-01-18 17:57:50,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:57:50,998 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-01-18 17:57:50,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-01-18 17:57:50,999 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2019-01-18 17:57:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:57:50,999 INFO L225 Difference]: With dead ends: 85 [2019-01-18 17:57:51,000 INFO L226 Difference]: Without dead ends: 83 [2019-01-18 17:57:51,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2019-01-18 17:57:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-18 17:57:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2019-01-18 17:57:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-01-18 17:57:51,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2019-01-18 17:57:51,004 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2019-01-18 17:57:51,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:57:51,004 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2019-01-18 17:57:51,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-01-18 17:57:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2019-01-18 17:57:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-01-18 17:57:51,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:57:51,005 INFO L402 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2019-01-18 17:57:51,005 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:57:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:57:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash -300108148, now seen corresponding path program 79 times [2019-01-18 17:57:51,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:57:51,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:51,006 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:57:51,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:57:51,006 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:57:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:53,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:53,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:57:53,854 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:57:53,854 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:57:53,854 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:57:53,854 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 80 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:57:53,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:57:53,862 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:57:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:57:53,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:57:53,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:57:53,969 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:00,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:00,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:00,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 81, 81] total 161 [2019-01-18 17:58:00,756 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:00,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2019-01-18 17:58:00,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2019-01-18 17:58:00,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-18 17:58:00,758 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2019-01-18 17:58:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:00,880 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-01-18 17:58:00,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2019-01-18 17:58:00,880 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2019-01-18 17:58:00,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:00,881 INFO L225 Difference]: With dead ends: 86 [2019-01-18 17:58:00,881 INFO L226 Difference]: Without dead ends: 84 [2019-01-18 17:58:00,882 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2019-01-18 17:58:00,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-01-18 17:58:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-01-18 17:58:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-18 17:58:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-01-18 17:58:00,885 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2019-01-18 17:58:00,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:00,885 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-01-18 17:58:00,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2019-01-18 17:58:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-01-18 17:58:00,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-18 17:58:00,885 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:00,885 INFO L402 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-01-18 17:58:00,885 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:00,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:00,886 INFO L82 PathProgramCache]: Analyzing trace with hash -713416189, now seen corresponding path program 80 times [2019-01-18 17:58:00,886 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:00,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:00,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:00,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:00,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:03,466 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:03,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:03,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:03,467 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:03,467 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:03,467 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:03,467 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 81 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:03,477 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:03,477 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:04,336 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 41 check-sat command(s) [2019-01-18 17:58:04,336 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:04,342 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:04,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:04,361 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:11,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:11,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82, 82, 82] total 163 [2019-01-18 17:58:11,459 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:11,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-01-18 17:58:11,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-01-18 17:58:11,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 17:58:11,461 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-01-18 17:58:11,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:11,652 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2019-01-18 17:58:11,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-01-18 17:58:11,652 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-01-18 17:58:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:11,653 INFO L225 Difference]: With dead ends: 87 [2019-01-18 17:58:11,653 INFO L226 Difference]: Without dead ends: 85 [2019-01-18 17:58:11,654 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2019-01-18 17:58:11,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-18 17:58:11,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-18 17:58:11,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-18 17:58:11,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-01-18 17:58:11,655 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2019-01-18 17:58:11,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:11,656 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-01-18 17:58:11,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-01-18 17:58:11,656 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-01-18 17:58:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-01-18 17:58:11,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:11,656 INFO L402 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-01-18 17:58:11,656 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:11,657 INFO L82 PathProgramCache]: Analyzing trace with hash -641063572, now seen corresponding path program 81 times [2019-01-18 17:58:11,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:11,657 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:11,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:11,658 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:14,360 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:14,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:14,360 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:14,361 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:14,361 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:14,361 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:14,361 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 82 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:14,369 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:14,370 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:14,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:14,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:14,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:14,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:21,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:21,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:21,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83, 83, 83] total 165 [2019-01-18 17:58:21,471 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:21,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2019-01-18 17:58:21,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2019-01-18 17:58:21,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:58:21,473 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2019-01-18 17:58:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:21,662 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-01-18 17:58:21,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-01-18 17:58:21,663 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2019-01-18 17:58:21,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:21,664 INFO L225 Difference]: With dead ends: 88 [2019-01-18 17:58:21,664 INFO L226 Difference]: Without dead ends: 86 [2019-01-18 17:58:21,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2019-01-18 17:58:21,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-01-18 17:58:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-01-18 17:58:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-01-18 17:58:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-01-18 17:58:21,667 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2019-01-18 17:58:21,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:21,667 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-01-18 17:58:21,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2019-01-18 17:58:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-01-18 17:58:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-01-18 17:58:21,668 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:21,668 INFO L402 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2019-01-18 17:58:21,668 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:21,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1601867555, now seen corresponding path program 82 times [2019-01-18 17:58:21,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:21,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:21,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:24,531 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:24,531 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:24,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:24,532 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:24,532 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:24,532 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:24,532 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 83 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:24,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:24,542 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:24,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:24,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:24,638 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:31,825 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:31,844 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:31,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84, 84, 84] total 167 [2019-01-18 17:58:31,844 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:31,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-01-18 17:58:31,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-01-18 17:58:31,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-18 17:58:31,846 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2019-01-18 17:58:31,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:31,990 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2019-01-18 17:58:31,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-01-18 17:58:31,990 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2019-01-18 17:58:31,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:31,991 INFO L225 Difference]: With dead ends: 89 [2019-01-18 17:58:31,991 INFO L226 Difference]: Without dead ends: 87 [2019-01-18 17:58:31,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2019-01-18 17:58:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-01-18 17:58:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-01-18 17:58:31,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-01-18 17:58:31,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2019-01-18 17:58:31,994 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2019-01-18 17:58:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:31,994 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2019-01-18 17:58:31,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-01-18 17:58:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2019-01-18 17:58:31,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-01-18 17:58:31,995 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:31,995 INFO L402 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2019-01-18 17:58:31,995 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:31,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:31,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1881711540, now seen corresponding path program 83 times [2019-01-18 17:58:31,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:31,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:31,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:31,996 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:32,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:34,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:34,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:34,734 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:34,734 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:34,734 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:34,734 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:34,735 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 84 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:34,743 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:58:34,743 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:58:35,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 43 check-sat command(s) [2019-01-18 17:58:35,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:35,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:35,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:35,779 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:42,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:42,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:42,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85, 85, 85] total 169 [2019-01-18 17:58:42,940 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:42,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2019-01-18 17:58:42,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2019-01-18 17:58:42,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 17:58:42,942 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2019-01-18 17:58:43,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:43,093 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-01-18 17:58:43,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2019-01-18 17:58:43,093 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2019-01-18 17:58:43,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:43,094 INFO L225 Difference]: With dead ends: 90 [2019-01-18 17:58:43,094 INFO L226 Difference]: Without dead ends: 88 [2019-01-18 17:58:43,094 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2019-01-18 17:58:43,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-01-18 17:58:43,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-01-18 17:58:43,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-01-18 17:58:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-01-18 17:58:43,097 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2019-01-18 17:58:43,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:43,097 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-01-18 17:58:43,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2019-01-18 17:58:43,098 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-01-18 17:58:43,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-01-18 17:58:43,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:43,098 INFO L402 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2019-01-18 17:58:43,098 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:43,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:43,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1796486211, now seen corresponding path program 84 times [2019-01-18 17:58:43,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:43,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:43,099 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:43,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:43,100 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:45,923 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:45,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:45,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:45,923 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:45,923 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:45,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:45,924 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 85 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:45,933 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:58:45,933 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:58:46,009 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:58:46,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:58:46,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:46,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:46,026 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:58:53,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:53,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:58:53,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86, 86, 86] total 171 [2019-01-18 17:58:53,573 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:58:53,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-01-18 17:58:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-01-18 17:58:53,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:58:53,575 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2019-01-18 17:58:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:58:53,817 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2019-01-18 17:58:53,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-01-18 17:58:53,817 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2019-01-18 17:58:53,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:58:53,818 INFO L225 Difference]: With dead ends: 91 [2019-01-18 17:58:53,818 INFO L226 Difference]: Without dead ends: 89 [2019-01-18 17:58:53,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2019-01-18 17:58:53,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-18 17:58:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2019-01-18 17:58:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-18 17:58:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2019-01-18 17:58:53,821 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2019-01-18 17:58:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:58:53,821 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2019-01-18 17:58:53,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-01-18 17:58:53,821 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2019-01-18 17:58:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-18 17:58:53,822 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:58:53,822 INFO L402 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2019-01-18 17:58:53,822 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:58:53,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:58:53,823 INFO L82 PathProgramCache]: Analyzing trace with hash -143500500, now seen corresponding path program 85 times [2019-01-18 17:58:53,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:58:53,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:53,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:58:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:58:53,824 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:58:53,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:56,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:56,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:56,510 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:58:56,510 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:58:56,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:58:56,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:58:56,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 86 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:58:56,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:58:56,522 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:58:56,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:58:56,600 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:58:56,613 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:58:56,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:04,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:04,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87, 87, 87] total 173 [2019-01-18 17:59:04,450 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:04,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-01-18 17:59:04,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-01-18 17:59:04,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:59:04,452 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2019-01-18 17:59:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:04,807 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-01-18 17:59:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-01-18 17:59:04,807 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2019-01-18 17:59:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:04,808 INFO L225 Difference]: With dead ends: 92 [2019-01-18 17:59:04,808 INFO L226 Difference]: Without dead ends: 90 [2019-01-18 17:59:04,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2019-01-18 17:59:04,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-01-18 17:59:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2019-01-18 17:59:04,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-01-18 17:59:04,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-01-18 17:59:04,811 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2019-01-18 17:59:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:04,811 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-01-18 17:59:04,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2019-01-18 17:59:04,812 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-01-18 17:59:04,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-01-18 17:59:04,812 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:04,812 INFO L402 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2019-01-18 17:59:04,812 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:04,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:04,813 INFO L82 PathProgramCache]: Analyzing trace with hash -153546397, now seen corresponding path program 86 times [2019-01-18 17:59:04,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:04,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:04,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:04,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:04,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:07,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:07,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:07,554 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:07,554 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:07,554 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:07,554 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:07,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 87 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:07,563 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:07,563 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:08,683 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 44 check-sat command(s) [2019-01-18 17:59:08,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:08,690 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:08,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:16,846 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:16,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:16,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88, 88, 88] total 175 [2019-01-18 17:59:16,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:16,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-01-18 17:59:16,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-01-18 17:59:16,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-18 17:59:16,871 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2019-01-18 17:59:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:17,102 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2019-01-18 17:59:17,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-01-18 17:59:17,102 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2019-01-18 17:59:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:17,102 INFO L225 Difference]: With dead ends: 93 [2019-01-18 17:59:17,103 INFO L226 Difference]: Without dead ends: 91 [2019-01-18 17:59:17,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2019-01-18 17:59:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-01-18 17:59:17,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2019-01-18 17:59:17,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-01-18 17:59:17,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2019-01-18 17:59:17,105 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2019-01-18 17:59:17,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:17,106 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2019-01-18 17:59:17,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-01-18 17:59:17,106 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2019-01-18 17:59:17,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-18 17:59:17,106 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:17,106 INFO L402 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2019-01-18 17:59:17,106 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:17,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:17,107 INFO L82 PathProgramCache]: Analyzing trace with hash -464969204, now seen corresponding path program 87 times [2019-01-18 17:59:17,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:17,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:17,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:17,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:17,107 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:20,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:20,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:20,046 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:20,046 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:20,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:20,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:20,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 88 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:20,056 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:59:20,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:59:20,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:59:20,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:20,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:20,162 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:28,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:28,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89, 89, 89] total 177 [2019-01-18 17:59:28,296 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:28,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2019-01-18 17:59:28,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2019-01-18 17:59:28,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 17:59:28,298 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2019-01-18 17:59:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:28,433 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-01-18 17:59:28,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2019-01-18 17:59:28,434 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2019-01-18 17:59:28,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:28,435 INFO L225 Difference]: With dead ends: 94 [2019-01-18 17:59:28,435 INFO L226 Difference]: Without dead ends: 92 [2019-01-18 17:59:28,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2019-01-18 17:59:28,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-01-18 17:59:28,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-01-18 17:59:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-01-18 17:59:28,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-01-18 17:59:28,437 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2019-01-18 17:59:28,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:28,438 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-01-18 17:59:28,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2019-01-18 17:59:28,438 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-01-18 17:59:28,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-18 17:59:28,438 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:28,438 INFO L402 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-01-18 17:59:28,438 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:28,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:28,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1529141629, now seen corresponding path program 88 times [2019-01-18 17:59:28,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:28,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:28,439 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:28,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:28,440 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:31,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:31,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:31,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:31,254 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:31,254 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:31,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:31,254 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 89 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:31,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:31,263 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 17:59:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:31,344 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:31,358 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:31,359 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:39,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:39,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90, 90, 90] total 179 [2019-01-18 17:59:39,640 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:39,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-01-18 17:59:39,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-01-18 17:59:39,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-18 17:59:39,641 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-01-18 17:59:39,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:39,914 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2019-01-18 17:59:39,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-01-18 17:59:39,914 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-01-18 17:59:39,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:39,915 INFO L225 Difference]: With dead ends: 95 [2019-01-18 17:59:39,915 INFO L226 Difference]: Without dead ends: 93 [2019-01-18 17:59:39,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2019-01-18 17:59:39,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-01-18 17:59:39,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-01-18 17:59:39,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-18 17:59:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2019-01-18 17:59:39,917 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2019-01-18 17:59:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:39,918 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2019-01-18 17:59:39,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-01-18 17:59:39,918 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2019-01-18 17:59:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-18 17:59:39,918 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:39,918 INFO L402 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2019-01-18 17:59:39,918 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:39,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash -158748436, now seen corresponding path program 89 times [2019-01-18 17:59:39,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:39,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:39,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 17:59:39,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:39,919 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:42,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:42,759 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:42,759 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:42,759 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:42,759 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:42,760 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:42,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 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 90 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:42,770 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 17:59:42,770 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 17:59:44,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2019-01-18 17:59:44,072 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:44,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:44,092 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 17:59:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:53,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 17:59:53,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91, 91, 91] total 181 [2019-01-18 17:59:53,022 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 17:59:53,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2019-01-18 17:59:53,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2019-01-18 17:59:53,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 17:59:53,024 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2019-01-18 17:59:53,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 17:59:53,158 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-01-18 17:59:53,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2019-01-18 17:59:53,159 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2019-01-18 17:59:53,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 17:59:53,159 INFO L225 Difference]: With dead ends: 96 [2019-01-18 17:59:53,160 INFO L226 Difference]: Without dead ends: 94 [2019-01-18 17:59:53,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2019-01-18 17:59:53,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-01-18 17:59:53,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2019-01-18 17:59:53,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-01-18 17:59:53,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-01-18 17:59:53,164 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2019-01-18 17:59:53,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 17:59:53,164 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-01-18 17:59:53,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2019-01-18 17:59:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-01-18 17:59:53,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-01-18 17:59:53,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 17:59:53,164 INFO L402 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2019-01-18 17:59:53,165 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 17:59:53,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 17:59:53,165 INFO L82 PathProgramCache]: Analyzing trace with hash -626232413, now seen corresponding path program 90 times [2019-01-18 17:59:53,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 17:59:53,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:53,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 17:59:53,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 17:59:53,166 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 17:59:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 17:59:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:56,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:56,317 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 17:59:56,317 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 17:59:56,317 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 17:59:56,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 17:59:56,318 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 91 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 17:59:56,326 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 17:59:56,327 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 17:59:56,408 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 17:59:56,408 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 17:59:56,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 17:59:56,426 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 17:59:56,426 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:05,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:05,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92, 92, 92] total 183 [2019-01-18 18:00:05,558 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:05,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-01-18 18:00:05,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-01-18 18:00:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 18:00:05,560 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2019-01-18 18:00:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:05,842 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2019-01-18 18:00:05,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-01-18 18:00:05,843 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2019-01-18 18:00:05,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:05,843 INFO L225 Difference]: With dead ends: 97 [2019-01-18 18:00:05,843 INFO L226 Difference]: Without dead ends: 95 [2019-01-18 18:00:05,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2019-01-18 18:00:05,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-01-18 18:00:05,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-01-18 18:00:05,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-01-18 18:00:05,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2019-01-18 18:00:05,848 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2019-01-18 18:00:05,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:05,848 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2019-01-18 18:00:05,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-01-18 18:00:05,848 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2019-01-18 18:00:05,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-18 18:00:05,849 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:05,849 INFO L402 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2019-01-18 18:00:05,849 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:05,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:05,849 INFO L82 PathProgramCache]: Analyzing trace with hash 2061633484, now seen corresponding path program 91 times [2019-01-18 18:00:05,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:05,850 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:05,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:05,850 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:08,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:08,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:08,820 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:08,820 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:08,820 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:08,820 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 92 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:08,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:08,829 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:00:08,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:08,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:08,926 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:18,041 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:18,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:18,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93, 93, 93] total 185 [2019-01-18 18:00:18,059 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:18,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2019-01-18 18:00:18,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2019-01-18 18:00:18,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 18:00:18,061 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2019-01-18 18:00:18,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:18,252 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-01-18 18:00:18,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-01-18 18:00:18,253 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2019-01-18 18:00:18,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:18,253 INFO L225 Difference]: With dead ends: 98 [2019-01-18 18:00:18,253 INFO L226 Difference]: Without dead ends: 96 [2019-01-18 18:00:18,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2019-01-18 18:00:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-01-18 18:00:18,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2019-01-18 18:00:18,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-18 18:00:18,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-01-18 18:00:18,256 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2019-01-18 18:00:18,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:18,257 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-01-18 18:00:18,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2019-01-18 18:00:18,257 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-01-18 18:00:18,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-18 18:00:18,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:18,257 INFO L402 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2019-01-18 18:00:18,257 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:18,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:18,258 INFO L82 PathProgramCache]: Analyzing trace with hash -513869629, now seen corresponding path program 92 times [2019-01-18 18:00:18,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:18,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:18,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:18,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:18,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:21,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:21,647 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:21,647 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:21,647 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:21,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:21,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 93 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:21,656 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:00:21,656 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:00:23,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 47 check-sat command(s) [2019-01-18 18:00:23,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:23,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:23,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:23,103 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:32,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:32,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:32,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94, 94, 94] total 187 [2019-01-18 18:00:32,314 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:32,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-01-18 18:00:32,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-01-18 18:00:32,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2019-01-18 18:00:32,316 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2019-01-18 18:00:32,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:32,467 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2019-01-18 18:00:32,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2019-01-18 18:00:32,467 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2019-01-18 18:00:32,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:32,468 INFO L225 Difference]: With dead ends: 99 [2019-01-18 18:00:32,468 INFO L226 Difference]: Without dead ends: 97 [2019-01-18 18:00:32,469 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-01-18 18:00:32,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-01-18 18:00:32,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2019-01-18 18:00:32,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-01-18 18:00:32,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2019-01-18 18:00:32,471 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2019-01-18 18:00:32,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:32,471 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2019-01-18 18:00:32,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-01-18 18:00:32,471 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2019-01-18 18:00:32,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-18 18:00:32,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:32,472 INFO L402 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2019-01-18 18:00:32,472 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:32,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:32,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1249912492, now seen corresponding path program 93 times [2019-01-18 18:00:32,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:32,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:32,473 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:32,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:32,473 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:35,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:35,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:35,584 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:35,584 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:35,584 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:35,584 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 94 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:35,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:00:35,592 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:00:35,675 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:00:35,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:00:35,679 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:35,695 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:35,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:45,085 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:45,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:45,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2019-01-18 18:00:45,104 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:45,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2019-01-18 18:00:45,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2019-01-18 18:00:45,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 18:00:45,106 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2019-01-18 18:00:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:45,256 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-01-18 18:00:45,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2019-01-18 18:00:45,257 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2019-01-18 18:00:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:45,258 INFO L225 Difference]: With dead ends: 100 [2019-01-18 18:00:45,258 INFO L226 Difference]: Without dead ends: 98 [2019-01-18 18:00:45,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2019-01-18 18:00:45,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-01-18 18:00:45,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2019-01-18 18:00:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-18 18:00:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-01-18 18:00:45,261 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2019-01-18 18:00:45,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:45,261 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-01-18 18:00:45,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2019-01-18 18:00:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-01-18 18:00:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-18 18:00:45,261 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:45,262 INFO L402 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2019-01-18 18:00:45,262 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:45,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:45,262 INFO L82 PathProgramCache]: Analyzing trace with hash 92583395, now seen corresponding path program 94 times [2019-01-18 18:00:45,262 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:45,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:45,263 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:00:45,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:45,263 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:45,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:48,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:48,686 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:00:48,687 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:00:48,687 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:00:48,687 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:00:48,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 95 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:00:48,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:48,696 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:00:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:00:48,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:00:48,801 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:48,801 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:00:58,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:00:58,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:00:58,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96, 96, 96] total 191 [2019-01-18 18:00:58,297 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:00:58,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-01-18 18:00:58,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-01-18 18:00:58,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-18 18:00:58,299 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2019-01-18 18:00:58,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:00:58,444 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-01-18 18:00:58,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2019-01-18 18:00:58,444 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2019-01-18 18:00:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:00:58,445 INFO L225 Difference]: With dead ends: 101 [2019-01-18 18:00:58,445 INFO L226 Difference]: Without dead ends: 99 [2019-01-18 18:00:58,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2019-01-18 18:00:58,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-01-18 18:00:58,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2019-01-18 18:00:58,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-18 18:00:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2019-01-18 18:00:58,449 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2019-01-18 18:00:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:00:58,449 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2019-01-18 18:00:58,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-01-18 18:00:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2019-01-18 18:00:58,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-18 18:00:58,450 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:00:58,450 INFO L402 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2019-01-18 18:00:58,450 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:00:58,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:00:58,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1424880244, now seen corresponding path program 95 times [2019-01-18 18:00:58,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:00:58,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:58,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:00:58,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:00:58,451 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:00:58,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:02,046 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:02,046 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:02,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:02,047 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:02,047 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:02,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:02,047 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 96 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:02,055 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:01:02,056 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:01:03,718 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 49 check-sat command(s) [2019-01-18 18:01:03,718 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:03,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:03,739 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:13,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:13,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:13,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97, 97, 97] total 193 [2019-01-18 18:01:13,561 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:13,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2019-01-18 18:01:13,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2019-01-18 18:01:13,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-18 18:01:13,564 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2019-01-18 18:01:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:13,729 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-01-18 18:01:13,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2019-01-18 18:01:13,730 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2019-01-18 18:01:13,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:13,730 INFO L225 Difference]: With dead ends: 102 [2019-01-18 18:01:13,730 INFO L226 Difference]: Without dead ends: 100 [2019-01-18 18:01:13,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2019-01-18 18:01:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-18 18:01:13,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-18 18:01:13,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-18 18:01:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-01-18 18:01:13,734 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2019-01-18 18:01:13,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:13,734 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-01-18 18:01:13,734 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2019-01-18 18:01:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-01-18 18:01:13,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-01-18 18:01:13,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:13,735 INFO L402 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-01-18 18:01:13,735 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:13,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:13,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1221612797, now seen corresponding path program 96 times [2019-01-18 18:01:13,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:13,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:13,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:13,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:13,737 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:13,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:17,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:17,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:17,184 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:17,184 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:17,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:17,184 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 97 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:17,192 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:01:17,192 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:01:17,279 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:01:17,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:17,283 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:17,298 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:17,299 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:27,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:27,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98, 98, 98] total 195 [2019-01-18 18:01:27,020 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:27,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-01-18 18:01:27,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-01-18 18:01:27,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 18:01:27,022 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-01-18 18:01:27,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:27,250 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2019-01-18 18:01:27,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-01-18 18:01:27,251 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-01-18 18:01:27,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:27,251 INFO L225 Difference]: With dead ends: 103 [2019-01-18 18:01:27,251 INFO L226 Difference]: Without dead ends: 101 [2019-01-18 18:01:27,252 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2019-01-18 18:01:27,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-18 18:01:27,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-18 18:01:27,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-18 18:01:27,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-01-18 18:01:27,256 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2019-01-18 18:01:27,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:27,257 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-01-18 18:01:27,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-01-18 18:01:27,257 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-01-18 18:01:27,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-18 18:01:27,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:27,257 INFO L402 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-01-18 18:01:27,257 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:27,258 INFO L82 PathProgramCache]: Analyzing trace with hash 784710764, now seen corresponding path program 97 times [2019-01-18 18:01:27,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:27,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:27,258 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:27,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:27,258 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:30,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:30,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:30,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:30,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:30,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:30,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 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:30,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:30,724 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:01:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:30,814 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:30,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:30,831 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:41,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:41,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 99, 99] total 197 [2019-01-18 18:01:41,001 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:41,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2019-01-18 18:01:41,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2019-01-18 18:01:41,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 18:01:41,003 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2019-01-18 18:01:41,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:41,306 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-01-18 18:01:41,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2019-01-18 18:01:41,306 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2019-01-18 18:01:41,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:41,307 INFO L225 Difference]: With dead ends: 104 [2019-01-18 18:01:41,307 INFO L226 Difference]: Without dead ends: 102 [2019-01-18 18:01:41,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2019-01-18 18:01:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-18 18:01:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-18 18:01:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-18 18:01:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-01-18 18:01:41,311 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2019-01-18 18:01:41,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:41,311 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-01-18 18:01:41,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2019-01-18 18:01:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-01-18 18:01:41,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-01-18 18:01:41,311 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:41,312 INFO L402 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2019-01-18 18:01:41,312 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:41,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:41,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1443768285, now seen corresponding path program 98 times [2019-01-18 18:01:41,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:41,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:41,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:01:41,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:41,313 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:41,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:01:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:44,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:44,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:01:44,944 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:01:44,944 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:01:44,944 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:01:44,944 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:01:44,955 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:01:44,956 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:01:46,766 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 50 check-sat command(s) [2019-01-18 18:01:46,767 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:01:46,774 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:01:46,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:46,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:01:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:01:57,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:01:57,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100, 100, 100] total 199 [2019-01-18 18:01:57,357 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:01:57,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-01-18 18:01:57,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-01-18 18:01:57,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-18 18:01:57,360 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2019-01-18 18:01:57,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:01:57,604 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2019-01-18 18:01:57,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2019-01-18 18:01:57,604 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2019-01-18 18:01:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:01:57,605 INFO L225 Difference]: With dead ends: 105 [2019-01-18 18:01:57,605 INFO L226 Difference]: Without dead ends: 103 [2019-01-18 18:01:57,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2019-01-18 18:01:57,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-18 18:01:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-18 18:01:57,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-18 18:01:57,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2019-01-18 18:01:57,609 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2019-01-18 18:01:57,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:01:57,609 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2019-01-18 18:01:57,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-01-18 18:01:57,609 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2019-01-18 18:01:57,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-18 18:01:57,609 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:01:57,609 INFO L402 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2019-01-18 18:01:57,610 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:01:57,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:01:57,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1807142068, now seen corresponding path program 99 times [2019-01-18 18:01:57,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:01:57,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:57,610 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:01:57,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:01:57,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:01:57,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:01,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:01,212 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:01,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:01,212 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:01,212 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:01,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:01,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 100 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:01,220 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:02:01,221 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:02:01,309 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:02:01,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:01,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:01,329 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:11,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:11,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101, 101, 101] total 201 [2019-01-18 18:02:11,759 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:11,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2019-01-18 18:02:11,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2019-01-18 18:02:11,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 18:02:11,761 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2019-01-18 18:02:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:12,027 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-01-18 18:02:12,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2019-01-18 18:02:12,028 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2019-01-18 18:02:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:12,028 INFO L225 Difference]: With dead ends: 106 [2019-01-18 18:02:12,028 INFO L226 Difference]: Without dead ends: 104 [2019-01-18 18:02:12,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2019-01-18 18:02:12,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-18 18:02:12,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-18 18:02:12,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-18 18:02:12,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-01-18 18:02:12,033 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2019-01-18 18:02:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:12,033 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-01-18 18:02:12,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2019-01-18 18:02:12,034 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-01-18 18:02:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-01-18 18:02:12,034 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:12,034 INFO L402 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2019-01-18 18:02:12,034 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:12,035 INFO L82 PathProgramCache]: Analyzing trace with hash -186827453, now seen corresponding path program 100 times [2019-01-18 18:02:12,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:12,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:12,036 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:12,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:12,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:15,796 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:15,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:15,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:15,797 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:15,797 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:15,797 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:15,797 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 101 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:15,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:15,805 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:02:15,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:15,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:15,909 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:15,909 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:26,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:26,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102, 102, 102] total 203 [2019-01-18 18:02:26,714 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:26,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-01-18 18:02:26,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-01-18 18:02:26,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-18 18:02:26,717 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2019-01-18 18:02:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:26,896 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2019-01-18 18:02:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-01-18 18:02:26,896 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2019-01-18 18:02:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:26,897 INFO L225 Difference]: With dead ends: 107 [2019-01-18 18:02:26,897 INFO L226 Difference]: Without dead ends: 105 [2019-01-18 18:02:26,899 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2019-01-18 18:02:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-18 18:02:26,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-18 18:02:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-18 18:02:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2019-01-18 18:02:26,902 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2019-01-18 18:02:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:26,902 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2019-01-18 18:02:26,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-01-18 18:02:26,902 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2019-01-18 18:02:26,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-01-18 18:02:26,903 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:26,903 INFO L402 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2019-01-18 18:02:26,903 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:26,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:26,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1496681940, now seen corresponding path program 101 times [2019-01-18 18:02:26,904 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:26,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:26,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:02:26,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:26,905 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:30,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:30,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:30,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:30,808 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:30,808 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:30,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:30,808 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 102 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:30,817 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:02:30,817 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:02:32,910 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2019-01-18 18:02:32,910 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:32,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:32,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:32,938 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:02:44,268 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:44,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:02:44,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103, 103, 103] total 205 [2019-01-18 18:02:44,290 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:02:44,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2019-01-18 18:02:44,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2019-01-18 18:02:44,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 18:02:44,293 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2019-01-18 18:02:44,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:02:44,622 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-01-18 18:02:44,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2019-01-18 18:02:44,622 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2019-01-18 18:02:44,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:02:44,623 INFO L225 Difference]: With dead ends: 108 [2019-01-18 18:02:44,623 INFO L226 Difference]: Without dead ends: 106 [2019-01-18 18:02:44,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2019-01-18 18:02:44,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-01-18 18:02:44,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-01-18 18:02:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-18 18:02:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-01-18 18:02:44,627 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2019-01-18 18:02:44,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:02:44,628 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-01-18 18:02:44,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2019-01-18 18:02:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-01-18 18:02:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-01-18 18:02:44,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:02:44,629 INFO L402 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2019-01-18 18:02:44,629 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:02:44,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:02:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash 847501923, now seen corresponding path program 102 times [2019-01-18 18:02:44,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:02:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:44,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:02:44,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:02:44,630 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:02:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:02:48,292 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:48,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:48,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:02:48,293 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:02:48,293 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:02:48,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:02:48,293 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 103 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:02:48,301 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:02:48,301 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:02:48,389 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:02:48,389 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:02:48,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:02:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:02:48,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:00,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:00,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:00,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104, 104, 104] total 207 [2019-01-18 18:03:00,024 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:00,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-01-18 18:03:00,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-01-18 18:03:00,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 18:03:00,027 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2019-01-18 18:03:00,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:00,321 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2019-01-18 18:03:00,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-01-18 18:03:00,322 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2019-01-18 18:03:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:00,322 INFO L225 Difference]: With dead ends: 109 [2019-01-18 18:03:00,322 INFO L226 Difference]: Without dead ends: 107 [2019-01-18 18:03:00,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2019-01-18 18:03:00,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-18 18:03:00,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-18 18:03:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-18 18:03:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2019-01-18 18:03:00,327 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2019-01-18 18:03:00,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:00,327 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2019-01-18 18:03:00,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-01-18 18:03:00,327 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2019-01-18 18:03:00,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-18 18:03:00,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:00,328 INFO L402 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2019-01-18 18:03:00,328 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:00,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:00,328 INFO L82 PathProgramCache]: Analyzing trace with hash 502757644, now seen corresponding path program 103 times [2019-01-18 18:03:00,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:00,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:00,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:00,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:00,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:04,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:04,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:04,203 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:04,203 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:04,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:04,203 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 104 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:04,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:04,214 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:03:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:04,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:04,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:04,334 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:16,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:16,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:16,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105, 105, 105] total 209 [2019-01-18 18:03:16,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:16,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2019-01-18 18:03:16,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2019-01-18 18:03:16,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-18 18:03:16,323 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2019-01-18 18:03:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:16,564 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-01-18 18:03:16,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2019-01-18 18:03:16,571 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2019-01-18 18:03:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:16,572 INFO L225 Difference]: With dead ends: 110 [2019-01-18 18:03:16,572 INFO L226 Difference]: Without dead ends: 108 [2019-01-18 18:03:16,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2019-01-18 18:03:16,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-18 18:03:16,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-18 18:03:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-18 18:03:16,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-01-18 18:03:16,574 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2019-01-18 18:03:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:16,575 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-01-18 18:03:16,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2019-01-18 18:03:16,575 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-01-18 18:03:16,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-01-18 18:03:16,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:16,575 INFO L402 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-01-18 18:03:16,575 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:16,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:16,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1594380413, now seen corresponding path program 104 times [2019-01-18 18:03:16,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:16,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:16,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:16,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:16,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:16,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:20,706 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:20,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:20,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:20,707 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:20,707 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:20,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:20,707 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 105 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:20,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:03:20,715 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:03:23,112 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 53 check-sat command(s) [2019-01-18 18:03:23,112 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:23,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:23,144 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:34,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:34,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106, 106, 106] total 211 [2019-01-18 18:03:34,829 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:34,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-01-18 18:03:34,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-01-18 18:03:34,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-18 18:03:34,831 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-01-18 18:03:35,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:35,061 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2019-01-18 18:03:35,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-01-18 18:03:35,061 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-01-18 18:03:35,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:35,062 INFO L225 Difference]: With dead ends: 111 [2019-01-18 18:03:35,062 INFO L226 Difference]: Without dead ends: 109 [2019-01-18 18:03:35,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2019-01-18 18:03:35,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-18 18:03:35,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-01-18 18:03:35,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-18 18:03:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2019-01-18 18:03:35,066 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2019-01-18 18:03:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:35,066 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2019-01-18 18:03:35,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-01-18 18:03:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2019-01-18 18:03:35,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-01-18 18:03:35,066 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:35,066 INFO L402 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2019-01-18 18:03:35,067 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:35,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:35,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2113816556, now seen corresponding path program 105 times [2019-01-18 18:03:35,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:35,067 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:35,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:35,067 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:35,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:39,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:39,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:39,166 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:39,166 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:39,166 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:39,166 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 106 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:39,174 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:03:39,175 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:03:39,269 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:03:39,269 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:03:39,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:39,291 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:39,291 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:03:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:51,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:03:51,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107, 107, 107] total 213 [2019-01-18 18:03:51,306 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:03:51,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2019-01-18 18:03:51,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2019-01-18 18:03:51,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-18 18:03:51,310 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2019-01-18 18:03:51,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:03:51,577 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-01-18 18:03:51,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2019-01-18 18:03:51,577 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2019-01-18 18:03:51,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:03:51,578 INFO L225 Difference]: With dead ends: 112 [2019-01-18 18:03:51,578 INFO L226 Difference]: Without dead ends: 110 [2019-01-18 18:03:51,580 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2019-01-18 18:03:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-18 18:03:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-18 18:03:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-18 18:03:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-01-18 18:03:51,583 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2019-01-18 18:03:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:03:51,583 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-01-18 18:03:51,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2019-01-18 18:03:51,584 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-01-18 18:03:51,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-01-18 18:03:51,584 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:03:51,584 INFO L402 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2019-01-18 18:03:51,585 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:03:51,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:03:51,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1103805603, now seen corresponding path program 106 times [2019-01-18 18:03:51,585 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:03:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:51,586 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:03:51,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:03:51,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:03:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:55,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:55,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:03:55,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:03:55,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:03:55,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:03:55,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 107 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:03:55,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:03:55,498 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:03:55,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:03:55,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:03:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:03:55,606 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:07,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:07,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:07,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108, 108, 108] total 215 [2019-01-18 18:04:07,779 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:07,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-01-18 18:04:07,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-01-18 18:04:07,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-18 18:04:07,781 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2019-01-18 18:04:08,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:08,059 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2019-01-18 18:04:08,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2019-01-18 18:04:08,059 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2019-01-18 18:04:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:08,059 INFO L225 Difference]: With dead ends: 113 [2019-01-18 18:04:08,059 INFO L226 Difference]: Without dead ends: 111 [2019-01-18 18:04:08,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2019-01-18 18:04:08,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-18 18:04:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-18 18:04:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-18 18:04:08,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2019-01-18 18:04:08,063 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2019-01-18 18:04:08,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:08,064 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2019-01-18 18:04:08,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-01-18 18:04:08,064 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2019-01-18 18:04:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-01-18 18:04:08,064 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:08,065 INFO L402 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2019-01-18 18:04:08,065 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:08,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:08,065 INFO L82 PathProgramCache]: Analyzing trace with hash -141762868, now seen corresponding path program 107 times [2019-01-18 18:04:08,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:08,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:08,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:04:08,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:08,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:12,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:12,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:12,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:12,370 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:12,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:12,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:12,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 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 108 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:04:12,397 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:04:12,397 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:04:15,167 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 55 check-sat command(s) [2019-01-18 18:04:15,168 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:15,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:15,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:15,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:28,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:28,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109, 109, 109] total 217 [2019-01-18 18:04:28,202 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:28,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2019-01-18 18:04:28,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2019-01-18 18:04:28,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-18 18:04:28,205 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2019-01-18 18:04:28,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:28,570 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-01-18 18:04:28,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2019-01-18 18:04:28,570 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2019-01-18 18:04:28,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:28,570 INFO L225 Difference]: With dead ends: 114 [2019-01-18 18:04:28,571 INFO L226 Difference]: Without dead ends: 112 [2019-01-18 18:04:28,572 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2019-01-18 18:04:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-18 18:04:28,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-18 18:04:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-18 18:04:28,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-01-18 18:04:28,574 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2019-01-18 18:04:28,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:28,574 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-01-18 18:04:28,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2019-01-18 18:04:28,574 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-01-18 18:04:28,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-01-18 18:04:28,575 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:28,575 INFO L402 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2019-01-18 18:04:28,575 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:28,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:28,575 INFO L82 PathProgramCache]: Analyzing trace with hash -99679805, now seen corresponding path program 108 times [2019-01-18 18:04:28,575 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:28,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:28,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:28,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:28,576 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:32,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:32,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:32,879 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:32,879 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:32,880 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:32,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:32,880 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 109 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:04:32,888 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:04:32,888 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:04:32,983 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:04:32,983 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:04:32,988 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:33,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:33,007 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:04:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:45,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:04:45,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110, 110, 110] total 219 [2019-01-18 18:04:45,328 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:04:45,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-01-18 18:04:45,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-01-18 18:04:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-18 18:04:45,330 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2019-01-18 18:04:45,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:04:45,600 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2019-01-18 18:04:45,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2019-01-18 18:04:45,600 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2019-01-18 18:04:45,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:04:45,601 INFO L225 Difference]: With dead ends: 115 [2019-01-18 18:04:45,601 INFO L226 Difference]: Without dead ends: 113 [2019-01-18 18:04:45,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2019-01-18 18:04:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-18 18:04:45,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-18 18:04:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-18 18:04:45,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2019-01-18 18:04:45,606 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2019-01-18 18:04:45,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:04:45,606 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2019-01-18 18:04:45,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-01-18 18:04:45,606 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2019-01-18 18:04:45,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-18 18:04:45,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:04:45,607 INFO L402 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2019-01-18 18:04:45,607 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:04:45,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:04:45,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1204895148, now seen corresponding path program 109 times [2019-01-18 18:04:45,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:04:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:45,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:04:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:04:45,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:04:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:50,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:50,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:50,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:04:50,051 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:04:50,051 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:04:50,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:04:50,051 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 110 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:04:50,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:04:50,060 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-01-18 18:04:50,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:04:50,156 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:04:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:04:50,177 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:03,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:03,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111, 111, 111] total 221 [2019-01-18 18:05:03,272 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:03,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2019-01-18 18:05:03,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2019-01-18 18:05:03,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-18 18:05:03,275 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2019-01-18 18:05:03,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:03,499 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-01-18 18:05:03,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2019-01-18 18:05:03,500 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2019-01-18 18:05:03,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:03,500 INFO L225 Difference]: With dead ends: 116 [2019-01-18 18:05:03,500 INFO L226 Difference]: Without dead ends: 114 [2019-01-18 18:05:03,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2019-01-18 18:05:03,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-18 18:05:03,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-18 18:05:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-18 18:05:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-01-18 18:05:03,505 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2019-01-18 18:05:03,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:03,505 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-01-18 18:05:03,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2019-01-18 18:05:03,505 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-01-18 18:05:03,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-01-18 18:05:03,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:03,506 INFO L402 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2019-01-18 18:05:03,506 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:05:03,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:03,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954269, now seen corresponding path program 110 times [2019-01-18 18:05:03,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:03,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:03,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-18 18:05:03,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:03,507 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:08,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:08,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:08,066 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:08,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:08,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:08,066 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 111 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-18 18:05:08,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-18 18:05:08,093 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-01-18 18:05:10,922 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 56 check-sat command(s) [2019-01-18 18:05:10,922 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:05:10,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:10,950 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:10,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-01-18 18:05:24,441 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:24,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-01-18 18:05:24,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112, 112, 112] total 223 [2019-01-18 18:05:24,464 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-01-18 18:05:24,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-01-18 18:05:24,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-01-18 18:05:24,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-18 18:05:24,467 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2019-01-18 18:05:24,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-18 18:05:24,873 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2019-01-18 18:05:24,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2019-01-18 18:05:24,874 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2019-01-18 18:05:24,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-18 18:05:24,874 INFO L225 Difference]: With dead ends: 117 [2019-01-18 18:05:24,874 INFO L226 Difference]: Without dead ends: 115 [2019-01-18 18:05:24,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2019-01-18 18:05:24,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-18 18:05:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2019-01-18 18:05:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-01-18 18:05:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2019-01-18 18:05:24,879 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2019-01-18 18:05:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-18 18:05:24,879 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2019-01-18 18:05:24,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-01-18 18:05:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2019-01-18 18:05:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-01-18 18:05:24,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-18 18:05:24,880 INFO L402 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2019-01-18 18:05:24,880 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-18 18:05:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-18 18:05:24,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1736874868, now seen corresponding path program 111 times [2019-01-18 18:05:24,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-18 18:05:24,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:24,882 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-18 18:05:24,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-18 18:05:24,882 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-18 18:05:24,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-18 18:05:29,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:29,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:29,555 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-18 18:05:29,555 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-01-18 18:05:29,555 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-01-18 18:05:29,555 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-18 18:05:29,555 INFO 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-01-18 18:05:29,563 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-18 18:05:29,564 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-01-18 18:05:29,666 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-18 18:05:29,666 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-18 18:05:29,671 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-18 18:05:29,690 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-18 18:05:29,690 INFO L316 TraceCheckSpWp]: Computing backward predicates...