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/real-life/divisibilityWithArray.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-18 09:52:39,437 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-18 09:52:39,439 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-18 09:52:39,451 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-18 09:52:39,451 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-18 09:52:39,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-18 09:52:39,454 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-18 09:52:39,456 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-18 09:52:39,458 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-18 09:52:39,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-18 09:52:39,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-18 09:52:39,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-18 09:52:39,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-18 09:52:39,462 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-18 09:52:39,464 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-18 09:52:39,465 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-18 09:52:39,465 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-18 09:52:39,468 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-18 09:52:39,470 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-18 09:52:39,472 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-18 09:52:39,473 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-18 09:52:39,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-18 09:52:39,477 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-18 09:52:39,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-18 09:52:39,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-18 09:52:39,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-18 09:52:39,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-18 09:52:39,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-18 09:52:39,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-18 09:52:39,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-18 09:52:39,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-18 09:52:39,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-18 09:52:39,485 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-18 09:52:39,485 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-18 09:52:39,486 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-18 09:52:39,487 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-18 09:52:39,487 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-02-18 09:52:39,501 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-18 09:52:39,501 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-18 09:52:39,506 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-18 09:52:39,506 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-18 09:52:39,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-18 09:52:39,507 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-18 09:52:39,507 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-18 09:52:39,507 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-18 09:52:39,507 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-18 09:52:39,507 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-18 09:52:39,508 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-18 09:52:39,508 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-18 09:52:39,508 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-18 09:52:39,509 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-18 09:52:39,509 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-18 09:52:39,509 INFO L133 SettingsManager]: * Use SBE=true [2019-02-18 09:52:39,510 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-18 09:52:39,510 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-18 09:52:39,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-18 09:52:39,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-18 09:52:39,510 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-18 09:52:39,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-18 09:52:39,513 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-18 09:52:39,513 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-18 09:52:39,513 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-18 09:52:39,514 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-18 09:52:39,514 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-18 09:52:39,514 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-18 09:52:39,514 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-18 09:52:39,514 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-18 09:52:39,515 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:52:39,515 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-18 09:52:39,515 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-18 09:52:39,515 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-18 09:52:39,515 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-18 09:52:39,516 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-18 09:52:39,517 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in [2019-02-18 09:52:39,518 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-18 09:52:39,518 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-18 09:52:39,558 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-18 09:52:39,575 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-18 09:52:39,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-18 09:52:39,583 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-18 09:52:39,584 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-18 09:52:39,585 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl [2019-02-18 09:52:39,585 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/real-life/divisibilityWithArray.bpl' [2019-02-18 09:52:39,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-18 09:52:39,626 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-18 09:52:39,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-18 09:52:39,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-18 09:52:39,627 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-18 09:52:39,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,658 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,665 WARN L165 Inliner]: Program contained no entry procedure! [2019-02-18 09:52:39,665 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-02-18 09:52:39,665 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-02-18 09:52:39,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-18 09:52:39,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-18 09:52:39,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-18 09:52:39,670 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-18 09:52:39,681 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,681 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,682 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/1) ... [2019-02-18 09:52:39,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-18 09:52:39,697 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-18 09:52:39,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-18 09:52:39,702 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-18 09:52:39,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (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:8092 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:8092 -smt2 -in -t:10000 [2019-02-18 09:52:39,777 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-02-18 09:52:39,777 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-02-18 09:52:39,777 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-02-18 09:52:39,985 INFO L278 CfgBuilder]: Using library mode [2019-02-18 09:52:39,985 INFO L286 CfgBuilder]: Removed 0 assue(true) statements. [2019-02-18 09:52:39,986 INFO L202 PluginConnector]: Adding new model divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:52:39 BoogieIcfgContainer [2019-02-18 09:52:39,987 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-18 09:52:39,988 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-18 09:52:39,988 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-18 09:52:39,991 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-18 09:52:39,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.02 09:52:39" (1/2) ... [2019-02-18 09:52:39,993 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41c56965 and model type divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.02 09:52:39, skipping insertion in model container [2019-02-18 09:52:39,993 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "divisibilityWithArray.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.02 09:52:39" (2/2) ... [2019-02-18 09:52:39,995 INFO L112 eAbstractionObserver]: Analyzing ICFG divisibilityWithArray.bpl [2019-02-18 09:52:40,005 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-18 09:52:40,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-18 09:52:40,030 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-18 09:52:40,061 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-18 09:52:40,061 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-18 09:52:40,061 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-18 09:52:40,062 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-18 09:52:40,062 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-18 09:52:40,062 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-18 09:52:40,062 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-18 09:52:40,062 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-18 09:52:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-18 09:52:40,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-18 09:52:40,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:40,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-18 09:52:40,087 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:40,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:40,094 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2019-02-18 09:52:40,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:40,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:40,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:40,622 WARN L181 SmtUtils]: Spent 333.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 19 [2019-02-18 09:52:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:40,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-18 09:52:40,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-18 09:52:40,712 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-18 09:52:40,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-18 09:52:40,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-18 09:52:40,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:52:40,729 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 4 states. [2019-02-18 09:52:40,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:40,856 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-18 09:52:40,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-18 09:52:40,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-02-18 09:52:40,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:40,870 INFO L225 Difference]: With dead ends: 14 [2019-02-18 09:52:40,870 INFO L226 Difference]: Without dead ends: 7 [2019-02-18 09:52:40,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-18 09:52:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-18 09:52:40,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-02-18 09:52:40,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-18 09:52:40,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-02-18 09:52:40,906 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2019-02-18 09:52:40,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:40,906 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-02-18 09:52:40,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-18 09:52:40,907 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-02-18 09:52:40,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-18 09:52:40,907 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:40,907 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-02-18 09:52:40,907 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:40,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:40,908 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2019-02-18 09:52:40,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:40,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:40,910 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:41,293 WARN L181 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2019-02-18 09:52:41,512 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-02-18 09:52:41,651 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-02-18 09:52:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:41,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:41,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:41,655 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2019-02-18 09:52:41,657 INFO L207 CegarAbsIntRunner]: [0], [4], [5], [6] [2019-02-18 09:52:41,730 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-18 09:52:41,730 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-18 09:52:42,393 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-18 09:52:42,394 INFO L272 AbstractInterpreter]: Visited 4 different actions 25 times. Merged at 3 different actions 21 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-02-18 09:52:42,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:42,403 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-18 09:52:42,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:42,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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:42,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:42,414 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:42,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:42,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:42,571 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:42,573 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:42,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:42,619 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:42,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:42,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:42,771 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:42,771 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:42,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:42,971 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:42,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:42,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2019-02-18 09:52:42,993 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:42,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-02-18 09:52:42,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-02-18 09:52:42,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:52:42,995 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 9 states. [2019-02-18 09:52:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:43,270 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-02-18 09:52:43,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-18 09:52:43,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 5 [2019-02-18 09:52:43,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:43,273 INFO L225 Difference]: With dead ends: 10 [2019-02-18 09:52:43,273 INFO L226 Difference]: Without dead ends: 9 [2019-02-18 09:52:43,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-02-18 09:52:43,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-02-18 09:52:43,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2019-02-18 09:52:43,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-02-18 09:52:43,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-02-18 09:52:43,279 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2019-02-18 09:52:43,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:43,280 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-02-18 09:52:43,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-02-18 09:52:43,280 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-18 09:52:43,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-02-18 09:52:43,281 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:43,281 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2019-02-18 09:52:43,281 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:43,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:43,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2019-02-18 09:52:43,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:43,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:43,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:43,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:43,286 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:43,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,595 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:43,595 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:43,596 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:43,596 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:43,596 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:43,606 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:43,606 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:43,652 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-02-18 09:52:43,652 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:43,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:43,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:43,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:43,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:43,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:43,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:43,773 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:43,787 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:43,788 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:43,796 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:43,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:43,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:43,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2019-02-18 09:52:43,996 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:43,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-02-18 09:52:43,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-02-18 09:52:43,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:52:43,998 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 11 states. [2019-02-18 09:52:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:44,064 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-02-18 09:52:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-02-18 09:52:44,064 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 7 [2019-02-18 09:52:44,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:44,065 INFO L225 Difference]: With dead ends: 12 [2019-02-18 09:52:44,065 INFO L226 Difference]: Without dead ends: 11 [2019-02-18 09:52:44,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-02-18 09:52:44,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-02-18 09:52:44,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2019-02-18 09:52:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-02-18 09:52:44,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-02-18 09:52:44,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2019-02-18 09:52:44,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:44,070 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-02-18 09:52:44,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-02-18 09:52:44,070 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-02-18 09:52:44,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-02-18 09:52:44,071 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:44,071 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2019-02-18 09:52:44,071 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:44,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:44,072 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2019-02-18 09:52:44,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:44,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:44,073 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:44,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:44,074 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:44,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:44,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:44,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:44,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:44,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:44,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:44,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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:44,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:44,401 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:44,406 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:44,406 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:44,409 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:44,416 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:44,416 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:44,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:44,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:44,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:44,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:44,695 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:44,696 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:44,704 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:44,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:44,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:44,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2019-02-18 09:52:44,896 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:44,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-02-18 09:52:44,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-02-18 09:52:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:52:44,897 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 13 states. [2019-02-18 09:52:45,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:45,053 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-02-18 09:52:45,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-02-18 09:52:45,055 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 9 [2019-02-18 09:52:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:45,055 INFO L225 Difference]: With dead ends: 14 [2019-02-18 09:52:45,055 INFO L226 Difference]: Without dead ends: 13 [2019-02-18 09:52:45,056 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2019-02-18 09:52:45,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-02-18 09:52:45,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2019-02-18 09:52:45,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-02-18 09:52:45,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-02-18 09:52:45,059 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-02-18 09:52:45,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:45,060 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-02-18 09:52:45,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-02-18 09:52:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-02-18 09:52:45,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-02-18 09:52:45,060 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:45,060 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2019-02-18 09:52:45,060 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:45,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:45,061 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2019-02-18 09:52:45,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:45,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:45,062 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:45,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:45,062 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:45,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:45,406 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:45,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:45,407 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:45,407 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:45,407 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:45,408 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:45,408 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:45,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:45,424 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:45,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:45,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:45,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:45,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:45,466 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:45,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:45,660 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:45,664 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:45,664 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:45,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:45,817 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:45,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:45,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 20 [2019-02-18 09:52:45,839 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:45,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-02-18 09:52:45,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-02-18 09:52:45,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:52:45,841 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 15 states. [2019-02-18 09:52:45,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:45,954 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-02-18 09:52:45,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-02-18 09:52:45,954 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 11 [2019-02-18 09:52:45,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:45,955 INFO L225 Difference]: With dead ends: 16 [2019-02-18 09:52:45,956 INFO L226 Difference]: Without dead ends: 15 [2019-02-18 09:52:45,957 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2019-02-18 09:52:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-02-18 09:52:45,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-02-18 09:52:45,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-02-18 09:52:45,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-02-18 09:52:45,960 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-02-18 09:52:45,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:45,960 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-02-18 09:52:45,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-02-18 09:52:45,960 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-02-18 09:52:45,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-02-18 09:52:45,961 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:45,961 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2019-02-18 09:52:45,961 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2019-02-18 09:52:45,961 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:45,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:45,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:45,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:45,962 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:45,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:46,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:46,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,258 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:46,258 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:46,258 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:46,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:46,259 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:46,267 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:46,267 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:46,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-02-18 09:52:46,277 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:46,278 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:46,282 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:46,283 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:46,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:46,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:46,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:46,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:46,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:46,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:46,465 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:46,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:46,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:46,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23 [2019-02-18 09:52:46,849 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:46,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-02-18 09:52:46,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-02-18 09:52:46,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-18 09:52:46,851 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 17 states. [2019-02-18 09:52:47,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:47,043 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-02-18 09:52:47,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-02-18 09:52:47,044 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-02-18 09:52:47,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:47,045 INFO L225 Difference]: With dead ends: 18 [2019-02-18 09:52:47,045 INFO L226 Difference]: Without dead ends: 17 [2019-02-18 09:52:47,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2019-02-18 09:52:47,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-02-18 09:52:47,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2019-02-18 09:52:47,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-02-18 09:52:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-02-18 09:52:47,050 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-02-18 09:52:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:47,050 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-02-18 09:52:47,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-02-18 09:52:47,051 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-02-18 09:52:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-02-18 09:52:47,051 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:47,051 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2019-02-18 09:52:47,052 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:47,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:47,052 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2019-02-18 09:52:47,052 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:47,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:47,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:47,054 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:47,564 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:52:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:47,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,714 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:47,714 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:47,714 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:47,714 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:47,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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:47,727 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:47,728 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:47,753 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:47,753 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:47,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:47,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:47,760 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:47,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:47,763 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:47,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:47,921 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:47,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:47,970 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:47,984 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:47,984 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:48,229 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:48,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:48,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2019-02-18 09:52:48,249 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:48,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-02-18 09:52:48,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-02-18 09:52:48,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:52:48,251 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 19 states. [2019-02-18 09:52:48,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:48,514 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-02-18 09:52:48,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-02-18 09:52:48,514 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-02-18 09:52:48,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:48,515 INFO L225 Difference]: With dead ends: 20 [2019-02-18 09:52:48,515 INFO L226 Difference]: Without dead ends: 19 [2019-02-18 09:52:48,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2019-02-18 09:52:48,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-02-18 09:52:48,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2019-02-18 09:52:48,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-02-18 09:52:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-02-18 09:52:48,520 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2019-02-18 09:52:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:48,520 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-02-18 09:52:48,520 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-02-18 09:52:48,521 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-02-18 09:52:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-02-18 09:52:48,521 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:48,521 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2019-02-18 09:52:48,521 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:48,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:48,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2019-02-18 09:52:48,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:48,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:48,523 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:48,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:48,523 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:48,901 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:48,901 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:48,901 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:48,902 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:48,902 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:48,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:48,902 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:48,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:48,912 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:48,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:48,921 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:48,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:48,925 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:48,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:48,928 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:49,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:49,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:49,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:49,157 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:49,170 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:49,171 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:49,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:49,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 29 [2019-02-18 09:52:49,438 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:49,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-02-18 09:52:49,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-02-18 09:52:49,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-18 09:52:49,439 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 21 states. [2019-02-18 09:52:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:49,795 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-02-18 09:52:49,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-02-18 09:52:49,796 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 17 [2019-02-18 09:52:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:49,797 INFO L225 Difference]: With dead ends: 22 [2019-02-18 09:52:49,797 INFO L226 Difference]: Without dead ends: 21 [2019-02-18 09:52:49,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2019-02-18 09:52:49,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-02-18 09:52:49,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2019-02-18 09:52:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-02-18 09:52:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-02-18 09:52:49,803 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2019-02-18 09:52:49,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:49,803 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-02-18 09:52:49,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-02-18 09:52:49,803 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-02-18 09:52:49,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-02-18 09:52:49,804 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:49,804 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2019-02-18 09:52:49,804 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:49,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:49,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2019-02-18 09:52:49,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:49,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:49,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:49,806 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:50,195 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:50,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:50,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:50,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:50,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:50,196 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:50,196 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:50,204 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:50,204 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:50,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-02-18 09:52:50,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:50,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:50,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:50,222 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:50,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:50,228 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:50,435 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:50,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:50,439 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:50,439 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:50,454 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:50,455 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:50,905 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:50,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:50,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 32 [2019-02-18 09:52:50,924 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:50,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-02-18 09:52:50,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-02-18 09:52:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:52:50,926 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 23 states. [2019-02-18 09:52:51,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:51,270 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-02-18 09:52:51,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-02-18 09:52:51,271 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 19 [2019-02-18 09:52:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:51,272 INFO L225 Difference]: With dead ends: 24 [2019-02-18 09:52:51,272 INFO L226 Difference]: Without dead ends: 23 [2019-02-18 09:52:51,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=184, Invalid=938, Unknown=0, NotChecked=0, Total=1122 [2019-02-18 09:52:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-02-18 09:52:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2019-02-18 09:52:51,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-02-18 09:52:51,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-02-18 09:52:51,277 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2019-02-18 09:52:51,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:51,277 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-02-18 09:52:51,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-02-18 09:52:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-02-18 09:52:51,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-02-18 09:52:51,278 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:51,278 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2019-02-18 09:52:51,278 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:51,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:51,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2019-02-18 09:52:51,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:51,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:51,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:51,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:51,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:51,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:51,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:51,770 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:51,770 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:51,770 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:51,770 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:51,781 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:51,781 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:51,789 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:51,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:51,792 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:51,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:51,809 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:51,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:51,842 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:52,205 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:52,206 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:52,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:52,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:52,229 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:52,614 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:52,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:52,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2019-02-18 09:52:52,634 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:52,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-02-18 09:52:52,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-02-18 09:52:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-02-18 09:52:52,635 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 25 states. [2019-02-18 09:52:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:52,902 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2019-02-18 09:52:52,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-02-18 09:52:52,902 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 21 [2019-02-18 09:52:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:52,903 INFO L225 Difference]: With dead ends: 26 [2019-02-18 09:52:52,903 INFO L226 Difference]: Without dead ends: 25 [2019-02-18 09:52:52,905 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=212, Invalid=1120, Unknown=0, NotChecked=0, Total=1332 [2019-02-18 09:52:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-02-18 09:52:52,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-02-18 09:52:52,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-02-18 09:52:52,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-02-18 09:52:52,909 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2019-02-18 09:52:52,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:52,910 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-02-18 09:52:52,910 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-02-18 09:52:52,910 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-02-18 09:52:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-02-18 09:52:52,911 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:52,911 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2019-02-18 09:52:52,911 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:52,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:52,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2019-02-18 09:52:52,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:52,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:52,912 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:52,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:52,913 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:53,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:53,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:53,352 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:53,352 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:53,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:53,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:53,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:53,362 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:53,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:53,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:53,399 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:53,400 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:53,416 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:53,416 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:53,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:53,664 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:53,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:53,670 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:53,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:54,268 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:54,287 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:54,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 38 [2019-02-18 09:52:54,287 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:54,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-02-18 09:52:54,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-02-18 09:52:54,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:52:54,289 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 27 states. [2019-02-18 09:52:54,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:54,708 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-02-18 09:52:54,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-02-18 09:52:54,708 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 23 [2019-02-18 09:52:54,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:54,709 INFO L225 Difference]: With dead ends: 28 [2019-02-18 09:52:54,709 INFO L226 Difference]: Without dead ends: 27 [2019-02-18 09:52:54,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=242, Invalid=1318, Unknown=0, NotChecked=0, Total=1560 [2019-02-18 09:52:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-02-18 09:52:54,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2019-02-18 09:52:54,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-02-18 09:52:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-02-18 09:52:54,715 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2019-02-18 09:52:54,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:54,716 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-02-18 09:52:54,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-02-18 09:52:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-02-18 09:52:54,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-02-18 09:52:54,716 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:54,716 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2019-02-18 09:52:54,717 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:54,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:54,717 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2019-02-18 09:52:54,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:54,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:54,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:54,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:55,074 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:52:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:55,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:55,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:55,450 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:55,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:55,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:55,450 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:55,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:52:55,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:52:55,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-02-18 09:52:55,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:55,474 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:55,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:55,478 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:55,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:55,485 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:55,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:55,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:55,813 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:55,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:55,830 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:55,830 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:56,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:56,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 41 [2019-02-18 09:52:56,421 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:56,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-02-18 09:52:56,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-02-18 09:52:56,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-18 09:52:56,422 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 29 states. [2019-02-18 09:52:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:56,781 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-02-18 09:52:56,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-02-18 09:52:56,781 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 25 [2019-02-18 09:52:56,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:56,782 INFO L225 Difference]: With dead ends: 30 [2019-02-18 09:52:56,782 INFO L226 Difference]: Without dead ends: 29 [2019-02-18 09:52:56,784 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2019-02-18 09:52:56,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-02-18 09:52:56,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-02-18 09:52:56,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-02-18 09:52:56,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-02-18 09:52:56,788 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2019-02-18 09:52:56,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:56,789 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-02-18 09:52:56,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-02-18 09:52:56,789 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-02-18 09:52:56,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-02-18 09:52:56,790 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:56,790 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2019-02-18 09:52:56,790 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:56,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:56,790 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2019-02-18 09:52:56,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:56,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:56,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:56,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:56,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:56,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:57,428 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:57,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:57,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:57,429 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:57,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:57,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:57,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 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:57,438 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:52:57,439 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:52:57,455 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:52:57,455 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:52:57,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:57,461 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:57,462 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:57,470 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:57,471 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:52:57,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:52:57,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:57,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:57,815 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:52:57,834 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:57,835 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:52:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:58,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:52:58,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 44 [2019-02-18 09:52:58,379 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:52:58,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-02-18 09:52:58,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-02-18 09:52:58,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:52:58,381 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 31 states. [2019-02-18 09:52:58,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:52:58,846 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2019-02-18 09:52:58,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-02-18 09:52:58,847 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 27 [2019-02-18 09:52:58,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:52:58,848 INFO L225 Difference]: With dead ends: 32 [2019-02-18 09:52:58,848 INFO L226 Difference]: Without dead ends: 31 [2019-02-18 09:52:58,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=308, Invalid=1762, Unknown=0, NotChecked=0, Total=2070 [2019-02-18 09:52:58,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-02-18 09:52:58,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2019-02-18 09:52:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-02-18 09:52:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-02-18 09:52:58,854 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2019-02-18 09:52:58,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:52:58,854 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-02-18 09:52:58,855 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-02-18 09:52:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-02-18 09:52:58,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-02-18 09:52:58,855 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:52:58,856 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2019-02-18 09:52:58,856 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:52:58,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:52:58,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2019-02-18 09:52:58,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:52:58,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:58,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:52:58,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:52:58,858 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:52:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:52:59,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:59,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:52:59,848 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:52:59,848 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:52:59,848 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:52:59,848 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:52:59,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:52:59,859 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:52:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:52:59,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:52:59,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:52:59,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:52:59,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:52:59,884 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:00,307 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:00,308 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:00,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:00,314 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:00,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:00,936 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:00,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:00,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 47 [2019-02-18 09:53:00,955 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:00,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-02-18 09:53:00,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-02-18 09:53:00,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-18 09:53:00,957 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 33 states. [2019-02-18 09:53:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:01,732 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2019-02-18 09:53:01,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-02-18 09:53:01,732 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 29 [2019-02-18 09:53:01,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:01,733 INFO L225 Difference]: With dead ends: 34 [2019-02-18 09:53:01,733 INFO L226 Difference]: Without dead ends: 33 [2019-02-18 09:53:01,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 540 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=344, Invalid=2008, Unknown=0, NotChecked=0, Total=2352 [2019-02-18 09:53:01,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-02-18 09:53:01,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-02-18 09:53:01,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-02-18 09:53:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-02-18 09:53:01,740 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2019-02-18 09:53:01,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:01,740 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-02-18 09:53:01,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-02-18 09:53:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-02-18 09:53:01,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-02-18 09:53:01,741 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:01,741 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2019-02-18 09:53:01,741 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:01,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:01,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2019-02-18 09:53:01,742 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:01,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:01,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:01,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:01,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:01,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:02,856 WARN L181 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 7 [2019-02-18 09:53:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:02,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:02,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:02,863 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:02,863 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:02,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:02,863 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:02,886 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:02,886 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:02,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-02-18 09:53:02,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:02,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:02,984 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:02,985 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:02,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:02,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:03,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:03,397 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:03,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:03,401 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:03,425 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:03,425 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:04,796 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:04,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:04,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 50 [2019-02-18 09:53:04,816 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:04,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-02-18 09:53:04,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-02-18 09:53:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:53:04,817 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 35 states. [2019-02-18 09:53:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:05,464 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-02-18 09:53:05,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-02-18 09:53:05,464 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 31 [2019-02-18 09:53:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:05,465 INFO L225 Difference]: With dead ends: 36 [2019-02-18 09:53:05,466 INFO L226 Difference]: Without dead ends: 35 [2019-02-18 09:53:05,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=382, Invalid=2270, Unknown=0, NotChecked=0, Total=2652 [2019-02-18 09:53:05,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-02-18 09:53:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2019-02-18 09:53:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-02-18 09:53:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2019-02-18 09:53:05,472 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2019-02-18 09:53:05,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:05,472 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2019-02-18 09:53:05,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-02-18 09:53:05,472 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2019-02-18 09:53:05,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-02-18 09:53:05,473 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:05,473 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2019-02-18 09:53:05,473 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:05,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:05,474 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2019-02-18 09:53:05,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:05,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:05,475 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:05,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:05,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:05,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:06,082 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:06,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:06,082 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:06,083 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:06,083 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:06,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:06,083 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:06,092 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:06,092 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:06,107 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:06,107 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:06,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:06,121 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:06,121 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:06,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:06,130 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:06,591 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:06,592 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:06,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:06,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:06,619 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:06,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:07,235 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-02-18 09:53:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:09,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:09,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 53 [2019-02-18 09:53:09,041 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:09,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-02-18 09:53:09,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-02-18 09:53:09,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-18 09:53:09,043 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 37 states. [2019-02-18 09:53:09,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:09,550 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-02-18 09:53:09,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-02-18 09:53:09,550 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 33 [2019-02-18 09:53:09,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:09,551 INFO L225 Difference]: With dead ends: 38 [2019-02-18 09:53:09,551 INFO L226 Difference]: Without dead ends: 37 [2019-02-18 09:53:09,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=422, Invalid=2548, Unknown=0, NotChecked=0, Total=2970 [2019-02-18 09:53:09,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-02-18 09:53:09,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2019-02-18 09:53:09,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-02-18 09:53:09,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-02-18 09:53:09,559 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2019-02-18 09:53:09,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:09,559 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-02-18 09:53:09,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-02-18 09:53:09,559 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-02-18 09:53:09,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-02-18 09:53:09,560 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:09,560 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2019-02-18 09:53:09,560 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:09,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:09,560 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2019-02-18 09:53:09,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:09,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:09,561 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:09,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:09,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:09,815 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:53:10,050 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:53:10,320 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:53:10,597 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:53:10,897 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:53:11,371 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:11,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:11,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:11,372 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:11,372 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:11,372 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:11,372 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:11,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:11,381 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:11,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:11,406 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:11,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:11,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:11,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:11,459 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:12,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:12,000 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:12,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:12,004 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:12,031 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:12,031 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:13,130 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:13,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:13,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 56 [2019-02-18 09:53:13,150 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:13,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-02-18 09:53:13,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-02-18 09:53:13,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:53:13,151 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 39 states. [2019-02-18 09:53:14,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:14,075 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-02-18 09:53:14,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-02-18 09:53:14,076 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 35 [2019-02-18 09:53:14,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:14,077 INFO L225 Difference]: With dead ends: 40 [2019-02-18 09:53:14,077 INFO L226 Difference]: Without dead ends: 39 [2019-02-18 09:53:14,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 756 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=464, Invalid=2842, Unknown=0, NotChecked=0, Total=3306 [2019-02-18 09:53:14,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-02-18 09:53:14,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2019-02-18 09:53:14,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-02-18 09:53:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-02-18 09:53:14,083 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2019-02-18 09:53:14,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:14,083 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-02-18 09:53:14,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-02-18 09:53:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-02-18 09:53:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-02-18 09:53:14,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:14,084 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2019-02-18 09:53:14,084 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:14,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:14,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2019-02-18 09:53:14,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:14,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:14,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:14,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:14,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:14,348 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:53:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:15,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:15,076 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:15,077 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:15,077 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:15,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:15,077 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:15,087 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:15,087 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:15,114 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2019-02-18 09:53:15,114 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:15,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:15,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:15,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:15,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:15,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:15,751 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:15,752 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:15,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:15,757 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:15,784 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:15,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:16,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:16,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 59 [2019-02-18 09:53:16,783 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:16,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-02-18 09:53:16,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-02-18 09:53:16,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-18 09:53:16,784 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 41 states. [2019-02-18 09:53:17,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:17,776 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-02-18 09:53:17,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-02-18 09:53:17,778 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 37 [2019-02-18 09:53:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:17,779 INFO L225 Difference]: With dead ends: 42 [2019-02-18 09:53:17,779 INFO L226 Difference]: Without dead ends: 41 [2019-02-18 09:53:17,780 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 836 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=508, Invalid=3152, Unknown=0, NotChecked=0, Total=3660 [2019-02-18 09:53:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-02-18 09:53:17,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2019-02-18 09:53:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-02-18 09:53:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-02-18 09:53:17,785 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2019-02-18 09:53:17,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:17,786 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-02-18 09:53:17,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-02-18 09:53:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-02-18 09:53:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-02-18 09:53:17,787 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:17,787 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2019-02-18 09:53:17,788 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:17,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:17,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2019-02-18 09:53:17,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:17,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:17,793 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:17,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:17,793 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:18,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:18,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:18,527 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:18,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:18,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:18,527 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:18,535 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:18,535 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:18,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:18,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:18,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:18,579 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:18,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:18,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:18,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:19,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:19,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:19,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:19,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:19,320 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:20,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:20,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 62 [2019-02-18 09:53:20,344 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:20,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-02-18 09:53:20,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-02-18 09:53:20,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:53:20,346 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 43 states. [2019-02-18 09:53:21,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:21,364 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-02-18 09:53:21,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-02-18 09:53:21,364 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 39 [2019-02-18 09:53:21,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:21,365 INFO L225 Difference]: With dead ends: 44 [2019-02-18 09:53:21,365 INFO L226 Difference]: Without dead ends: 43 [2019-02-18 09:53:21,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=554, Invalid=3478, Unknown=0, NotChecked=0, Total=4032 [2019-02-18 09:53:21,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-02-18 09:53:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-02-18 09:53:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-02-18 09:53:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2019-02-18 09:53:21,371 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2019-02-18 09:53:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:21,371 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2019-02-18 09:53:21,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-02-18 09:53:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2019-02-18 09:53:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-02-18 09:53:21,372 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:21,372 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2019-02-18 09:53:21,372 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:21,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:21,373 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2019-02-18 09:53:21,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:21,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:21,374 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:21,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:21,374 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:22,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:22,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:22,269 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:22,269 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:22,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:22,269 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:22,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:22,280 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:22,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:22,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:22,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:22,298 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:22,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:22,302 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:23,228 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:23,228 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:23,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:23,234 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:23,268 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:23,268 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:24,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:24,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 65 [2019-02-18 09:53:24,410 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:24,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-02-18 09:53:24,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-02-18 09:53:24,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-18 09:53:24,412 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 45 states. [2019-02-18 09:53:25,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:25,278 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2019-02-18 09:53:25,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-02-18 09:53:25,279 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 41 [2019-02-18 09:53:25,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:25,280 INFO L225 Difference]: With dead ends: 46 [2019-02-18 09:53:25,280 INFO L226 Difference]: Without dead ends: 45 [2019-02-18 09:53:25,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=602, Invalid=3820, Unknown=0, NotChecked=0, Total=4422 [2019-02-18 09:53:25,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-02-18 09:53:25,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2019-02-18 09:53:25,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-02-18 09:53:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-02-18 09:53:25,286 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2019-02-18 09:53:25,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:25,286 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-02-18 09:53:25,286 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-02-18 09:53:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-02-18 09:53:25,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-02-18 09:53:25,287 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:25,287 INFO L402 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2019-02-18 09:53:25,287 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:25,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:25,288 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2019-02-18 09:53:25,288 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:25,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:25,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:25,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:25,289 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:26,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:26,019 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:26,019 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:26,019 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:26,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:26,020 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:26,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:26,029 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:26,053 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2019-02-18 09:53:26,053 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:26,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:26,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:26,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:26,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:26,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:26,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:26,882 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:26,887 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:26,887 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:26,918 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:28,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:28,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2019-02-18 09:53:28,348 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:28,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2019-02-18 09:53:28,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2019-02-18 09:53:28,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:53:28,350 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 47 states. [2019-02-18 09:53:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:29,243 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-02-18 09:53:29,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-02-18 09:53:29,250 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 43 [2019-02-18 09:53:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:29,250 INFO L225 Difference]: With dead ends: 48 [2019-02-18 09:53:29,251 INFO L226 Difference]: Without dead ends: 47 [2019-02-18 09:53:29,251 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1100 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=652, Invalid=4178, Unknown=0, NotChecked=0, Total=4830 [2019-02-18 09:53:29,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-02-18 09:53:29,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-02-18 09:53:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-02-18 09:53:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2019-02-18 09:53:29,256 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2019-02-18 09:53:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:29,256 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2019-02-18 09:53:29,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2019-02-18 09:53:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2019-02-18 09:53:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-02-18 09:53:29,257 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:29,257 INFO L402 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2019-02-18 09:53:29,257 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:29,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:29,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2019-02-18 09:53:29,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:29,259 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:29,259 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:30,021 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:30,021 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:30,021 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:30,021 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:30,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:30,022 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:30,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:30,030 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:30,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:30,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:30,046 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:30,056 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:30,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:30,067 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:30,067 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:30,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:30,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:30,848 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:30,849 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:30,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:32,310 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:32,330 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:32,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 71 [2019-02-18 09:53:32,330 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:32,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-02-18 09:53:32,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-02-18 09:53:32,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-18 09:53:32,332 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 49 states. [2019-02-18 09:53:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:33,587 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-02-18 09:53:33,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-02-18 09:53:33,590 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 45 [2019-02-18 09:53:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:33,591 INFO L225 Difference]: With dead ends: 50 [2019-02-18 09:53:33,591 INFO L226 Difference]: Without dead ends: 49 [2019-02-18 09:53:33,592 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=704, Invalid=4552, Unknown=0, NotChecked=0, Total=5256 [2019-02-18 09:53:33,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-02-18 09:53:33,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2019-02-18 09:53:33,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-02-18 09:53:33,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-02-18 09:53:33,596 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2019-02-18 09:53:33,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:33,596 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-02-18 09:53:33,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-02-18 09:53:33,596 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-02-18 09:53:33,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-02-18 09:53:33,597 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:33,597 INFO L402 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2019-02-18 09:53:33,597 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:33,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:33,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2019-02-18 09:53:33,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:33,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:33,599 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:33,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:33,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:33,871 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:53:34,109 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:53:34,408 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:53:34,706 WARN L181 SmtUtils]: Spent 199.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:53:35,031 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:53:35,355 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:53:36,010 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:36,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:36,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:36,010 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:36,010 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:36,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:36,010 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:36,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:36,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:36,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:36,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:36,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:36,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:36,050 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:36,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:36,891 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:36,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:36,895 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:36,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:38,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:38,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 74 [2019-02-18 09:53:38,554 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:38,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-02-18 09:53:38,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-02-18 09:53:38,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:53:38,556 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 51 states. [2019-02-18 09:53:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:39,705 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-02-18 09:53:39,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-02-18 09:53:39,705 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 47 [2019-02-18 09:53:39,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:39,706 INFO L225 Difference]: With dead ends: 52 [2019-02-18 09:53:39,706 INFO L226 Difference]: Without dead ends: 51 [2019-02-18 09:53:39,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1296 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=758, Invalid=4942, Unknown=0, NotChecked=0, Total=5700 [2019-02-18 09:53:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-02-18 09:53:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2019-02-18 09:53:39,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-02-18 09:53:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-02-18 09:53:39,712 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2019-02-18 09:53:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:39,713 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-02-18 09:53:39,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-02-18 09:53:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-02-18 09:53:39,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-02-18 09:53:39,714 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:39,714 INFO L402 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2019-02-18 09:53:39,714 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:39,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:39,714 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2019-02-18 09:53:39,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:39,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:39,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:39,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:39,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:40,543 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:40,543 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:40,543 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:40,543 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:40,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:40,544 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:40,552 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:40,552 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:40,580 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 24 check-sat command(s) [2019-02-18 09:53:40,580 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:40,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:40,584 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:40,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:40,590 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:40,591 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:41,516 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:41,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:41,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:41,522 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:41,560 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:43,258 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:43,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:43,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26, 26] total 77 [2019-02-18 09:53:43,279 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:43,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-02-18 09:53:43,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-02-18 09:53:43,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-18 09:53:43,281 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 53 states. [2019-02-18 09:53:44,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:44,741 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2019-02-18 09:53:44,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-02-18 09:53:44,742 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 49 [2019-02-18 09:53:44,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:44,743 INFO L225 Difference]: With dead ends: 54 [2019-02-18 09:53:44,743 INFO L226 Difference]: Without dead ends: 53 [2019-02-18 09:53:44,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=814, Invalid=5348, Unknown=0, NotChecked=0, Total=6162 [2019-02-18 09:53:44,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-02-18 09:53:44,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2019-02-18 09:53:44,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-02-18 09:53:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-02-18 09:53:44,749 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2019-02-18 09:53:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:44,750 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-02-18 09:53:44,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-02-18 09:53:44,750 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-02-18 09:53:44,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-02-18 09:53:44,751 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:44,751 INFO L402 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2019-02-18 09:53:44,751 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:44,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:44,751 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2019-02-18 09:53:44,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:44,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:44,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:44,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:44,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:44,916 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:53:45,783 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:45,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:45,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:45,783 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:45,783 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:45,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:45,784 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:53:45,795 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:53:45,812 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:53:45,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:45,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:45,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:45,819 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:45,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:45,824 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:46,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:46,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:46,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:46,826 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:46,862 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:46,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:49,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:49,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 27] total 80 [2019-02-18 09:53:49,155 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:49,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-02-18 09:53:49,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-02-18 09:53:49,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:53:49,156 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 55 states. [2019-02-18 09:53:50,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:50,373 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-02-18 09:53:50,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-02-18 09:53:50,373 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 51 [2019-02-18 09:53:50,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:50,374 INFO L225 Difference]: With dead ends: 56 [2019-02-18 09:53:50,374 INFO L226 Difference]: Without dead ends: 55 [2019-02-18 09:53:50,375 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1508 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=872, Invalid=5770, Unknown=0, NotChecked=0, Total=6642 [2019-02-18 09:53:50,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-02-18 09:53:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-02-18 09:53:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-02-18 09:53:50,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2019-02-18 09:53:50,380 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2019-02-18 09:53:50,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:50,380 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2019-02-18 09:53:50,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-02-18 09:53:50,381 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2019-02-18 09:53:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-02-18 09:53:50,381 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:50,381 INFO L402 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2019-02-18 09:53:50,382 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:50,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2019-02-18 09:53:50,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:50,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:50,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:53:50,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:50,383 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:51,296 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:51,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:51,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:51,297 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:51,297 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:51,297 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:51,297 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:51,306 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:51,306 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:53:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:51,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:51,326 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:51,326 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:51,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:51,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:52,353 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:52,354 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:52,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:52,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:52,403 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:52,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:53:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:54,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:53:54,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 83 [2019-02-18 09:53:54,457 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:53:54,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-02-18 09:53:54,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-02-18 09:53:54,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-18 09:53:54,458 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 57 states. [2019-02-18 09:53:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:53:55,733 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2019-02-18 09:53:55,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-02-18 09:53:55,733 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 53 [2019-02-18 09:53:55,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:53:55,734 INFO L225 Difference]: With dead ends: 58 [2019-02-18 09:53:55,734 INFO L226 Difference]: Without dead ends: 57 [2019-02-18 09:53:55,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1620 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=932, Invalid=6208, Unknown=0, NotChecked=0, Total=7140 [2019-02-18 09:53:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-02-18 09:53:55,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2019-02-18 09:53:55,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-02-18 09:53:55,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-02-18 09:53:55,744 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2019-02-18 09:53:55,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:53:55,744 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-02-18 09:53:55,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-02-18 09:53:55,744 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-02-18 09:53:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-02-18 09:53:55,745 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:53:55,745 INFO L402 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2019-02-18 09:53:55,745 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:53:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:53:55,745 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2019-02-18 09:53:55,745 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:53:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:55,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:53:55,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:53:55,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:53:55,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:53:56,009 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:53:56,267 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:53:56,547 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:53:57,503 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:57,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:57,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:53:57,504 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:53:57,504 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:53:57,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:53:57,504 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:53:57,516 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:53:57,517 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:53:57,551 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2019-02-18 09:53:57,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:53:57,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:53:57,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:53:57,565 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:57,573 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:57,574 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:53:58,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:53:58,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:53:58,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:53:58,980 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:53:59,019 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:53:59,019 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:00,955 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:00,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:00,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 86 [2019-02-18 09:54:00,974 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:00,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-02-18 09:54:00,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-02-18 09:54:00,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:54:00,975 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 59 states. [2019-02-18 09:54:02,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:02,799 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-02-18 09:54:02,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-02-18 09:54:02,800 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 55 [2019-02-18 09:54:02,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:02,801 INFO L225 Difference]: With dead ends: 60 [2019-02-18 09:54:02,801 INFO L226 Difference]: Without dead ends: 59 [2019-02-18 09:54:02,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1736 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=994, Invalid=6662, Unknown=0, NotChecked=0, Total=7656 [2019-02-18 09:54:02,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-02-18 09:54:02,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2019-02-18 09:54:02,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-02-18 09:54:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2019-02-18 09:54:02,805 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2019-02-18 09:54:02,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:02,806 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2019-02-18 09:54:02,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-02-18 09:54:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2019-02-18 09:54:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-02-18 09:54:02,806 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:02,807 INFO L402 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2019-02-18 09:54:02,807 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:02,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2019-02-18 09:54:02,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:02,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:02,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:02,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:02,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:04,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:04,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:04,149 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:04,149 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:04,149 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:04,149 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:04,158 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:04,158 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:04,172 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:04,173 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:04,176 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:04,178 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:54:04,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:04,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:04,186 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:54:05,404 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:54:05,405 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:05,409 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:05,410 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:54:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:05,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:07,530 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:07,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:07,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30, 30] total 89 [2019-02-18 09:54:07,550 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:07,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2019-02-18 09:54:07,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2019-02-18 09:54:07,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-18 09:54:07,551 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 61 states. [2019-02-18 09:54:09,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:09,079 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2019-02-18 09:54:09,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-02-18 09:54:09,079 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 57 [2019-02-18 09:54:09,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:09,080 INFO L225 Difference]: With dead ends: 62 [2019-02-18 09:54:09,080 INFO L226 Difference]: Without dead ends: 61 [2019-02-18 09:54:09,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=1058, Invalid=7132, Unknown=0, NotChecked=0, Total=8190 [2019-02-18 09:54:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-02-18 09:54:09,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2019-02-18 09:54:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-02-18 09:54:09,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-02-18 09:54:09,084 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2019-02-18 09:54:09,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:09,084 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-02-18 09:54:09,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2019-02-18 09:54:09,084 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-02-18 09:54:09,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-02-18 09:54:09,084 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:09,085 INFO L402 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2019-02-18 09:54:09,085 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:09,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:09,085 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2019-02-18 09:54:09,085 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:09,086 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:09,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:09,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:09,322 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:54:09,547 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:54:10,479 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:10,479 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:10,479 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:10,479 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:10,479 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:10,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:10,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:10,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:10,496 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:10,513 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:10,533 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:54:10,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:10,545 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:10,545 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:54:11,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:54:11,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:11,841 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:11,841 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:54:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:11,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:14,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:14,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 92 [2019-02-18 09:54:14,321 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:14,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2019-02-18 09:54:14,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2019-02-18 09:54:14,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:54:14,323 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 63 states. [2019-02-18 09:54:15,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:15,831 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2019-02-18 09:54:15,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-02-18 09:54:15,831 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 59 [2019-02-18 09:54:15,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:15,832 INFO L225 Difference]: With dead ends: 64 [2019-02-18 09:54:15,832 INFO L226 Difference]: Without dead ends: 63 [2019-02-18 09:54:15,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1980 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1124, Invalid=7618, Unknown=0, NotChecked=0, Total=8742 [2019-02-18 09:54:15,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-02-18 09:54:15,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2019-02-18 09:54:15,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-02-18 09:54:15,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2019-02-18 09:54:15,838 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2019-02-18 09:54:15,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:15,838 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2019-02-18 09:54:15,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2019-02-18 09:54:15,838 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2019-02-18 09:54:15,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-02-18 09:54:15,839 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:15,839 INFO L402 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2019-02-18 09:54:15,839 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:15,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:15,839 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2019-02-18 09:54:15,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:15,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:15,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:15,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:16,005 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:54:17,001 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:17,001 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:17,001 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:17,002 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:17,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:17,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:17,002 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:17,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:17,010 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:17,049 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 30 check-sat command(s) [2019-02-18 09:54:17,049 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:17,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:17,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:54:17,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:17,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:17,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:54:18,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:54:18,519 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:18,524 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:18,525 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:54:18,568 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:18,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:21,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:21,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 32] total 95 [2019-02-18 09:54:21,212 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:21,212 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-02-18 09:54:21,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-02-18 09:54:21,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-02-18 09:54:21,215 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 65 states. [2019-02-18 09:54:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:23,148 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2019-02-18 09:54:23,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-02-18 09:54:23,149 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 61 [2019-02-18 09:54:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:23,150 INFO L225 Difference]: With dead ends: 66 [2019-02-18 09:54:23,150 INFO L226 Difference]: Without dead ends: 65 [2019-02-18 09:54:23,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2108 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1192, Invalid=8120, Unknown=0, NotChecked=0, Total=9312 [2019-02-18 09:54:23,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-02-18 09:54:23,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2019-02-18 09:54:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-02-18 09:54:23,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2019-02-18 09:54:23,155 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2019-02-18 09:54:23,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:23,155 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2019-02-18 09:54:23,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-02-18 09:54:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2019-02-18 09:54:23,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-02-18 09:54:23,156 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:23,156 INFO L402 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2019-02-18 09:54:23,156 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:23,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:23,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2019-02-18 09:54:23,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:23,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:23,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:23,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:23,157 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:23,406 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:54:24,812 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:24,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:24,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:24,812 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:24,812 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:24,812 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:24,812 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:24,822 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:24,823 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:24,840 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:24,841 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:24,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:24,847 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:54:24,847 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:24,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:24,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:54:26,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:54:26,255 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:26,260 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:26,260 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:54:26,306 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:26,306 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:28,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:28,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 98 [2019-02-18 09:54:28,869 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:28,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-02-18 09:54:28,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-02-18 09:54:28,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:54:28,871 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 67 states. [2019-02-18 09:54:30,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:30,725 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-02-18 09:54:30,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-02-18 09:54:30,725 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 63 [2019-02-18 09:54:30,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:30,726 INFO L225 Difference]: With dead ends: 68 [2019-02-18 09:54:30,726 INFO L226 Difference]: Without dead ends: 67 [2019-02-18 09:54:30,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2240 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1262, Invalid=8638, Unknown=0, NotChecked=0, Total=9900 [2019-02-18 09:54:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-02-18 09:54:30,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2019-02-18 09:54:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-02-18 09:54:30,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2019-02-18 09:54:30,731 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2019-02-18 09:54:30,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:30,732 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2019-02-18 09:54:30,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-02-18 09:54:30,732 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2019-02-18 09:54:30,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-02-18 09:54:30,732 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:30,733 INFO L402 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2019-02-18 09:54:30,733 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:30,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:30,733 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2019-02-18 09:54:30,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:30,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:30,734 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:30,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:30,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:31,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:31,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:31,952 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:31,952 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:31,952 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:31,952 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:31,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:31,963 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:31,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:31,984 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:31,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:54:31,990 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:31,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:31,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:54:33,616 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:54:33,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:33,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:33,621 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:54:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:33,668 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:36,581 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:36,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:36,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34, 34] total 101 [2019-02-18 09:54:36,600 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:36,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-02-18 09:54:36,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-02-18 09:54:36,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-18 09:54:36,601 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 69 states. [2019-02-18 09:54:38,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:38,585 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2019-02-18 09:54:38,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-02-18 09:54:38,586 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 65 [2019-02-18 09:54:38,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:38,587 INFO L225 Difference]: With dead ends: 70 [2019-02-18 09:54:38,587 INFO L226 Difference]: Without dead ends: 69 [2019-02-18 09:54:38,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2376 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2019-02-18 09:54:38,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-02-18 09:54:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2019-02-18 09:54:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-02-18 09:54:38,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-02-18 09:54:38,591 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2019-02-18 09:54:38,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:38,592 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-02-18 09:54:38,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-02-18 09:54:38,592 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-02-18 09:54:38,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-02-18 09:54:38,592 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:38,592 INFO L402 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2019-02-18 09:54:38,592 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:38,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:38,593 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2019-02-18 09:54:38,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:38,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:38,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:38,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:38,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:40,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:40,071 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:40,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:40,072 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:40,072 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:40,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:40,072 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:40,082 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:54:40,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:54:40,125 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 33 check-sat command(s) [2019-02-18 09:54:40,125 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:40,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:40,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:54:40,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:40,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:40,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:54:41,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:54:41,723 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:41,728 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:41,729 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:54:41,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:41,782 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:44,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:44,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:44,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 104 [2019-02-18 09:54:44,788 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:44,788 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2019-02-18 09:54:44,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2019-02-18 09:54:44,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:54:44,789 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 71 states. [2019-02-18 09:54:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:47,526 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-02-18 09:54:47,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-02-18 09:54:47,527 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 67 [2019-02-18 09:54:47,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:47,528 INFO L225 Difference]: With dead ends: 72 [2019-02-18 09:54:47,528 INFO L226 Difference]: Without dead ends: 71 [2019-02-18 09:54:47,529 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2516 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1408, Invalid=9722, Unknown=0, NotChecked=0, Total=11130 [2019-02-18 09:54:47,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-02-18 09:54:47,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2019-02-18 09:54:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-02-18 09:54:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2019-02-18 09:54:47,532 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2019-02-18 09:54:47,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:47,533 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2019-02-18 09:54:47,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2019-02-18 09:54:47,533 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2019-02-18 09:54:47,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-02-18 09:54:47,533 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:47,533 INFO L402 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2019-02-18 09:54:47,534 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:47,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:47,534 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2019-02-18 09:54:47,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:47,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:47,535 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:47,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:47,535 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:47,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:47,775 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:54:49,055 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:49,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:49,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:49,055 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:49,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:49,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:49,056 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:49,064 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:54:49,065 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:54:49,084 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:54:49,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:54:49,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:49,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:54:49,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:49,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:49,110 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:54:51,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:54:51,059 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:51,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:51,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:54:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:51,115 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:54:54,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:54,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:54:54,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 107 [2019-02-18 09:54:54,120 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:54:54,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2019-02-18 09:54:54,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2019-02-18 09:54:54,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-18 09:54:54,121 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 73 states. [2019-02-18 09:54:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:54:56,543 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2019-02-18 09:54:56,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-02-18 09:54:56,543 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 69 [2019-02-18 09:54:56,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:54:56,545 INFO L225 Difference]: With dead ends: 74 [2019-02-18 09:54:56,545 INFO L226 Difference]: Without dead ends: 73 [2019-02-18 09:54:56,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2660 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1484, Invalid=10288, Unknown=0, NotChecked=0, Total=11772 [2019-02-18 09:54:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-02-18 09:54:56,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2019-02-18 09:54:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-02-18 09:54:56,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2019-02-18 09:54:56,550 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2019-02-18 09:54:56,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:54:56,550 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2019-02-18 09:54:56,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2019-02-18 09:54:56,551 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2019-02-18 09:54:56,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-02-18 09:54:56,551 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:54:56,551 INFO L402 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2019-02-18 09:54:56,551 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:54:56,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:54:56,552 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2019-02-18 09:54:56,552 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:54:56,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:56,553 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:54:56,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:54:56,553 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:54:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:57,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:54:57,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:57,933 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:54:57,933 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:54:57,933 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:54:57,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:54:57,934 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:54:57,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:54:57,943 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:54:57,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:54:57,966 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:54:57,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:54:57,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:57,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:57,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:54:59,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:54:59,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:54:59,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:54:59,881 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:55:00,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:00,017 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:03,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:03,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:03,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 110 [2019-02-18 09:55:03,149 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:03,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-02-18 09:55:03,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-02-18 09:55:03,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:55:03,150 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 75 states. [2019-02-18 09:55:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:05,744 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-02-18 09:55:05,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-02-18 09:55:05,752 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 71 [2019-02-18 09:55:05,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:05,752 INFO L225 Difference]: With dead ends: 76 [2019-02-18 09:55:05,752 INFO L226 Difference]: Without dead ends: 75 [2019-02-18 09:55:05,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2808 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1562, Invalid=10870, Unknown=0, NotChecked=0, Total=12432 [2019-02-18 09:55:05,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-02-18 09:55:05,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2019-02-18 09:55:05,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-02-18 09:55:05,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2019-02-18 09:55:05,757 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2019-02-18 09:55:05,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:05,757 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2019-02-18 09:55:05,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-02-18 09:55:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2019-02-18 09:55:05,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-02-18 09:55:05,758 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:05,758 INFO L402 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2019-02-18 09:55:05,758 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:05,758 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2019-02-18 09:55:05,759 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:05,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:05,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:05,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:05,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:05,951 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:55:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:07,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:07,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:07,316 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:07,316 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:07,316 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:07,316 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:07,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:55:07,325 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:55:07,492 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 36 check-sat command(s) [2019-02-18 09:55:07,493 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:07,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:07,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:55:07,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:55:07,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:55:07,506 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:55:09,343 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:55:09,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:55:09,359 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:55:09,359 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:55:09,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:09,412 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:13,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:13,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38, 38] total 113 [2019-02-18 09:55:13,010 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:13,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-02-18 09:55:13,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-02-18 09:55:13,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-18 09:55:13,012 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 77 states. [2019-02-18 09:55:16,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:16,115 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2019-02-18 09:55:16,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-02-18 09:55:16,116 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 73 [2019-02-18 09:55:16,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:16,117 INFO L225 Difference]: With dead ends: 78 [2019-02-18 09:55:16,117 INFO L226 Difference]: Without dead ends: 77 [2019-02-18 09:55:16,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2960 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1642, Invalid=11468, Unknown=0, NotChecked=0, Total=13110 [2019-02-18 09:55:16,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-02-18 09:55:16,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2019-02-18 09:55:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-02-18 09:55:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-02-18 09:55:16,122 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2019-02-18 09:55:16,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:16,122 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-02-18 09:55:16,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-02-18 09:55:16,122 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-02-18 09:55:16,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-02-18 09:55:16,122 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:16,122 INFO L402 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2019-02-18 09:55:16,123 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:16,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:16,123 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2019-02-18 09:55:16,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:16,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:16,123 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:16,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:16,124 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:16,394 WARN L181 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:55:17,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:17,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:17,847 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:17,847 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:17,847 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:17,847 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:17,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 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:17,857 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:55:17,857 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:55:17,880 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:55:17,881 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:17,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:17,885 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:55:17,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:55:17,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:55:17,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:55:19,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:55:19,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:55:19,849 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:55:19,850 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:55:19,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:19,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:23,581 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:23,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 116 [2019-02-18 09:55:23,582 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:23,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2019-02-18 09:55:23,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2019-02-18 09:55:23,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:55:23,583 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 79 states. [2019-02-18 09:55:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:26,584 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2019-02-18 09:55:26,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-02-18 09:55:26,585 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 75 [2019-02-18 09:55:26,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:26,586 INFO L225 Difference]: With dead ends: 80 [2019-02-18 09:55:26,586 INFO L226 Difference]: Without dead ends: 79 [2019-02-18 09:55:26,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3116 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1724, Invalid=12082, Unknown=0, NotChecked=0, Total=13806 [2019-02-18 09:55:26,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-02-18 09:55:26,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2019-02-18 09:55:26,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-02-18 09:55:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2019-02-18 09:55:26,591 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2019-02-18 09:55:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:26,591 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2019-02-18 09:55:26,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2019-02-18 09:55:26,591 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2019-02-18 09:55:26,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-02-18 09:55:26,591 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:26,592 INFO L402 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2019-02-18 09:55:26,592 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:26,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:26,592 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2019-02-18 09:55:26,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:26,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:26,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:26,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:26,593 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:26,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:26,815 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:55:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:28,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:28,302 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:28,302 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:28,302 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:28,302 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:28,303 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:28,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:28,312 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:55:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:28,337 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:28,365 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:55:28,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:55:28,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:55:28,376 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:55:30,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:55:30,561 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:55:30,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:55:30,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:55:30,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:30,682 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:34,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:34,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:34,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 119 [2019-02-18 09:55:34,284 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:34,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2019-02-18 09:55:34,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2019-02-18 09:55:34,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-18 09:55:34,285 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 81 states. [2019-02-18 09:55:37,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:37,103 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2019-02-18 09:55:37,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-02-18 09:55:37,103 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 77 [2019-02-18 09:55:37,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:37,104 INFO L225 Difference]: With dead ends: 82 [2019-02-18 09:55:37,104 INFO L226 Difference]: Without dead ends: 81 [2019-02-18 09:55:37,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3276 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1808, Invalid=12712, Unknown=0, NotChecked=0, Total=14520 [2019-02-18 09:55:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-02-18 09:55:37,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-02-18 09:55:37,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-02-18 09:55:37,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2019-02-18 09:55:37,108 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2019-02-18 09:55:37,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:37,109 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2019-02-18 09:55:37,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2019-02-18 09:55:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2019-02-18 09:55:37,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-02-18 09:55:37,109 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:37,109 INFO L402 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2019-02-18 09:55:37,109 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:37,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:37,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2019-02-18 09:55:37,110 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:37,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:37,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:55:37,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:37,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:37,344 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:55:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:38,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:38,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:38,857 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:38,857 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:38,857 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:38,857 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:38,867 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:55:38,868 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:55:38,967 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 39 check-sat command(s) [2019-02-18 09:55:38,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:38,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:38,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:55:38,991 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:55:39,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:55:39,024 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:55:41,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:55:41,466 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:55:41,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:55:41,469 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:55:41,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:41,529 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:45,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:45,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:45,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 122 [2019-02-18 09:55:45,324 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:45,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-02-18 09:55:45,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-02-18 09:55:45,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-18 09:55:45,325 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 83 states. [2019-02-18 09:55:48,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:55:48,899 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-02-18 09:55:48,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-02-18 09:55:48,899 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 79 [2019-02-18 09:55:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:55:48,900 INFO L225 Difference]: With dead ends: 84 [2019-02-18 09:55:48,900 INFO L226 Difference]: Without dead ends: 83 [2019-02-18 09:55:48,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3440 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=1894, Invalid=13358, Unknown=0, NotChecked=0, Total=15252 [2019-02-18 09:55:48,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-02-18 09:55:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2019-02-18 09:55:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-02-18 09:55:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2019-02-18 09:55:48,905 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2019-02-18 09:55:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:55:48,905 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2019-02-18 09:55:48,905 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-02-18 09:55:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2019-02-18 09:55:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-02-18 09:55:48,906 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:55:48,906 INFO L402 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2019-02-18 09:55:48,906 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:55:48,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:55:48,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2019-02-18 09:55:48,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:55:48,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:48,907 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:55:48,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:55:48,907 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:55:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:55:49,172 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:55:49,332 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:55:50,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:50,991 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:50,991 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:55:50,991 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:55:50,991 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:55:50,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:55:50,992 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:55:51,000 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:55:51,000 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:55:51,025 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:55:51,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:55:51,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:55:51,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:55:51,032 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:55:51,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:55:51,038 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:55:53,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:55:53,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:55:53,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:55:53,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:55:53,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:53,352 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:55:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:55:57,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:55:57,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42, 42] total 125 [2019-02-18 09:55:57,597 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:55:57,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2019-02-18 09:55:57,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2019-02-18 09:55:57,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-18 09:55:57,598 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 85 states. [2019-02-18 09:56:00,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:00,411 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2019-02-18 09:56:00,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-02-18 09:56:00,412 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 81 [2019-02-18 09:56:00,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:00,413 INFO L225 Difference]: With dead ends: 86 [2019-02-18 09:56:00,413 INFO L226 Difference]: Without dead ends: 85 [2019-02-18 09:56:00,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1982, Invalid=14020, Unknown=0, NotChecked=0, Total=16002 [2019-02-18 09:56:00,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-02-18 09:56:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2019-02-18 09:56:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-02-18 09:56:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-02-18 09:56:00,424 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2019-02-18 09:56:00,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:00,424 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-02-18 09:56:00,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2019-02-18 09:56:00,424 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-02-18 09:56:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-02-18 09:56:00,425 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:00,425 INFO L402 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2019-02-18 09:56:00,425 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:00,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2019-02-18 09:56:00,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:00,426 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:00,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:00,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:00,648 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:56:02,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:02,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:02,511 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:02,511 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:02,511 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:02,511 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:02,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 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:02,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:02,520 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:56:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:02,546 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:02,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:56:02,555 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:02,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:02,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:56:04,898 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:56:04,899 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:04,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:04,903 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:56:04,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:04,962 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:09,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:09,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:09,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 128 [2019-02-18 09:56:09,308 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:09,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2019-02-18 09:56:09,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2019-02-18 09:56:09,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:56:09,309 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 87 states. [2019-02-18 09:56:13,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:13,346 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2019-02-18 09:56:13,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-02-18 09:56:13,347 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 83 [2019-02-18 09:56:13,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:13,348 INFO L225 Difference]: With dead ends: 88 [2019-02-18 09:56:13,348 INFO L226 Difference]: Without dead ends: 87 [2019-02-18 09:56:13,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3780 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=2072, Invalid=14698, Unknown=0, NotChecked=0, Total=16770 [2019-02-18 09:56:13,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-02-18 09:56:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2019-02-18 09:56:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-02-18 09:56:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2019-02-18 09:56:13,354 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2019-02-18 09:56:13,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:13,355 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2019-02-18 09:56:13,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2019-02-18 09:56:13,355 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2019-02-18 09:56:13,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-02-18 09:56:13,355 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:13,356 INFO L402 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2019-02-18 09:56:13,356 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:13,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:13,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2019-02-18 09:56:13,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:13,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:13,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:13,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:13,357 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:13,568 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:56:15,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:15,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:15,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:15,188 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:15,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:15,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:15,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:15,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:56:15,197 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:15,253 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 42 check-sat command(s) [2019-02-18 09:56:15,254 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:15,256 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:15,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:56:15,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:15,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:15,267 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:56:18,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:56:18,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:18,066 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:18,066 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:56:18,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:18,127 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:22,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:22,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:22,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44, 44] total 131 [2019-02-18 09:56:22,743 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:22,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-02-18 09:56:22,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-02-18 09:56:22,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-18 09:56:22,745 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 89 states. [2019-02-18 09:56:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:27,266 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2019-02-18 09:56:27,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-02-18 09:56:27,267 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 85 [2019-02-18 09:56:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:27,268 INFO L225 Difference]: With dead ends: 90 [2019-02-18 09:56:27,268 INFO L226 Difference]: Without dead ends: 89 [2019-02-18 09:56:27,269 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3956 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=2164, Invalid=15392, Unknown=0, NotChecked=0, Total=17556 [2019-02-18 09:56:27,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-02-18 09:56:27,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2019-02-18 09:56:27,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-02-18 09:56:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2019-02-18 09:56:27,273 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2019-02-18 09:56:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:27,273 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2019-02-18 09:56:27,273 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-02-18 09:56:27,273 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2019-02-18 09:56:27,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-02-18 09:56:27,274 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:27,274 INFO L402 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2019-02-18 09:56:27,274 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:27,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:27,274 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2019-02-18 09:56:27,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:27,275 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:27,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:27,276 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:27,461 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:56:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:29,168 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:29,168 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:29,168 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:29,169 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:29,169 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:29,169 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:29,178 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:56:29,178 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:56:29,202 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:56:29,202 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:29,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:29,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:56:29,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:29,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:29,213 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:56:32,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:56:32,023 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:32,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:32,033 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:56:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:32,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:36,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:36,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 134 [2019-02-18 09:56:36,848 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:36,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-02-18 09:56:36,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-02-18 09:56:36,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:56:36,850 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 91 states. [2019-02-18 09:56:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:41,484 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-02-18 09:56:41,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-02-18 09:56:41,485 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 87 [2019-02-18 09:56:41,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:41,486 INFO L225 Difference]: With dead ends: 92 [2019-02-18 09:56:41,486 INFO L226 Difference]: Without dead ends: 91 [2019-02-18 09:56:41,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4136 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=2258, Invalid=16102, Unknown=0, NotChecked=0, Total=18360 [2019-02-18 09:56:41,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-02-18 09:56:41,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2019-02-18 09:56:41,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2019-02-18 09:56:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2019-02-18 09:56:41,492 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2019-02-18 09:56:41,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:41,493 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2019-02-18 09:56:41,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-02-18 09:56:41,493 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2019-02-18 09:56:41,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-02-18 09:56:41,493 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:41,493 INFO L402 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2019-02-18 09:56:41,493 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:41,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2019-02-18 09:56:41,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:41,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:41,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:56:41,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:41,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:41,774 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:56:42,035 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:56:42,254 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:56:44,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:44,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:44,109 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:44,110 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:44,110 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:44,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:44,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 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:44,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:44,120 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:56:44,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:44,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:44,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:56:44,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:44,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:44,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:56:46,815 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:56:46,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:46,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:46,821 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:56:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:46,887 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:56:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:51,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:56:51,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46, 46] total 137 [2019-02-18 09:56:51,907 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:56:51,907 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-02-18 09:56:51,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-02-18 09:56:51,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-02-18 09:56:51,909 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 93 states. [2019-02-18 09:56:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:56:55,708 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2019-02-18 09:56:55,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-02-18 09:56:55,709 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 89 [2019-02-18 09:56:55,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:56:55,710 INFO L225 Difference]: With dead ends: 94 [2019-02-18 09:56:55,710 INFO L226 Difference]: Without dead ends: 93 [2019-02-18 09:56:55,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4320 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=2354, Invalid=16828, Unknown=0, NotChecked=0, Total=19182 [2019-02-18 09:56:55,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-02-18 09:56:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2019-02-18 09:56:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-02-18 09:56:55,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-02-18 09:56:55,714 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2019-02-18 09:56:55,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:56:55,715 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-02-18 09:56:55,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2019-02-18 09:56:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-02-18 09:56:55,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-02-18 09:56:55,715 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:56:55,715 INFO L402 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2019-02-18 09:56:55,715 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:56:55,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:56:55,716 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2019-02-18 09:56:55,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:56:55,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:55,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:56:55,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:56:55,716 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:56:55,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:56:55,972 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:56:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:56:58,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:58,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:56:58,102 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:56:58,102 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:56:58,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:56:58,102 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:56:58,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:56:58,114 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:56:58,182 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 45 check-sat command(s) [2019-02-18 09:56:58,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:56:58,185 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:56:58,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:56:58,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:56:58,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:56:58,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:57:01,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:57:01,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:01,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:01,534 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:57:01,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:01,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:06,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:06,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:06,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 140 [2019-02-18 09:57:06,861 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:06,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2019-02-18 09:57:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2019-02-18 09:57:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:57:06,862 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 95 states. [2019-02-18 09:57:11,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:11,017 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2019-02-18 09:57:11,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-02-18 09:57:11,017 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 91 [2019-02-18 09:57:11,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:11,018 INFO L225 Difference]: With dead ends: 96 [2019-02-18 09:57:11,018 INFO L226 Difference]: Without dead ends: 95 [2019-02-18 09:57:11,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4508 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=2452, Invalid=17570, Unknown=0, NotChecked=0, Total=20022 [2019-02-18 09:57:11,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-02-18 09:57:11,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2019-02-18 09:57:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-02-18 09:57:11,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2019-02-18 09:57:11,023 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2019-02-18 09:57:11,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:11,024 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2019-02-18 09:57:11,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2019-02-18 09:57:11,024 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2019-02-18 09:57:11,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-02-18 09:57:11,024 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:11,024 INFO L402 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2019-02-18 09:57:11,024 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:11,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:11,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2019-02-18 09:57:11,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:11,025 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:11,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:11,025 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:13,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:13,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:13,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:13,305 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:13,305 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:13,305 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:13,305 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:13,315 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:57:13,316 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:57:13,363 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:57:13,364 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:13,368 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:13,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:57:13,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:13,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:13,384 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:57:16,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:57:16,378 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:16,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:16,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:57:16,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:16,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:21,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:21,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48, 48] total 143 [2019-02-18 09:57:21,842 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:21,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2019-02-18 09:57:21,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2019-02-18 09:57:21,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-18 09:57:21,843 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 97 states. [2019-02-18 09:57:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:26,419 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2019-02-18 09:57:26,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-02-18 09:57:26,420 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 93 [2019-02-18 09:57:26,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:26,421 INFO L225 Difference]: With dead ends: 98 [2019-02-18 09:57:26,421 INFO L226 Difference]: Without dead ends: 97 [2019-02-18 09:57:26,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4700 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=2552, Invalid=18328, Unknown=0, NotChecked=0, Total=20880 [2019-02-18 09:57:26,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-02-18 09:57:26,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2019-02-18 09:57:26,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-02-18 09:57:26,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2019-02-18 09:57:26,426 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2019-02-18 09:57:26,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:26,426 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2019-02-18 09:57:26,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2019-02-18 09:57:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2019-02-18 09:57:26,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-02-18 09:57:26,427 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:26,427 INFO L402 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2019-02-18 09:57:26,427 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:26,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:26,427 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2019-02-18 09:57:26,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:26,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:26,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:26,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:26,428 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:26,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:26,703 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:57:26,938 WARN L181 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:57:27,195 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:57:29,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:29,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:29,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:29,431 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:29,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:29,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:29,431 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:29,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:29,440 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:57:29,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:29,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:29,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:57:29,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:29,479 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:29,479 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:57:32,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:57:32,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:32,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:32,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:57:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:32,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:38,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:38,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:38,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 146 [2019-02-18 09:57:38,193 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:38,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-02-18 09:57:38,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-02-18 09:57:38,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:57:38,194 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 99 states. [2019-02-18 09:57:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:42,460 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-02-18 09:57:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-02-18 09:57:42,461 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 95 [2019-02-18 09:57:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:42,462 INFO L225 Difference]: With dead ends: 100 [2019-02-18 09:57:42,462 INFO L226 Difference]: Without dead ends: 99 [2019-02-18 09:57:42,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4896 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=2654, Invalid=19102, Unknown=0, NotChecked=0, Total=21756 [2019-02-18 09:57:42,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-02-18 09:57:42,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2019-02-18 09:57:42,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-02-18 09:57:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2019-02-18 09:57:42,467 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2019-02-18 09:57:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:42,468 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2019-02-18 09:57:42,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-02-18 09:57:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2019-02-18 09:57:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-02-18 09:57:42,468 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:42,468 INFO L402 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2019-02-18 09:57:42,468 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:42,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:42,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2019-02-18 09:57:42,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:42,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:42,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:57:42,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:42,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:57:42,733 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:57:42,974 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-02-18 09:57:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:45,352 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:45,352 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:57:45,353 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:57:45,353 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:57:45,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:57:45,353 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:57:45,361 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:57:45,361 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:57:45,436 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 48 check-sat command(s) [2019-02-18 09:57:45,437 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:57:45,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:57:45,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:57:45,457 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:45,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:45,528 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:57:49,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:57:49,781 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:57:49,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:57:49,786 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:57:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:49,861 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:57:55,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:57:55,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:57:55,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50, 50] total 149 [2019-02-18 09:57:55,665 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:57:55,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2019-02-18 09:57:55,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2019-02-18 09:57:55,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-18 09:57:55,667 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 101 states. [2019-02-18 09:57:59,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:57:59,888 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2019-02-18 09:57:59,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-02-18 09:57:59,889 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 97 [2019-02-18 09:57:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:57:59,890 INFO L225 Difference]: With dead ends: 102 [2019-02-18 09:57:59,890 INFO L226 Difference]: Without dead ends: 101 [2019-02-18 09:57:59,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5096 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=2758, Invalid=19892, Unknown=0, NotChecked=0, Total=22650 [2019-02-18 09:57:59,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-02-18 09:57:59,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-02-18 09:57:59,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-02-18 09:57:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-02-18 09:57:59,894 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2019-02-18 09:57:59,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:57:59,895 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-02-18 09:57:59,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2019-02-18 09:57:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-02-18 09:57:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-02-18 09:57:59,896 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:57:59,896 INFO L402 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2019-02-18 09:57:59,896 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:57:59,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:57:59,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2019-02-18 09:57:59,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:57:59,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:59,897 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:57:59,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:57:59,897 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:57:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:00,128 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:58:02,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:02,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:02,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:02,202 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:02,202 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:02,202 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:02,202 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:02,210 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:02,210 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:02,238 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:02,238 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:02,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:02,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:58:02,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:02,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:02,249 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:58:05,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:58:05,706 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:05,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:05,711 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:58:05,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:05,790 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:11,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:11,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:11,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51, 51] total 152 [2019-02-18 09:58:11,919 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:11,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2019-02-18 09:58:11,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2019-02-18 09:58:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:58:11,920 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 103 states. [2019-02-18 09:58:16,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:16,289 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2019-02-18 09:58:16,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-02-18 09:58:16,290 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 99 [2019-02-18 09:58:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:16,291 INFO L225 Difference]: With dead ends: 104 [2019-02-18 09:58:16,291 INFO L226 Difference]: Without dead ends: 103 [2019-02-18 09:58:16,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5300 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=2864, Invalid=20698, Unknown=0, NotChecked=0, Total=23562 [2019-02-18 09:58:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-02-18 09:58:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-02-18 09:58:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-02-18 09:58:16,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2019-02-18 09:58:16,298 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2019-02-18 09:58:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:16,298 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2019-02-18 09:58:16,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2019-02-18 09:58:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2019-02-18 09:58:16,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-02-18 09:58:16,299 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:16,299 INFO L402 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2019-02-18 09:58:16,299 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:16,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:16,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2019-02-18 09:58:16,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:16,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:16,300 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:16,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:16,301 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:16,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:18,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:18,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:18,601 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:18,602 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:18,602 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:18,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:18,602 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:18,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:18,611 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:58:18,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:18,642 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:18,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:58:18,657 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:18,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:18,680 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:58:22,286 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:58:22,287 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:22,290 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:22,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:58:22,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:22,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:28,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:28,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52, 52] total 155 [2019-02-18 09:58:28,833 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:28,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-02-18 09:58:28,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-02-18 09:58:28,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-18 09:58:28,835 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 105 states. [2019-02-18 09:58:33,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:33,572 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2019-02-18 09:58:33,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-02-18 09:58:33,572 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 101 [2019-02-18 09:58:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:33,573 INFO L225 Difference]: With dead ends: 106 [2019-02-18 09:58:33,573 INFO L226 Difference]: Without dead ends: 105 [2019-02-18 09:58:33,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5508 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=2972, Invalid=21520, Unknown=0, NotChecked=0, Total=24492 [2019-02-18 09:58:33,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-02-18 09:58:33,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-02-18 09:58:33,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-02-18 09:58:33,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2019-02-18 09:58:33,579 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2019-02-18 09:58:33,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:33,580 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2019-02-18 09:58:33,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-02-18 09:58:33,580 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2019-02-18 09:58:33,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-02-18 09:58:33,580 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:33,581 INFO L402 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2019-02-18 09:58:33,581 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:33,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:33,581 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2019-02-18 09:58:33,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:33,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:33,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:58:33,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:33,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:33,869 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:58:34,123 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:58:34,398 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:58:34,679 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:58:37,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:37,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:37,195 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:37,195 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:37,195 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:37,195 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:37,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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:37,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:58:37,205 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:58:37,307 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2019-02-18 09:58:37,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:37,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:37,325 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:58:37,325 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:37,333 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:37,333 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:58:41,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:58:41,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:41,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:41,223 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:58:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:41,302 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:58:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:47,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:58:47,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53, 53] total 158 [2019-02-18 09:58:47,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:58:47,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-02-18 09:58:47,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-02-18 09:58:47,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:58:47,883 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 107 states. [2019-02-18 09:58:53,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:58:53,487 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-02-18 09:58:53,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2019-02-18 09:58:53,488 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 103 [2019-02-18 09:58:53,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:58:53,489 INFO L225 Difference]: With dead ends: 108 [2019-02-18 09:58:53,489 INFO L226 Difference]: Without dead ends: 107 [2019-02-18 09:58:53,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=3082, Invalid=22358, Unknown=0, NotChecked=0, Total=25440 [2019-02-18 09:58:53,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-02-18 09:58:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-02-18 09:58:53,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-02-18 09:58:53,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2019-02-18 09:58:53,496 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2019-02-18 09:58:53,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:58:53,496 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2019-02-18 09:58:53,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-02-18 09:58:53,496 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2019-02-18 09:58:53,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-02-18 09:58:53,497 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:58:53,497 INFO L402 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2019-02-18 09:58:53,497 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:58:53,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:58:53,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2019-02-18 09:58:53,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:58:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:53,500 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:58:53,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:58:53,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:58:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:58:56,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:58:56,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:56,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:58:56,277 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:58:56,277 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:58:56,277 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:58:56,277 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:58:56,286 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:58:56,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:58:56,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:58:56,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:58:56,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:58:56,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:58:56,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:58:56,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:58:56,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:59:00,197 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:59:00,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:00,203 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:00,204 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:59:00,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:00,297 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:07,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:07,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:07,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54, 54] total 161 [2019-02-18 09:59:07,477 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:07,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2019-02-18 09:59:07,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2019-02-18 09:59:07,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-18 09:59:07,479 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 109 states. [2019-02-18 09:59:14,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:14,484 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2019-02-18 09:59:14,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-02-18 09:59:14,485 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 105 [2019-02-18 09:59:14,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:14,486 INFO L225 Difference]: With dead ends: 110 [2019-02-18 09:59:14,486 INFO L226 Difference]: Without dead ends: 109 [2019-02-18 09:59:14,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5936 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=3194, Invalid=23212, Unknown=0, NotChecked=0, Total=26406 [2019-02-18 09:59:14,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-02-18 09:59:14,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-02-18 09:59:14,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-02-18 09:59:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-02-18 09:59:14,492 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2019-02-18 09:59:14,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:14,493 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-02-18 09:59:14,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2019-02-18 09:59:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-02-18 09:59:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-02-18 09:59:14,494 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:14,494 INFO L402 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2019-02-18 09:59:14,494 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:14,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:14,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2019-02-18 09:59:14,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:14,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:14,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:14,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:14,495 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:14,732 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:59:17,465 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:17,465 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:17,465 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:17,465 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:17,466 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:17,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:17,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 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 53 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:17,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:17,474 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 09:59:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:17,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:17,532 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:59:17,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:17,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:17,594 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:59:21,884 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:59:21,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:21,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:21,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:59:21,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:21,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:29,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:29,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55, 55] total 164 [2019-02-18 09:59:29,310 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:29,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2019-02-18 09:59:29,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2019-02-18 09:59:29,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:59:29,312 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 111 states. [2019-02-18 09:59:34,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:34,095 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2019-02-18 09:59:34,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-02-18 09:59:34,096 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 107 [2019-02-18 09:59:34,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:34,097 INFO L225 Difference]: With dead ends: 112 [2019-02-18 09:59:34,097 INFO L226 Difference]: Without dead ends: 111 [2019-02-18 09:59:34,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 102 SyntacticMatches, 1 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6156 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=3308, Invalid=24082, Unknown=0, NotChecked=0, Total=27390 [2019-02-18 09:59:34,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-02-18 09:59:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2019-02-18 09:59:34,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-02-18 09:59:34,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2019-02-18 09:59:34,102 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2019-02-18 09:59:34,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:34,102 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2019-02-18 09:59:34,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2019-02-18 09:59:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2019-02-18 09:59:34,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-02-18 09:59:34,103 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:34,103 INFO L402 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2019-02-18 09:59:34,103 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:34,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:34,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2019-02-18 09:59:34,103 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:34,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:34,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 09:59:34,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:34,104 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:34,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:34,361 WARN L181 SmtUtils]: Spent 183.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:59:34,602 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 09:59:34,883 WARN L181 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:59:35,185 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:59:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:37,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:37,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:37,975 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:37,975 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:37,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:37,975 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 54 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:37,984 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 09:59:37,984 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 09:59:38,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 54 check-sat command(s) [2019-02-18 09:59:38,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:38,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:38,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:59:38,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:38,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:38,091 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 09:59:42,295 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 09:59:42,295 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:42,299 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:42,299 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 09:59:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:42,388 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 09:59:49,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:49,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 09:59:49,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56, 56] total 167 [2019-02-18 09:59:49,705 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 09:59:49,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2019-02-18 09:59:49,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2019-02-18 09:59:49,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-18 09:59:49,707 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 113 states. [2019-02-18 09:59:56,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 09:59:56,145 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2019-02-18 09:59:56,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-02-18 09:59:56,146 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 109 [2019-02-18 09:59:56,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 09:59:56,147 INFO L225 Difference]: With dead ends: 114 [2019-02-18 09:59:56,147 INFO L226 Difference]: Without dead ends: 113 [2019-02-18 09:59:56,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6380 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=3424, Invalid=24968, Unknown=0, NotChecked=0, Total=28392 [2019-02-18 09:59:56,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-02-18 09:59:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2019-02-18 09:59:56,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-02-18 09:59:56,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2019-02-18 09:59:56,153 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2019-02-18 09:59:56,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 09:59:56,154 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2019-02-18 09:59:56,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2019-02-18 09:59:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2019-02-18 09:59:56,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-02-18 09:59:56,154 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 09:59:56,154 INFO L402 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2019-02-18 09:59:56,154 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 09:59:56,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 09:59:56,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2019-02-18 09:59:56,155 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 09:59:56,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:56,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 09:59:56,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 09:59:56,155 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 09:59:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 09:59:56,414 WARN L181 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 09:59:59,342 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 09:59:59,342 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:59,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 09:59:59,343 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 09:59:59,343 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 09:59:59,343 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 09:59:59,343 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 55 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 09:59:59,351 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 09:59:59,351 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 09:59:59,385 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 09:59:59,385 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 09:59:59,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 09:59:59,391 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 09:59:59,391 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 09:59:59,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 09:59:59,400 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:00:03,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:00:03,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:03,831 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:03,832 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:00:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:03,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:11,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:11,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:11,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57, 57] total 170 [2019-02-18 10:00:11,514 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:11,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-02-18 10:00:11,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-02-18 10:00:11,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 10:00:11,516 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 115 states. [2019-02-18 10:00:16,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:16,870 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-02-18 10:00:16,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-02-18 10:00:16,870 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 111 [2019-02-18 10:00:16,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:16,872 INFO L225 Difference]: With dead ends: 116 [2019-02-18 10:00:16,872 INFO L226 Difference]: Without dead ends: 115 [2019-02-18 10:00:16,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6608 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=3542, Invalid=25870, Unknown=0, NotChecked=0, Total=29412 [2019-02-18 10:00:16,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-02-18 10:00:16,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2019-02-18 10:00:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-02-18 10:00:16,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2019-02-18 10:00:16,878 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2019-02-18 10:00:16,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:16,878 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2019-02-18 10:00:16,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-02-18 10:00:16,879 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2019-02-18 10:00:16,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-02-18 10:00:16,879 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:16,879 INFO L402 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2019-02-18 10:00:16,880 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:16,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:16,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2019-02-18 10:00:16,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:16,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:16,881 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:00:16,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:16,881 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:19,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:19,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:19,821 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:19,821 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:19,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:19,821 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 56 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:19,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:19,830 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:00:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:19,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:19,868 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:00:19,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:19,874 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:19,874 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:00:24,476 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:00:24,477 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:24,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:24,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:00:24,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:24,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:32,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:32,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:32,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58, 58] total 173 [2019-02-18 10:00:32,375 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:32,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2019-02-18 10:00:32,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2019-02-18 10:00:32,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-18 10:00:32,376 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 117 states. [2019-02-18 10:00:39,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:00:39,946 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2019-02-18 10:00:39,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-02-18 10:00:39,946 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 113 [2019-02-18 10:00:39,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:00:39,947 INFO L225 Difference]: With dead ends: 118 [2019-02-18 10:00:39,947 INFO L226 Difference]: Without dead ends: 117 [2019-02-18 10:00:39,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6840 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=3662, Invalid=26788, Unknown=0, NotChecked=0, Total=30450 [2019-02-18 10:00:39,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-02-18 10:00:39,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2019-02-18 10:00:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-02-18 10:00:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-02-18 10:00:39,953 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2019-02-18 10:00:39,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:00:39,953 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-02-18 10:00:39,953 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2019-02-18 10:00:39,953 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-02-18 10:00:39,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-02-18 10:00:39,954 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:00:39,954 INFO L402 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2019-02-18 10:00:39,954 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:00:39,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:00:39,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2019-02-18 10:00:39,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:00:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:39,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:00:39,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:00:39,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:00:39,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:00:40,211 WARN L181 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 10:00:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:43,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:43,042 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:00:43,042 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:00:43,043 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:00:43,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:00:43,043 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 57 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:00:43,053 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:00:43,053 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:00:43,146 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 57 check-sat command(s) [2019-02-18 10:00:43,146 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:00:43,149 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:00:43,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:00:43,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:43,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:43,238 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:00:47,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:00:47,640 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:00:47,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:00:47,643 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:00:47,736 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:47,736 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:00:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:00:55,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:00:55,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59, 59] total 176 [2019-02-18 10:00:55,859 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:00:55,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2019-02-18 10:00:55,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2019-02-18 10:00:55,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 10:00:55,861 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 119 states. [2019-02-18 10:01:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:01,955 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2019-02-18 10:01:01,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-02-18 10:01:01,955 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 115 [2019-02-18 10:01:01,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:01,957 INFO L225 Difference]: With dead ends: 120 [2019-02-18 10:01:01,957 INFO L226 Difference]: Without dead ends: 119 [2019-02-18 10:01:01,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=3784, Invalid=27722, Unknown=0, NotChecked=0, Total=31506 [2019-02-18 10:01:01,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-02-18 10:01:01,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2019-02-18 10:01:01,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-02-18 10:01:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2019-02-18 10:01:01,962 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2019-02-18 10:01:01,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:01,962 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2019-02-18 10:01:01,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2019-02-18 10:01:01,963 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2019-02-18 10:01:01,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-02-18 10:01:01,963 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:01,963 INFO L402 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2019-02-18 10:01:01,963 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:01,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:01,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2019-02-18 10:01:01,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:01,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:01,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:01,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:01,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:01,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:02,170 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 10:01:05,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:05,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:05,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:05,127 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:05,127 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:05,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:05,127 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 58 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:05,135 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:01:05,135 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:01:05,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:01:05,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:05,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:05,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:01:05,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:05,259 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:05,259 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:01:10,201 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:01:10,202 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:10,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:10,210 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:01:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:10,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:18,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:18,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 60, 60] total 179 [2019-02-18 10:01:18,851 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:18,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2019-02-18 10:01:18,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2019-02-18 10:01:18,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-18 10:01:18,853 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 121 states. [2019-02-18 10:01:24,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:24,213 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2019-02-18 10:01:24,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-02-18 10:01:24,214 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 117 [2019-02-18 10:01:24,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:24,215 INFO L225 Difference]: With dead ends: 122 [2019-02-18 10:01:24,215 INFO L226 Difference]: Without dead ends: 121 [2019-02-18 10:01:24,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7316 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=3908, Invalid=28672, Unknown=0, NotChecked=0, Total=32580 [2019-02-18 10:01:24,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-02-18 10:01:24,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2019-02-18 10:01:24,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-02-18 10:01:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2019-02-18 10:01:24,220 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2019-02-18 10:01:24,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:24,221 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2019-02-18 10:01:24,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2019-02-18 10:01:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2019-02-18 10:01:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-02-18 10:01:24,221 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:24,221 INFO L402 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2019-02-18 10:01:24,221 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:24,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2019-02-18 10:01:24,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:24,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:24,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:01:24,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:24,223 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:24,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:24,457 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 10:01:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:27,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:27,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:27,326 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:27,326 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:27,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:27,326 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 59 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:27,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:27,336 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:01:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:27,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:27,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:01:27,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:27,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:27,383 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:01:32,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:01:32,304 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:32,309 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:32,310 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:01:32,407 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:32,407 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:01:41,060 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:41,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:01:41,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 61, 61] total 182 [2019-02-18 10:01:41,078 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:01:41,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-02-18 10:01:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-02-18 10:01:41,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 10:01:41,080 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 123 states. [2019-02-18 10:01:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:01:48,371 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-02-18 10:01:48,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-02-18 10:01:48,377 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 119 [2019-02-18 10:01:48,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:01:48,378 INFO L225 Difference]: With dead ends: 124 [2019-02-18 10:01:48,378 INFO L226 Difference]: Without dead ends: 123 [2019-02-18 10:01:48,379 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7560 ImplicationChecksByTransitivity, 16.5s TimeCoverageRelationStatistics Valid=4034, Invalid=29638, Unknown=0, NotChecked=0, Total=33672 [2019-02-18 10:01:48,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-02-18 10:01:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-02-18 10:01:48,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-02-18 10:01:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2019-02-18 10:01:48,384 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2019-02-18 10:01:48,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:01:48,384 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2019-02-18 10:01:48,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-02-18 10:01:48,384 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2019-02-18 10:01:48,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-02-18 10:01:48,385 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:01:48,385 INFO L402 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2019-02-18 10:01:48,385 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:01:48,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:01:48,385 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2019-02-18 10:01:48,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:01:48,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:48,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:01:48,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:01:48,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:01:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:01:51,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:51,647 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:51,648 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:01:51,648 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:01:51,648 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:01:51,648 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:01:51,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 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 60 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:01:51,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:01:51,658 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:01:51,759 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 60 check-sat command(s) [2019-02-18 10:01:51,760 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:01:51,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:01:51,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:01:51,769 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:51,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:51,778 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:01:56,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:01:56,820 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:01:56,825 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:01:56,825 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:01:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:01:56,919 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:06,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:06,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 62, 62] total 185 [2019-02-18 10:02:06,004 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:06,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2019-02-18 10:02:06,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2019-02-18 10:02:06,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-18 10:02:06,006 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 125 states. [2019-02-18 10:02:14,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:14,878 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2019-02-18 10:02:14,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2019-02-18 10:02:14,878 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 121 [2019-02-18 10:02:14,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:14,879 INFO L225 Difference]: With dead ends: 126 [2019-02-18 10:02:14,879 INFO L226 Difference]: Without dead ends: 125 [2019-02-18 10:02:14,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7808 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=4162, Invalid=30620, Unknown=0, NotChecked=0, Total=34782 [2019-02-18 10:02:14,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-02-18 10:02:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-02-18 10:02:14,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-02-18 10:02:14,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-02-18 10:02:14,885 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2019-02-18 10:02:14,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:14,885 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-02-18 10:02:14,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2019-02-18 10:02:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-02-18 10:02:14,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-02-18 10:02:14,886 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:14,886 INFO L402 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2019-02-18 10:02:14,886 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:14,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:14,887 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2019-02-18 10:02:14,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:14,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:14,887 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:14,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:14,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:15,194 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 10:02:15,438 WARN L181 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 10:02:18,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:18,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:18,654 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:18,654 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:18,655 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:18,655 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:18,655 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 61 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:18,664 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:02:18,664 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:02:18,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:02:18,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:02:18,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:18,707 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:02:18,707 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:18,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:18,714 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:02:23,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:02:23,827 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:23,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:23,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:02:23,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:23,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:02:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:33,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:02:33,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 188 [2019-02-18 10:02:33,355 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:02:33,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2019-02-18 10:02:33,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2019-02-18 10:02:33,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 10:02:33,357 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 127 states. [2019-02-18 10:02:42,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:02:42,582 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2019-02-18 10:02:42,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-02-18 10:02:42,582 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 123 [2019-02-18 10:02:42,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:02:42,583 INFO L225 Difference]: With dead ends: 128 [2019-02-18 10:02:42,584 INFO L226 Difference]: Without dead ends: 127 [2019-02-18 10:02:42,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8060 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=4292, Invalid=31618, Unknown=0, NotChecked=0, Total=35910 [2019-02-18 10:02:42,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-02-18 10:02:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2019-02-18 10:02:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-02-18 10:02:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2019-02-18 10:02:42,591 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2019-02-18 10:02:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:02:42,591 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2019-02-18 10:02:42,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2019-02-18 10:02:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2019-02-18 10:02:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-02-18 10:02:42,592 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:02:42,592 INFO L402 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2019-02-18 10:02:42,592 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:02:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:02:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2019-02-18 10:02:42,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:02:42,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:42,594 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:02:42,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:02:42,594 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:02:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:42,886 WARN L181 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 10:02:43,141 WARN L181 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-02-18 10:02:43,403 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 10:02:43,696 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 10:02:43,980 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 10:02:47,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:47,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:47,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:02:47,279 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:02:47,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:02:47,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:02:47,279 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 62 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:02:47,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:02:47,288 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:02:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:02:47,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:02:47,328 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:02:47,329 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:47,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:47,337 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:02:52,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:02:52,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:02:52,745 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:02:52,745 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:02:52,844 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:02:52,844 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:02,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:02,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 64, 64] total 191 [2019-02-18 10:03:02,466 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:02,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2019-02-18 10:03:02,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2019-02-18 10:03:02,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-02-18 10:03:02,467 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 129 states. [2019-02-18 10:03:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:10,320 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2019-02-18 10:03:10,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-02-18 10:03:10,320 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 125 [2019-02-18 10:03:10,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:10,321 INFO L225 Difference]: With dead ends: 130 [2019-02-18 10:03:10,321 INFO L226 Difference]: Without dead ends: 129 [2019-02-18 10:03:10,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8316 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=4424, Invalid=32632, Unknown=0, NotChecked=0, Total=37056 [2019-02-18 10:03:10,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-02-18 10:03:10,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2019-02-18 10:03:10,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-02-18 10:03:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2019-02-18 10:03:10,327 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2019-02-18 10:03:10,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:10,327 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2019-02-18 10:03:10,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2019-02-18 10:03:10,327 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2019-02-18 10:03:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-02-18 10:03:10,328 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:10,328 INFO L402 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2019-02-18 10:03:10,328 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:10,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:10,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2019-02-18 10:03:10,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:10,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:10,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:03:10,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:10,329 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:13,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:13,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:13,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:13,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:13,860 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:13,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:13,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 63 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:03:13,870 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:03:13,870 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:03:13,987 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 63 check-sat command(s) [2019-02-18 10:03:13,987 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:13,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:13,993 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:03:13,993 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:14,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:14,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:03:19,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:03:19,554 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:19,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:19,559 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:03:19,663 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:19,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:29,564 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:29,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:29,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 194 [2019-02-18 10:03:29,583 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:29,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-02-18 10:03:29,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-02-18 10:03:29,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 10:03:29,586 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 131 states. [2019-02-18 10:03:36,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:03:36,025 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-02-18 10:03:36,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-02-18 10:03:36,026 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 127 [2019-02-18 10:03:36,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:03:36,027 INFO L225 Difference]: With dead ends: 132 [2019-02-18 10:03:36,027 INFO L226 Difference]: Without dead ends: 131 [2019-02-18 10:03:36,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 317 GetRequests, 122 SyntacticMatches, 1 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8576 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=4558, Invalid=33662, Unknown=0, NotChecked=0, Total=38220 [2019-02-18 10:03:36,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-02-18 10:03:36,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-02-18 10:03:36,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-02-18 10:03:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2019-02-18 10:03:36,033 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2019-02-18 10:03:36,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:03:36,034 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2019-02-18 10:03:36,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-02-18 10:03:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2019-02-18 10:03:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-02-18 10:03:36,034 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:03:36,034 INFO L402 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2019-02-18 10:03:36,034 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:03:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:03:36,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2019-02-18 10:03:36,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:03:36,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:36,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:03:36,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:03:36,036 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:03:36,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:03:36,214 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-02-18 10:03:39,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:39,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:39,795 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:03:39,795 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:03:39,796 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:03:39,796 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:03:39,796 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 64 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:03:39,810 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:03:39,810 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:03:39,849 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:03:39,850 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:03:39,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:03:39,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:03:39,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:39,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:39,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:03:45,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:03:45,564 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:03:45,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:03:45,569 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:03:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:45,690 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:03:55,756 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:03:55,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:03:55,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 66, 66] total 197 [2019-02-18 10:03:55,778 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:03:55,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-02-18 10:03:55,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-02-18 10:03:55,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-02-18 10:03:55,780 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 133 states. [2019-02-18 10:04:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:04,058 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2019-02-18 10:04:04,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-02-18 10:04:04,059 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 129 [2019-02-18 10:04:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:04,060 INFO L225 Difference]: With dead ends: 134 [2019-02-18 10:04:04,060 INFO L226 Difference]: Without dead ends: 133 [2019-02-18 10:04:04,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 124 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8840 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=4694, Invalid=34708, Unknown=0, NotChecked=0, Total=39402 [2019-02-18 10:04:04,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-02-18 10:04:04,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-02-18 10:04:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-02-18 10:04:04,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-02-18 10:04:04,065 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2019-02-18 10:04:04,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:04,066 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-02-18 10:04:04,066 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-02-18 10:04:04,066 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-02-18 10:04:04,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-02-18 10:04:04,066 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:04,067 INFO L402 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2019-02-18 10:04:04,067 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:04,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:04,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2019-02-18 10:04:04,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:04,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:04,068 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:04:04,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:04,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:07,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:07,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:07,618 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:07,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:07,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:07,618 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:04:07,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:07,626 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-18 10:04:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:07,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:07,670 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:04:07,670 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:07,676 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:07,676 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:04:13,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:04:13,738 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:13,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:13,748 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:04:13,856 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:13,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:24,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:24,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:24,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 200 [2019-02-18 10:04:24,371 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:24,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2019-02-18 10:04:24,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2019-02-18 10:04:24,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 10:04:24,373 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 135 states. [2019-02-18 10:04:34,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:04:34,693 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2019-02-18 10:04:34,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-02-18 10:04:34,693 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 131 [2019-02-18 10:04:34,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:04:34,694 INFO L225 Difference]: With dead ends: 136 [2019-02-18 10:04:34,694 INFO L226 Difference]: Without dead ends: 135 [2019-02-18 10:04:34,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9108 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=4832, Invalid=35770, Unknown=0, NotChecked=0, Total=40602 [2019-02-18 10:04:34,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-02-18 10:04:34,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2019-02-18 10:04:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-02-18 10:04:34,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2019-02-18 10:04:34,700 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2019-02-18 10:04:34,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:04:34,700 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2019-02-18 10:04:34,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2019-02-18 10:04:34,701 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2019-02-18 10:04:34,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-02-18 10:04:34,701 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:04:34,701 INFO L402 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2019-02-18 10:04:34,701 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:04:34,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:04:34,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2019-02-18 10:04:34,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:04:34,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:34,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-18 10:04:34,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:04:34,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:04:34,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:04:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:38,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:38,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:04:38,223 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:04:38,223 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:04:38,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:04:38,223 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 66 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:04:38,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-02-18 10:04:38,231 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-02-18 10:04:38,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 66 check-sat command(s) [2019-02-18 10:04:38,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:04:38,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:04:38,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:04:38,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:38,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:38,437 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:04:46,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:04:46,320 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:04:46,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:04:46,325 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:04:46,434 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:46,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:04:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:04:57,299 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:04:57,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 68, 68] total 203 [2019-02-18 10:04:57,299 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:04:57,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2019-02-18 10:04:57,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2019-02-18 10:04:57,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-18 10:04:57,302 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 137 states. [2019-02-18 10:05:04,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:04,572 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2019-02-18 10:05:04,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-02-18 10:05:04,573 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 133 [2019-02-18 10:05:04,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:04,574 INFO L225 Difference]: With dead ends: 138 [2019-02-18 10:05:04,574 INFO L226 Difference]: Without dead ends: 137 [2019-02-18 10:05:04,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9380 ImplicationChecksByTransitivity, 22.0s TimeCoverageRelationStatistics Valid=4972, Invalid=36848, Unknown=0, NotChecked=0, Total=41820 [2019-02-18 10:05:04,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-02-18 10:05:04,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2019-02-18 10:05:04,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-02-18 10:05:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2019-02-18 10:05:04,580 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2019-02-18 10:05:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:04,581 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2019-02-18 10:05:04,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2019-02-18 10:05:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2019-02-18 10:05:04,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-02-18 10:05:04,581 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:04,581 INFO L402 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2019-02-18 10:05:04,581 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:05:04,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:04,582 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2019-02-18 10:05:04,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:04,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:04,582 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:05:04,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:04,582 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:04,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:08,262 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:08,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:08,263 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-18 10:05:08,263 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-02-18 10:05:08,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-02-18 10:05:08,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-18 10:05:08,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 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 67 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-18 10:05:08,271 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-02-18 10:05:08,271 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-02-18 10:05:08,313 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-02-18 10:05:08,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-02-18 10:05:08,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-18 10:05:08,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2019-02-18 10:05:08,335 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:05:08,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:05:08,392 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2019-02-18 10:05:14,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 11 [2019-02-18 10:05:14,815 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-18 10:05:14,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-18 10:05:14,822 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:15 [2019-02-18 10:05:14,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:14,935 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-18 10:05:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-18 10:05:25,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-18 10:05:25,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69, 69] total 206 [2019-02-18 10:05:25,957 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-18 10:05:25,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-02-18 10:05:25,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-02-18 10:05:25,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 10:05:25,959 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 139 states. [2019-02-18 10:05:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-18 10:05:36,327 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-02-18 10:05:36,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2019-02-18 10:05:36,328 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 135 [2019-02-18 10:05:36,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-18 10:05:36,329 INFO L225 Difference]: With dead ends: 140 [2019-02-18 10:05:36,329 INFO L226 Difference]: Without dead ends: 139 [2019-02-18 10:05:36,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 130 SyntacticMatches, 1 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9656 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=5114, Invalid=37942, Unknown=0, NotChecked=0, Total=43056 [2019-02-18 10:05:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-02-18 10:05:36,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2019-02-18 10:05:36,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-02-18 10:05:36,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2019-02-18 10:05:36,336 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2019-02-18 10:05:36,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-18 10:05:36,337 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2019-02-18 10:05:36,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-02-18 10:05:36,337 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2019-02-18 10:05:36,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-02-18 10:05:36,337 INFO L394 BasicCegarLoop]: Found error trace [2019-02-18 10:05:36,338 INFO L402 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2019-02-18 10:05:36,338 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-02-18 10:05:36,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-18 10:05:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2019-02-18 10:05:36,338 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-18 10:05:36,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:36,339 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-02-18 10:05:36,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-18 10:05:36,339 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-18 10:05:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-18 10:05:36,591 WARN L181 SmtUtils]: Spent 164.00 ms on a formula simplification that was a NOOP. DAG size: 17